./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3a6df6a73687e4aa8bc49b1967f911266412674580da78e9d3bef4ed770909f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:20:12,055 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:20:12,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:20:12,147 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:20:12,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:20:12,193 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:20:12,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:20:12,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:20:12,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:20:12,198 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:20:12,198 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:20:12,198 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:20:12,199 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:20:12,199 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:20:12,199 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:20:12,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:20:12,202 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:20:12,202 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:20:12,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:20:12,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:20:12,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:20:12,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:20:12,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:20:12,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:20:12,206 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:20:12,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:20:12,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:20:12,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:20:12,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:20:12,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:20:12,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:20:12,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:20:12,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:20:12,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:20:12,209 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:20:12,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:20:12,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:20:12,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:20:12,210 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:20:12,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:20:12,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:20:12,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:20:12,212 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3a6df6a73687e4aa8bc49b1967f911266412674580da78e9d3bef4ed770909f [2024-10-11 07:20:12,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:20:12,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:20:12,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:20:12,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:20:12,481 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:20:12,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i [2024-10-11 07:20:13,934 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:20:14,165 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:20:14,166 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i [2024-10-11 07:20:14,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c770b6ad8/f18d73a6868844b3843c358c48313740/FLAG0b333be98 [2024-10-11 07:20:14,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c770b6ad8/f18d73a6868844b3843c358c48313740 [2024-10-11 07:20:14,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:20:14,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:20:14,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:20:14,515 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:20:14,520 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:20:14,521 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:14,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6934bc6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14, skipping insertion in model container [2024-10-11 07:20:14,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:14,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:20:14,724 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i[913,926] [2024-10-11 07:20:14,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:20:14,829 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:20:14,842 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i[913,926] [2024-10-11 07:20:14,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:20:14,911 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:20:14,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14 WrapperNode [2024-10-11 07:20:14,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:20:14,913 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:20:14,913 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:20:14,913 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:20:14,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:14,930 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:14,962 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-10-11 07:20:14,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:20:14,963 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:20:14,964 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:20:14,964 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:20:14,979 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:14,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:14,988 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:15,006 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:20:15,006 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:15,006 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:15,022 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:15,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:15,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:15,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:15,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:20:15,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:20:15,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:20:15,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:20:15,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (1/1) ... [2024-10-11 07:20:15,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:20:15,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:20:15,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:20:15,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:20:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:20:15,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:20:15,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:20:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:20:15,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:20:15,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:20:15,217 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:20:15,220 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:20:15,566 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 07:20:15,567 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:20:15,603 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:20:15,603 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:20:15,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:20:15 BoogieIcfgContainer [2024-10-11 07:20:15,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:20:15,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:20:15,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:20:15,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:20:15,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:20:14" (1/3) ... [2024-10-11 07:20:15,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8050e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:20:15, skipping insertion in model container [2024-10-11 07:20:15,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:14" (2/3) ... [2024-10-11 07:20:15,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b8050e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:20:15, skipping insertion in model container [2024-10-11 07:20:15,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:20:15" (3/3) ... [2024-10-11 07:20:15,613 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-35.i [2024-10-11 07:20:15,627 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:20:15,627 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:20:15,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:20:15,690 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72fe8e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:20:15,691 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:20:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 07:20:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 07:20:15,707 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:15,707 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:15,708 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:15,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1876747146, now seen corresponding path program 1 times [2024-10-11 07:20:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:20:15,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772565458] [2024-10-11 07:20:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:20:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:20:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:20:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:20:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:20:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:20:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:20:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:20:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:20:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:20:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:20:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:20:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:20:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:20:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:20:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:20:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:20:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:20:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:20:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 07:20:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 07:20:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 07:20:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 07:20:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 07:20:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 07:20:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 07:20:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 07:20:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 07:20:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 07:20:16,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:20:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772565458] [2024-10-11 07:20:16,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772565458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:20:16,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:20:16,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:20:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756079225] [2024-10-11 07:20:16,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:20:16,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:20:16,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:20:16,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:20:16,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:20:16,284 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.3863636363636365) internal successors, (61), 45 states have internal predecessors, (61), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 07:20:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:20:16,336 INFO L93 Difference]: Finished difference Result 145 states and 255 transitions. [2024-10-11 07:20:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:20:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 168 [2024-10-11 07:20:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:20:16,346 INFO L225 Difference]: With dead ends: 145 [2024-10-11 07:20:16,346 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 07:20:16,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:20:16,359 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:20:16,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:20:16,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 07:20:16,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 07:20:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 07:20:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2024-10-11 07:20:16,419 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 168 [2024-10-11 07:20:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:20:16,419 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2024-10-11 07:20:16,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 07:20:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2024-10-11 07:20:16,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 07:20:16,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:16,427 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:16,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:20:16,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:16,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:16,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1745689872, now seen corresponding path program 1 times [2024-10-11 07:20:16,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:20:16,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775103770] [2024-10-11 07:20:16,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:16,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:20:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:20:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:20:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:20:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:20:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:20:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:20:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:20:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:20:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:20:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:20:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:20:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:20:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:20:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:20:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:20:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:20:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:20:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:20:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 07:20:16,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 07:20:16,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 07:20:16,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 07:20:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 07:20:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 07:20:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 07:20:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 07:20:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 07:20:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 07:20:16,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:20:16,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775103770] [2024-10-11 07:20:16,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775103770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:20:16,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:20:16,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:20:16,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571918995] [2024-10-11 07:20:16,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:20:16,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:20:16,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:20:16,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:20:16,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:20:16,838 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:20:16,965 INFO L93 Difference]: Finished difference Result 188 states and 285 transitions. [2024-10-11 07:20:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:20:16,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-11 07:20:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:20:16,971 INFO L225 Difference]: With dead ends: 188 [2024-10-11 07:20:16,971 INFO L226 Difference]: Without dead ends: 117 [2024-10-11 07:20:16,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:20:16,975 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 60 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:20:16,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 221 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:20:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-11 07:20:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2024-10-11 07:20:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 70 states have (on average 1.3) internal successors, (91), 71 states have internal predecessors, (91), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 07:20:17,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 173 transitions. [2024-10-11 07:20:17,003 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 173 transitions. Word has length 168 [2024-10-11 07:20:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:20:17,005 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 173 transitions. [2024-10-11 07:20:17,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 173 transitions. [2024-10-11 07:20:17,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 07:20:17,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:17,009 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:17,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:20:17,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:17,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:17,010 INFO L85 PathProgramCache]: Analyzing trace with hash -774270062, now seen corresponding path program 1 times [2024-10-11 07:20:17,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:20:17,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702351520] [2024-10-11 07:20:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:20:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:20:17,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:20:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:20:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:20:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:20:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:20:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:20:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:20:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:20:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:20:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:20:17,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:20:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:20:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:20:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:20:17,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:20:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:20:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:20:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 07:20:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 07:20:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 07:20:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 07:20:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 07:20:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 07:20:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 07:20:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 07:20:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 07:20:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 07:20:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:20:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702351520] [2024-10-11 07:20:17,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702351520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:20:17,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:20:17,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:20:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705097875] [2024-10-11 07:20:17,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:20:17,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:20:17,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:20:17,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:20:17,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:20:17,473 INFO L87 Difference]: Start difference. First operand 114 states and 173 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:17,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:20:17,584 INFO L93 Difference]: Finished difference Result 273 states and 413 transitions. [2024-10-11 07:20:17,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:20:17,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-11 07:20:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:20:17,591 INFO L225 Difference]: With dead ends: 273 [2024-10-11 07:20:17,592 INFO L226 Difference]: Without dead ends: 160 [2024-10-11 07:20:17,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:20:17,595 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 66 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:20:17,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 180 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:20:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-11 07:20:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2024-10-11 07:20:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 79 states have internal predecessors, (104), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 07:20:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 186 transitions. [2024-10-11 07:20:17,627 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 186 transitions. Word has length 168 [2024-10-11 07:20:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:20:17,628 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 186 transitions. [2024-10-11 07:20:17,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 186 transitions. [2024-10-11 07:20:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 07:20:17,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:17,634 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:17,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:20:17,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:17,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2003855310, now seen corresponding path program 1 times [2024-10-11 07:20:17,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:20:17,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525006424] [2024-10-11 07:20:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:20:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:20:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:20:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:20:19,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:20:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:20:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:20:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:20:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:20:19,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:20:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:20:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:20:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:20:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:20:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:20:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:20:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:20:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:20:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:20:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 07:20:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 07:20:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 07:20:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 07:20:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 07:20:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 07:20:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:19,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 07:20:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 07:20:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 07:20:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 07:20:20,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:20:20,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525006424] [2024-10-11 07:20:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525006424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:20:20,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:20:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:20:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516201872] [2024-10-11 07:20:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:20:20,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:20:20,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:20:20,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:20:20,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:20:20,013 INFO L87 Difference]: Start difference. First operand 122 states and 186 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:20:20,539 INFO L93 Difference]: Finished difference Result 322 states and 485 transitions. [2024-10-11 07:20:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:20:20,542 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-11 07:20:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:20:20,545 INFO L225 Difference]: With dead ends: 322 [2024-10-11 07:20:20,545 INFO L226 Difference]: Without dead ends: 201 [2024-10-11 07:20:20,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:20:20,551 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 70 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 07:20:20,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 427 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 07:20:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-11 07:20:20,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 134. [2024-10-11 07:20:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 07:20:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 205 transitions. [2024-10-11 07:20:20,585 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 205 transitions. Word has length 168 [2024-10-11 07:20:20,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:20:20,587 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 205 transitions. [2024-10-11 07:20:20,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 205 transitions. [2024-10-11 07:20:20,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 07:20:20,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:20,591 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:20,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:20:20,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:20,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash -516104624, now seen corresponding path program 1 times [2024-10-11 07:20:20,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:20:20,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757592708] [2024-10-11 07:20:20,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:20,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:20:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:20:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:20:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:20:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:20:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:20:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:20:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:20:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:20:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:20:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:20:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:20:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:20:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:20:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:20:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:20:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:20:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:20:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:20:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 07:20:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 07:20:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 07:20:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 07:20:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 07:20:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 07:20:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 07:20:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 07:20:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 07:20:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:20,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 07:20:20,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:20:20,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757592708] [2024-10-11 07:20:20,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757592708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:20:20,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:20:20,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 07:20:20,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673438089] [2024-10-11 07:20:20,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:20:20,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 07:20:20,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:20:20,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 07:20:20,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:20:20,875 INFO L87 Difference]: Start difference. First operand 134 states and 205 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:20:21,096 INFO L93 Difference]: Finished difference Result 369 states and 556 transitions. [2024-10-11 07:20:21,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 07:20:21,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-11 07:20:21,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:20:21,102 INFO L225 Difference]: With dead ends: 369 [2024-10-11 07:20:21,104 INFO L226 Difference]: Without dead ends: 236 [2024-10-11 07:20:21,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 07:20:21,106 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 156 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:20:21,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 241 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:20:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-10-11 07:20:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 134. [2024-10-11 07:20:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 91 states have internal predecessors, (121), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 07:20:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 203 transitions. [2024-10-11 07:20:21,141 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 203 transitions. Word has length 168 [2024-10-11 07:20:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:20:21,142 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 203 transitions. [2024-10-11 07:20:21,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 203 transitions. [2024-10-11 07:20:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 07:20:21,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:21,144 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:21,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:20:21,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:21,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1279994736, now seen corresponding path program 1 times [2024-10-11 07:20:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:20:21,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812056744] [2024-10-11 07:20:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:20:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:20:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:20:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:20:22,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:20:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:20:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:20:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:20:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:20:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:20:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:20:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:20:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:20:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:20:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 07:20:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 07:20:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 07:20:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 07:20:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 07:20:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 07:20:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 07:20:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 07:20:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 07:20:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 07:20:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 07:20:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 07:20:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 07:20:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 07:20:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 07:20:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:20:22,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812056744] [2024-10-11 07:20:22,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812056744] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:20:22,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:20:22,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 07:20:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845469963] [2024-10-11 07:20:22,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:20:22,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 07:20:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:20:22,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 07:20:22,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:20:22,969 INFO L87 Difference]: Start difference. First operand 134 states and 203 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:20:23,244 INFO L93 Difference]: Finished difference Result 333 states and 500 transitions. [2024-10-11 07:20:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:20:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-10-11 07:20:23,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:20:23,248 INFO L225 Difference]: With dead ends: 333 [2024-10-11 07:20:23,250 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 07:20:23,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:20:23,252 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 72 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 07:20:23,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 365 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 07:20:23,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 07:20:23,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 133. [2024-10-11 07:20:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 90 states have internal predecessors, (119), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 07:20:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 201 transitions. [2024-10-11 07:20:23,277 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 201 transitions. Word has length 168 [2024-10-11 07:20:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:20:23,278 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 201 transitions. [2024-10-11 07:20:23,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 201 transitions. [2024-10-11 07:20:23,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-10-11 07:20:23,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:23,280 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:23,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:20:23,280 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:23,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:23,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1455491792, now seen corresponding path program 1 times [2024-10-11 07:20:23,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:20:23,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491180546] [2024-10-11 07:20:23,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:20:23,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 07:20:23,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [30537283] [2024-10-11 07:20:23,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:23,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:20:23,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:20:23,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:20:23,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:20:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:20:23,477 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:20:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:20:23,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:20:23,651 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:20:23,652 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:20:23,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 07:20:23,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:20:23,858 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:23,961 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:20:23,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:20:23 BoogieIcfgContainer [2024-10-11 07:20:23,964 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:20:23,965 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:20:23,965 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:20:23,965 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:20:23,965 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:20:15" (3/4) ... [2024-10-11 07:20:23,967 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:20:23,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:20:23,969 INFO L158 Benchmark]: Toolchain (without parser) took 9457.79ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 162.6MB in the beginning and 166.5MB in the end (delta: -3.9MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. [2024-10-11 07:20:23,969 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:20:23,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.08ms. Allocated memory is still 192.9MB. Free memory was 162.4MB in the beginning and 150.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-10-11 07:20:23,969 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.71ms. Allocated memory is still 192.9MB. Free memory was 150.1MB in the beginning and 146.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:20:23,969 INFO L158 Benchmark]: Boogie Preprocessor took 72.33ms. Allocated memory is still 192.9MB. Free memory was 146.9MB in the beginning and 143.5MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:20:23,970 INFO L158 Benchmark]: RCFGBuilder took 567.57ms. Allocated memory is still 192.9MB. Free memory was 143.5MB in the beginning and 119.6MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 07:20:23,970 INFO L158 Benchmark]: TraceAbstraction took 8357.92ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 118.8MB in the beginning and 167.6MB in the end (delta: -48.8MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2024-10-11 07:20:23,970 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 337.6MB. Free memory was 167.6MB in the beginning and 166.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:20:23,972 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.08ms. Allocated memory is still 192.9MB. Free memory was 162.4MB in the beginning and 150.1MB in the end (delta: 12.3MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.71ms. Allocated memory is still 192.9MB. Free memory was 150.1MB in the beginning and 146.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.33ms. Allocated memory is still 192.9MB. Free memory was 146.9MB in the beginning and 143.5MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 567.57ms. Allocated memory is still 192.9MB. Free memory was 143.5MB in the beginning and 119.6MB in the end (delta: 23.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8357.92ms. Allocated memory was 192.9MB in the beginning and 337.6MB in the end (delta: 144.7MB). Free memory was 118.8MB in the beginning and 167.6MB in the end (delta: -48.8MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 337.6MB. Free memory was 167.6MB in the beginning and 166.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someUnaryFLOAToperation at line 77, overapproximation of someBinaryArithmeticFLOAToperation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned short int var_1_6 = 25; [L28] signed char var_1_7 = 5; [L29] signed char var_1_8 = -5; [L30] double var_1_9 = 999.625; [L31] double var_1_10 = 5.06; [L32] unsigned short int var_1_11 = 5; [L33] signed short int var_1_12 = 2; [L34] signed long int var_1_13 = -256; [L35] double var_1_14 = 127.75; [L36] double var_1_15 = 9.75; [L37] float var_1_16 = 32.8; [L38] float var_1_17 = 32.5; [L39] float var_1_18 = 1.75; [L40] float var_1_19 = 1000000000000000.4; [L41] float var_1_20 = 0.875; [L42] unsigned char var_1_21 = 0; [L43] unsigned char var_1_22 = 0; [L44] signed short int var_1_23 = 64; [L45] signed short int var_1_24 = 25; [L46] signed short int var_1_25 = 0; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L88] var_1_2 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L89] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L90] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L90] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L91] var_1_3 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L92] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L93] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L93] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L94] var_1_4 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L95] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L96] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L96] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L97] var_1_5 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L98] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L99] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L99] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=5, var_1_8=-5, var_1_9=7997/8] [L100] var_1_7 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_7 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L101] RET assume_abort_if_not(var_1_7 >= -128) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L102] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L102] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=-5, var_1_9=7997/8] [L103] var_1_8 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_8 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L104] RET assume_abort_if_not(var_1_8 >= -128) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L105] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L105] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0, var_1_9=7997/8] [L106] var_1_9 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L107] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=253/50, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L108] var_1_10 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L109] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L110] var_1_11 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L111] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L112] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L112] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L113] var_1_15 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L114] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L115] var_1_17 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L116] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L117] var_1_18 = __VERIFIER_nondet_float() [L118] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L118] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L119] var_1_19 = __VERIFIER_nondet_float() [L120] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L120] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L121] var_1_20 = __VERIFIER_nondet_float() [L122] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L122] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L123] var_1_22 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L124] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L125] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L125] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L126] var_1_24 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L127] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L128] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L128] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L129] var_1_25 = __VERIFIER_nondet_short() [L130] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L130] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L131] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L131] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L144] RET updateVariables() [L145] CALL step() [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L55] COND TRUE var_1_7 >= var_1_8 VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_7=0, var_1_8=0] [L56] COND TRUE (var_1_9 - 1.00000000000025E12) >= var_1_10 [L57] var_1_6 = 200 VAL [isInitial=1, var_1_11=65534, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L64] COND TRUE var_1_11 > var_1_6 [L65] var_1_12 = 32 VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L67] COND FALSE !(var_1_12 == var_1_7) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L72] EXPR var_1_11 >> var_1_8 VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L72] COND TRUE (var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12) [L73] var_1_14 = var_1_15 VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L77] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L78] COND FALSE !(var_1_11 == var_1_6) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L81] COND TRUE var_1_18 > var_1_9 [L82] var_1_23 = (((((var_1_24 - var_1_25)) > (var_1_7)) ? ((var_1_24 - var_1_25)) : (var_1_7))) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR ((((var_1_2 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((var_1_7 >= var_1_8) ? (((var_1_9 - 1.00000000000025E12) >= var_1_10) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_12 == var_1_7) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((var_1_8 + var_1_12) + (var_1_11 - var_1_6)))) : 1) : 1)) && (((var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L136-L137] return (((((((var_1_2 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((var_1_7 >= var_1_8) ? (((var_1_9 - 1.00000000000025E12) >= var_1_10) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_12 == var_1_7) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((var_1_8 + var_1_12) + (var_1_11 - var_1_6)))) : 1) : 1)) && (((var_1_7 + var_1_6) < ((var_1_11 >> var_1_8) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (var_1_7)) ? ((var_1_24 - var_1_25)) : (var_1_7))))) : (var_1_23 == ((signed short int) (var_1_7 + 1)))) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_11=65534, var_1_12=32, var_1_13=-256, var_1_14=2, var_1_15=2, var_1_16=3, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_2=0, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 7, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 424 mSDsluCounter, 1541 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 861 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 528 IncrementalHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 680 mSDtfsCounter, 528 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=4, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 277 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1346 NumberOfCodeBlocks, 1346 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1002 ConstructedInterpolants, 0 QuantifiedInterpolants, 3215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 8424/8424 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:20:24,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3a6df6a73687e4aa8bc49b1967f911266412674580da78e9d3bef4ed770909f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:20:26,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:20:26,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:20:26,285 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:20:26,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:20:26,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:20:26,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:20:26,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:20:26,320 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:20:26,321 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:20:26,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:20:26,321 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:20:26,322 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:20:26,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:20:26,324 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:20:26,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:20:26,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:20:26,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:20:26,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:20:26,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:20:26,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:20:26,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:20:26,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:20:26,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:20:26,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:20:26,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:20:26,332 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:20:26,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:20:26,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:20:26,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:20:26,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:20:26,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:20:26,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:20:26,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:20:26,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:20:26,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:20:26,342 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:20:26,344 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:20:26,344 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:20:26,344 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:20:26,344 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:20:26,345 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:20:26,345 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:20:26,345 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:20:26,345 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:20:26,345 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3a6df6a73687e4aa8bc49b1967f911266412674580da78e9d3bef4ed770909f [2024-10-11 07:20:26,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:20:26,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:20:26,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:20:26,700 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:20:26,701 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:20:26,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i [2024-10-11 07:20:28,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:20:28,496 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:20:28,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i [2024-10-11 07:20:28,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e5b67b70/f2d048efb5a14052a17912bec25ba0a0/FLAGf06dbe2fb [2024-10-11 07:20:28,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8e5b67b70/f2d048efb5a14052a17912bec25ba0a0 [2024-10-11 07:20:28,530 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:20:28,531 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:20:28,533 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:20:28,534 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:20:28,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:20:28,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:28,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f525b67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28, skipping insertion in model container [2024-10-11 07:20:28,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:28,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:20:28,772 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i[913,926] [2024-10-11 07:20:28,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:20:28,873 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:20:28,886 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-35.i[913,926] [2024-10-11 07:20:28,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:20:28,972 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:20:28,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28 WrapperNode [2024-10-11 07:20:28,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:20:28,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:20:28,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:20:28,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:20:28,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:28,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,033 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-10-11 07:20:29,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:20:29,035 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:20:29,035 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:20:29,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:20:29,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,076 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:20:29,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,091 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,099 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:20:29,116 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:20:29,117 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:20:29,117 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:20:29,117 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (1/1) ... [2024-10-11 07:20:29,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:20:29,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:20:29,153 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:20:29,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:20:29,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:20:29,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:20:29,200 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:20:29,201 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:20:29,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:20:29,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:20:29,306 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:20:29,308 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:20:30,699 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-11 07:20:30,700 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:20:30,764 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:20:30,765 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:20:30,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:20:30 BoogieIcfgContainer [2024-10-11 07:20:30,766 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:20:30,768 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:20:30,768 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:20:30,771 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:20:30,772 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:20:28" (1/3) ... [2024-10-11 07:20:30,773 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481923af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:20:30, skipping insertion in model container [2024-10-11 07:20:30,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:20:28" (2/3) ... [2024-10-11 07:20:30,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481923af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:20:30, skipping insertion in model container [2024-10-11 07:20:30,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:20:30" (3/3) ... [2024-10-11 07:20:30,776 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-35.i [2024-10-11 07:20:30,790 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:20:30,791 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:20:30,862 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:20:30,868 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@218a410, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:20:30,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:20:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 07:20:30,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 07:20:30,887 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:30,888 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:30,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:30,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -690171036, now seen corresponding path program 1 times [2024-10-11 07:20:30,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:20:30,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888962886] [2024-10-11 07:20:30,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:30,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:20:30,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:20:30,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:20:30,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:20:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:31,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:20:31,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:20:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 724 proven. 0 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2024-10-11 07:20:31,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:20:31,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:20:31,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888962886] [2024-10-11 07:20:31,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888962886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:20:31,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:20:31,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:20:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842469114] [2024-10-11 07:20:31,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:20:31,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:20:31,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:20:31,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:20:31,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:20:31,383 INFO L87 Difference]: Start difference. First operand has 67 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 07:20:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:20:31,959 INFO L93 Difference]: Finished difference Result 131 states and 235 transitions. [2024-10-11 07:20:31,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:20:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 165 [2024-10-11 07:20:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:20:31,980 INFO L225 Difference]: With dead ends: 131 [2024-10-11 07:20:31,980 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 07:20:31,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:20:31,985 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 07:20:31,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 07:20:32,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 07:20:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 07:20:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 07:20:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 100 transitions. [2024-10-11 07:20:32,029 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 100 transitions. Word has length 165 [2024-10-11 07:20:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:20:32,030 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 100 transitions. [2024-10-11 07:20:32,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 07:20:32,030 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2024-10-11 07:20:32,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 07:20:32,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:32,036 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:32,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:20:32,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:20:32,237 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:32,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:32,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1039431582, now seen corresponding path program 1 times [2024-10-11 07:20:32,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:20:32,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365132351] [2024-10-11 07:20:32,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:32,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:20:32,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:20:32,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:20:32,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:20:32,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:32,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:20:32,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:20:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 07:20:32,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:20:32,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:20:32,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365132351] [2024-10-11 07:20:32,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [365132351] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:20:32,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:20:32,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:20:32,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811494854] [2024-10-11 07:20:32,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:20:32,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:20:32,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:20:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:20:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:20:32,650 INFO L87 Difference]: Start difference. First operand 65 states and 100 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:20:33,733 INFO L93 Difference]: Finished difference Result 168 states and 257 transitions. [2024-10-11 07:20:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:20:33,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 165 [2024-10-11 07:20:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:20:33,737 INFO L225 Difference]: With dead ends: 168 [2024-10-11 07:20:33,737 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 07:20:33,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:20:33,739 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:20:33,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 215 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 07:20:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 07:20:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-10-11 07:20:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-10-11 07:20:33,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 154 transitions. [2024-10-11 07:20:33,769 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 154 transitions. Word has length 165 [2024-10-11 07:20:33,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:20:33,771 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 154 transitions. [2024-10-11 07:20:33,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 07:20:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 154 transitions. [2024-10-11 07:20:33,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-11 07:20:33,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:20:33,774 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:20:33,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-11 07:20:33,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:20:33,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:20:33,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:20:33,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1719489952, now seen corresponding path program 1 times [2024-10-11 07:20:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:20:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665043190] [2024-10-11 07:20:33,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:20:33,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:20:33,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:20:33,979 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:20:33,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:20:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:20:34,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 07:20:34,395 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:21:03,920 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)