./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_fillercode_fillercodesize_ps-cn-10_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:17:35,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:17:35,688 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:17:35,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:17:35,696 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:17:35,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:17:35,722 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:17:35,722 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:17:35,723 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:17:35,723 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:17:35,724 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:17:35,724 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:17:35,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:17:35,727 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:17:35,727 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:17:35,727 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:17:35,728 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:17:35,728 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:17:35,728 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:17:35,728 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:17:35,729 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:17:35,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:17:35,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:17:35,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:17:35,734 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:17:35,734 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:17:35,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:17:35,735 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:17:35,735 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:17:35,735 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:17:35,735 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:17:35,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:17:35,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:17:35,736 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:17:35,736 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:17:35,737 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:17:35,737 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:17:35,737 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:17:35,737 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:17:35,737 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:17:35,738 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:17:35,739 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:17:35,739 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/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/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 -> c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb [2024-11-20 03:17:36,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:17:36,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:17:36,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:17:36,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:17:36,034 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:17:36,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-20 03:17:37,502 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:17:37,764 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:17:37,775 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-20 03:17:37,786 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068c4bfc2/18352edaf31f4dd49facfdea2031c811/FLAG9717042c1 [2024-11-20 03:17:38,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/068c4bfc2/18352edaf31f4dd49facfdea2031c811 [2024-11-20 03:17:38,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:17:38,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:17:38,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:17:38,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:17:38,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:17:38,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f0c061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38, skipping insertion in model container [2024-11-20 03:17:38,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:17:38,312 WARN L250 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_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2024-11-20 03:17:38,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:17:38,409 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:17:38,419 WARN L250 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_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2024-11-20 03:17:38,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:17:38,465 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:17:38,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38 WrapperNode [2024-11-20 03:17:38,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:17:38,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:17:38,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:17:38,468 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:17:38,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,541 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-20 03:17:38,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:17:38,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:17:38,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:17:38,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:17:38,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,580 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-11-20 03:17:38,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,581 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:17:38,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:17:38,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:17:38,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:17:38,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (1/1) ... [2024-11-20 03:17:38,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:17:38,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:17:38,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 03:17:38,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 03:17:38,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:17:38,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:17:38,700 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:17:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:17:38,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:17:38,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:17:38,789 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:17:38,792 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:17:39,167 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-20 03:17:39,168 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:17:39,183 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:17:39,183 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:17:39,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:17:39 BoogieIcfgContainer [2024-11-20 03:17:39,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:17:39,186 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:17:39,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:17:39,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:17:39,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:17:38" (1/3) ... [2024-11-20 03:17:39,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0d61f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:17:39, skipping insertion in model container [2024-11-20 03:17:39,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:38" (2/3) ... [2024-11-20 03:17:39,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0d61f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:17:39, skipping insertion in model container [2024-11-20 03:17:39,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:17:39" (3/3) ... [2024-11-20 03:17:39,192 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-20 03:17:39,205 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:17:39,205 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:17:39,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:17:39,267 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;@7ec8efce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:17:39,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:17:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 03:17:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 03:17:39,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:17:39,287 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:17:39,287 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:17:39,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:17:39,293 INFO L85 PathProgramCache]: Analyzing trace with hash -141369586, now seen corresponding path program 1 times [2024-11-20 03:17:39,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:17:39,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264102360] [2024-11-20 03:17:39,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:39,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:17:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:17:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:17:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:17:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:17:39,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 03:17:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:17:39,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:17:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 03:17:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 03:17:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:17:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 03:17:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:17:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 03:17:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:17:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:17:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:17:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:17:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:17:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:17:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:17:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:17:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:17:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 03:17:39,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:17:39,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264102360] [2024-11-20 03:17:39,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264102360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:17:39,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:17:39,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:17:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144656452] [2024-11-20 03:17:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:17:39,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:17:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:17:39,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:17:39,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:17:39,826 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 50 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 03:17:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:17:39,862 INFO L93 Difference]: Finished difference Result 141 states and 242 transitions. [2024-11-20 03:17:39,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:17:39,865 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-11-20 03:17:39,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:17:39,872 INFO L225 Difference]: With dead ends: 141 [2024-11-20 03:17:39,872 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 03:17:39,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-11-20 03:17:39,878 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:17:39,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:17:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 03:17:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 03:17:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 03:17:39,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-11-20 03:17:39,975 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 144 [2024-11-20 03:17:39,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:17:39,976 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-11-20 03:17:39,976 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 03:17:39,976 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-11-20 03:17:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 03:17:39,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:17:39,982 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:17:39,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:17:39,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:17:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:17:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1057895541, now seen corresponding path program 1 times [2024-11-20 03:17:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:17:39,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819682306] [2024-11-20 03:17:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:17:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:17:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:17:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:17:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:17:41,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 03:17:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:17:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:17:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 03:17:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 03:17:41,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:17:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 03:17:41,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:17:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 03:17:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:17:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:17:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:17:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:17:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:17:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:17:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:17:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:17:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:17:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 03:17:41,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:17:41,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819682306] [2024-11-20 03:17:41,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819682306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:17:41,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:17:41,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 03:17:41,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150265581] [2024-11-20 03:17:41,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:17:41,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 03:17:41,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:17:41,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 03:17:41,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 03:17:41,442 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 03:17:41,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:17:41,798 INFO L93 Difference]: Finished difference Result 219 states and 329 transitions. [2024-11-20 03:17:41,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 03:17:41,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-20 03:17:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:17:41,804 INFO L225 Difference]: With dead ends: 219 [2024-11-20 03:17:41,807 INFO L226 Difference]: Without dead ends: 152 [2024-11-20 03:17:41,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-20 03:17:41,809 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 119 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:17:41,811 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 433 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:17:41,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-20 03:17:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 128. [2024-11-20 03:17:41,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.308641975308642) internal successors, (106), 81 states have internal predecessors, (106), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 03:17:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 194 transitions. [2024-11-20 03:17:41,863 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 194 transitions. Word has length 145 [2024-11-20 03:17:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:17:41,865 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 194 transitions. [2024-11-20 03:17:41,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 03:17:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 194 transitions. [2024-11-20 03:17:41,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 03:17:41,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:17:41,869 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:17:41,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:17:41,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:17:41,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:17:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 717111821, now seen corresponding path program 1 times [2024-11-20 03:17:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:17:41,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226690898] [2024-11-20 03:17:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:41,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:17:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:17:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:17:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:17:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:17:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 03:17:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:17:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:17:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 03:17:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 03:17:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:17:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 03:17:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:17:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 03:17:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:17:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:17:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:17:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:17:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:17:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:17:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:17:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:17:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:17:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 03:17:42,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:17:42,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226690898] [2024-11-20 03:17:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226690898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:17:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:17:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 03:17:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251644989] [2024-11-20 03:17:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:17:42,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:17:42,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:17:42,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:17:42,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:17:42,567 INFO L87 Difference]: Start difference. First operand 128 states and 194 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 03:17:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:17:42,869 INFO L93 Difference]: Finished difference Result 215 states and 323 transitions. [2024-11-20 03:17:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:17:42,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-20 03:17:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:17:42,875 INFO L225 Difference]: With dead ends: 215 [2024-11-20 03:17:42,875 INFO L226 Difference]: Without dead ends: 142 [2024-11-20 03:17:42,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:17:42,880 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 83 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:17:42,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 332 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:17:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-20 03:17:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2024-11-20 03:17:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 81 states have (on average 1.2962962962962963) internal successors, (105), 81 states have internal predecessors, (105), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 03:17:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 193 transitions. [2024-11-20 03:17:42,915 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 193 transitions. Word has length 145 [2024-11-20 03:17:42,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:17:42,916 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 193 transitions. [2024-11-20 03:17:42,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 03:17:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 193 transitions. [2024-11-20 03:17:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 03:17:42,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:17:42,921 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:17:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 03:17:42,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:17:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:17:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1691307619, now seen corresponding path program 1 times [2024-11-20 03:17:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:17:42,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949181627] [2024-11-20 03:17:42,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:17:42,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:17:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:17:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:17:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:17:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 03:17:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:17:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:17:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 03:17:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 03:17:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:17:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 03:17:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:17:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 03:17:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:17:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:17:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:17:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:17:43,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:17:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:17:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:17:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:17:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:17:43,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 03:17:43,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:17:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949181627] [2024-11-20 03:17:43,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949181627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:17:43,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:17:43,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 03:17:43,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21547722] [2024-11-20 03:17:43,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:17:43,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:17:43,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:17:43,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:17:43,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:17:43,188 INFO L87 Difference]: Start difference. First operand 128 states and 193 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 03:17:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:17:43,369 INFO L93 Difference]: Finished difference Result 219 states and 328 transitions. [2024-11-20 03:17:43,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:17:43,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2024-11-20 03:17:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:17:43,371 INFO L225 Difference]: With dead ends: 219 [2024-11-20 03:17:43,372 INFO L226 Difference]: Without dead ends: 142 [2024-11-20 03:17:43,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:17:43,373 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 97 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 03:17:43,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 417 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 03:17:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-20 03:17:43,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-11-20 03:17:43,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 03:17:43,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 204 transitions. [2024-11-20 03:17:43,413 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 204 transitions. Word has length 146 [2024-11-20 03:17:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:17:43,414 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 204 transitions. [2024-11-20 03:17:43,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 03:17:43,415 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 204 transitions. [2024-11-20 03:17:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 03:17:43,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:17:43,418 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:17:43,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 03:17:43,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:17:43,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:17:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2119471841, now seen corresponding path program 1 times [2024-11-20 03:17:43,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:17:43,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460589630] [2024-11-20 03:17:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:43,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:17:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:17:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:17:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:17:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:17:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 03:17:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:17:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 03:17:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 03:17:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 03:17:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:17:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 03:17:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:17:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 03:17:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:17:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:17:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:17:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:17:44,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:17:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:17:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:17:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:17:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:17:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-20 03:17:44,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:17:44,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460589630] [2024-11-20 03:17:44,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460589630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:17:44,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357974221] [2024-11-20 03:17:44,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:44,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:17:44,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:17:44,396 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 03:17:44,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 03:17:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:44,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 03:17:44,554 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:17:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 505 proven. 84 refuted. 0 times theorem prover too weak. 335 trivial. 0 not checked. [2024-11-20 03:17:45,162 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:17:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 87 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-20 03:17:45,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357974221] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 03:17:45,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 03:17:45,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2024-11-20 03:17:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966474779] [2024-11-20 03:17:45,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 03:17:45,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-20 03:17:45,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:17:45,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-20 03:17:45,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2024-11-20 03:17:45,687 INFO L87 Difference]: Start difference. First operand 138 states and 204 transitions. Second operand has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 5 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-20 03:17:47,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:17:47,490 INFO L93 Difference]: Finished difference Result 315 states and 433 transitions. [2024-11-20 03:17:47,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-20 03:17:47,492 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 5 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 147 [2024-11-20 03:17:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:17:47,494 INFO L225 Difference]: With dead ends: 315 [2024-11-20 03:17:47,494 INFO L226 Difference]: Without dead ends: 239 [2024-11-20 03:17:47,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 327 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=670, Invalid=2870, Unknown=0, NotChecked=0, Total=3540 [2024-11-20 03:17:47,497 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 526 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 03:17:47,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 574 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 03:17:47,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-20 03:17:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 150. [2024-11-20 03:17:47,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 97 states have (on average 1.2061855670103092) internal successors, (117), 97 states have internal predecessors, (117), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-20 03:17:47,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 205 transitions. [2024-11-20 03:17:47,524 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 205 transitions. Word has length 147 [2024-11-20 03:17:47,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:17:47,525 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 205 transitions. [2024-11-20 03:17:47,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.090909090909091) internal successors, (90), 22 states have internal predecessors, (90), 5 states have call successors, (64), 3 states have call predecessors, (64), 7 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-20 03:17:47,527 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 205 transitions. [2024-11-20 03:17:47,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 03:17:47,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:17:47,528 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:17:47,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 03:17:47,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:17:47,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:17:47,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:17:47,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1439413471, now seen corresponding path program 1 times [2024-11-20 03:17:47,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:17:47,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283975967] [2024-11-20 03:17:47,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:47,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:17:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 03:17:47,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381760839] [2024-11-20 03:17:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:47,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:17:47,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:17:47,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 03:17:47,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 03:17:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:17:48,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 03:17:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:17:48,298 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 03:17:48,298 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 03:17:48,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 03:17:48,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 03:17:48,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 03:17:48,507 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-20 03:17:48,610 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 03:17:48,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:17:48 BoogieIcfgContainer [2024-11-20 03:17:48,615 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 03:17:48,616 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 03:17:48,616 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 03:17:48,616 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 03:17:48,617 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:17:39" (3/4) ... [2024-11-20 03:17:48,619 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 03:17:48,620 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 03:17:48,620 INFO L158 Benchmark]: Toolchain (without parser) took 10531.00ms. Allocated memory was 203.4MB in the beginning and 308.3MB in the end (delta: 104.9MB). Free memory was 174.2MB in the beginning and 179.7MB in the end (delta: -5.4MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. [2024-11-20 03:17:48,621 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 87.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 03:17:48,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.92ms. Allocated memory is still 203.4MB. Free memory was 173.9MB in the beginning and 157.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 03:17:48,621 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.79ms. Allocated memory is still 203.4MB. Free memory was 157.1MB in the beginning and 153.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 03:17:48,622 INFO L158 Benchmark]: Boogie Preprocessor took 55.68ms. Allocated memory is still 203.4MB. Free memory was 153.9MB in the beginning and 149.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 03:17:48,622 INFO L158 Benchmark]: RCFGBuilder took 585.22ms. Allocated memory is still 203.4MB. Free memory was 149.7MB in the beginning and 126.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 03:17:48,622 INFO L158 Benchmark]: TraceAbstraction took 9429.08ms. Allocated memory was 203.4MB in the beginning and 308.3MB in the end (delta: 104.9MB). Free memory was 125.6MB in the beginning and 179.7MB in the end (delta: -54.1MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2024-11-20 03:17:48,622 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 308.3MB. Free memory is still 179.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 03:17:48,624 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.16ms. Allocated memory is still 125.8MB. Free memory was 87.4MB in the beginning and 87.3MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.92ms. Allocated memory is still 203.4MB. Free memory was 173.9MB in the beginning and 157.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.79ms. Allocated memory is still 203.4MB. Free memory was 157.1MB in the beginning and 153.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.68ms. Allocated memory is still 203.4MB. Free memory was 153.9MB in the beginning and 149.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 585.22ms. Allocated memory is still 203.4MB. Free memory was 149.7MB in the beginning and 126.7MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9429.08ms. Allocated memory was 203.4MB in the beginning and 308.3MB in the end (delta: 104.9MB). Free memory was 125.6MB in the beginning and 179.7MB in the end (delta: -54.1MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 308.3MB. Free memory is still 179.7MB. 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 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 147. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1000; [L23] unsigned char var_1_5 = 1; [L24] unsigned char var_1_6 = 0; [L25] float var_1_7 = 0.6; [L26] unsigned long int var_1_8 = 32; [L27] unsigned long int var_1_9 = 32; [L28] float var_1_11 = 5.5; [L29] unsigned long int var_1_12 = 128; [L30] unsigned char var_1_13 = 16; [L31] unsigned char var_1_14 = 0; [L32] unsigned long int var_1_15 = 8; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] double var_1_18 = 1.8; [L36] double var_1_19 = 4.5; [L37] double var_1_20 = 15.5; [L38] signed char var_1_21 = -5; [L39] signed char var_1_22 = 64; [L40] unsigned long int var_1_23 = 4; [L41] unsigned long int var_1_24 = 16; [L42] signed char var_1_25 = -100; [L43] float var_1_26 = 1000000.6; [L44] float var_1_27 = 4.5; [L45] double var_1_28 = 64.5; [L46] unsigned char var_1_29 = 0; [L47] unsigned long int last_1_var_1_1 = 1000; [L48] unsigned char last_1_var_1_5 = 1; [L49] unsigned long int last_1_var_1_12 = 128; [L50] unsigned char last_1_var_1_13 = 16; [L51] unsigned long int last_1_var_1_15 = 8; VAL [isInitial=0, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L151] isInitial = 1 [L152] FCALL initially() [L153] COND TRUE 1 [L154] CALL updateLastVariables() [L140] last_1_var_1_1 = var_1_1 [L141] last_1_var_1_5 = var_1_5 [L142] last_1_var_1_12 = var_1_12 [L143] last_1_var_1_13 = var_1_13 [L144] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L154] RET updateLastVariables() [L155] CALL updateVariables() [L104] var_1_6 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L105] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_7=3/5, var_1_8=32, var_1_9=32] [L106] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L106] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=32, var_1_9=32] [L107] var_1_8 = __VERIFIER_nondet_ulong() [L108] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L108] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L109] CALL assume_abort_if_not(var_1_8 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L109] RET assume_abort_if_not(var_1_8 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_9=32] [L110] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=32] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=32] [L110] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=32] [L111] var_1_9 = __VERIFIER_nondet_ulong() [L112] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2] [L112] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2] [L113] CALL assume_abort_if_not(var_1_9 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2] [L113] RET assume_abort_if_not(var_1_9 <= 4294967295) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2] [L114] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L114] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=11/2, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L115] var_1_11 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L116] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=0, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L117] var_1_14 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L118] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L119] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L119] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L120] var_1_17 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L121] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L122] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L122] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_19=9/2, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L123] var_1_19 = __VERIFIER_nondet_double() [L124] 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, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L124] 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, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_20=31/2, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L125] var_1_20 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L126] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=64, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L127] var_1_22 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L128] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L129] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L129] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=16, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L130] var_1_24 = __VERIFIER_nondet_ulong() [L131] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L131] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L132] CALL assume_abort_if_not(var_1_24 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L132] RET assume_abort_if_not(var_1_24 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_27=9/2, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L133] var_1_27 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L134] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=0, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L135] var_1_29 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L136] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L137] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L137] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-5, var_1_22=-1, var_1_23=4, var_1_24=0, var_1_25=-100, var_1_26=5000003/5, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L155] RET updateVariables() [L156] CALL step() [L55] var_1_21 = var_1_22 [L56] var_1_23 = var_1_24 [L57] var_1_25 = var_1_22 [L58] var_1_26 = var_1_27 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L59] EXPR var_1_24 >> var_1_22 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L59] EXPR 256u ^ (var_1_24 >> var_1_22) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=129/2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L59] COND TRUE (256u ^ (var_1_24 >> var_1_22)) != var_1_23 [L60] COND TRUE \read(var_1_29) [L61] var_1_28 = var_1_27 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L64] signed long int stepLocal_1 = last_1_var_1_13; [L65] signed long int stepLocal_0 = last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_1=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L66] COND TRUE stepLocal_1 < ((- last_1_var_1_12) * 64) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=1000, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L67] COND TRUE \read(last_1_var_1_5) [L68] var_1_1 = ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L77] unsigned long int stepLocal_2 = last_1_var_1_15 + last_1_var_1_1; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_2=1008, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=1, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L78] COND TRUE last_1_var_1_13 <= stepLocal_2 [L79] var_1_5 = ((last_1_var_1_15 == last_1_var_1_13) && var_1_6) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L83] unsigned char stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, stepLocal_3=0, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L84] COND FALSE !(stepLocal_3 || var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=16, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L87] var_1_13 = ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))) [L88] var_1_16 = (var_1_6 && var_1_17) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L89] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3/5, var_1_8=2, var_1_9=17] [L92] COND FALSE !((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) [L97] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=3, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=2, var_1_9=17] [L99] COND TRUE var_1_7 <= (- (32.8f + var_1_7)) [L100] var_1_12 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, stepLocal_0=16, var_1_11=3, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=2, var_1_9=17] [L156] RET step() [L157] CALL, EXPR property() [L147-L148] return ((((((((last_1_var_1_13 < ((- last_1_var_1_12) * 64)) ? (last_1_var_1_5 ? (var_1_1 == ((unsigned long int) ((((last_1_var_1_12) < 0 ) ? -(last_1_var_1_12) : (last_1_var_1_12))))) : ((-10000000 < last_1_var_1_13) ? (var_1_1 == ((unsigned long int) (((((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) < 0 ) ? -((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))) : ((((last_1_var_1_12) > (5u)) ? (last_1_var_1_12) : (5u))))))) : (var_1_1 == ((unsigned long int) 50u)))) : 1) && ((last_1_var_1_13 <= (last_1_var_1_15 + last_1_var_1_1)) ? (var_1_5 == ((unsigned char) ((last_1_var_1_15 == last_1_var_1_13) && var_1_6))) : (var_1_5 == ((unsigned char) var_1_6)))) && (((var_1_15 + (var_1_15 * var_1_13)) <= ((32u / var_1_8) / var_1_9)) ? ((1.25f < var_1_18) ? (var_1_7 == ((float) 1000000.1f)) : 1) : (var_1_7 == ((float) var_1_11)))) && ((var_1_7 <= (- (32.8f + var_1_7))) ? (var_1_12 == ((unsigned long int) last_1_var_1_12)) : 1)) && (var_1_13 == ((unsigned char) ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) && (var_1_5 ? (var_1_15 == ((unsigned long int) ((((var_1_1) > ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14)))))) ? (var_1_1) : ((var_1_13 + ((((var_1_14) < 0 ) ? -(var_1_14) : (var_1_14))))))))) : 1)) && (var_1_16 == ((unsigned char) (var_1_6 && var_1_17)))) && ((var_1_5 || var_1_17) ? (var_1_18 == ((double) ((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) + var_1_20) - 63.6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=2, var_1_9=17] [L157] RET, EXPR property() [L157] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=2, var_1_9=17] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=128, last_1_var_1_13=16, last_1_var_1_15=8, last_1_var_1_1=1000, last_1_var_1_5=1, var_1_11=3, var_1_12=128, var_1_13=254, var_1_14=-2, var_1_15=8, var_1_16=0, var_1_17=0, var_1_18=9/5, var_1_1=128, var_1_21=-1, var_1_22=-1, var_1_23=0, var_1_24=0, var_1_25=-1, var_1_26=2, var_1_27=2, var_1_28=2, var_1_29=1, var_1_5=0, var_1_6=0, var_1_7=3, var_1_8=2, var_1_9=17] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 6, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 829 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 1861 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1330 mSDsCounter, 417 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 953 IncrementalHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 417 mSolverCounterUnsat, 531 mSDtfsCounter, 953 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 612 GetRequests, 535 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=5, InterpolantAutomatonStates: 64, 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, 5 MinimizatonAttempts, 131 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1168 NumberOfCodeBlocks, 1168 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 4843 SizeOfPredicates, 8 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 6270/6468 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-11-20 03:17:48,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:17:50,814 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:17:50,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 03:17:50,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:17:50,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:17:50,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:17:50,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:17:50,932 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:17:50,932 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:17:50,933 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:17:50,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:17:50,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:17:50,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:17:50,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:17:50,936 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:17:50,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:17:50,937 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:17:50,937 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:17:50,938 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:17:50,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:17:50,942 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:17:50,942 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:17:50,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:17:50,943 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 03:17:50,943 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 03:17:50,943 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:17:50,943 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 03:17:50,944 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:17:50,944 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:17:50,944 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:17:50,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:17:50,945 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:17:50,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:17:50,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:17:50,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:17:50,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:17:50,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:17:50,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:17:50,948 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 03:17:50,948 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 03:17:50,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:17:50,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:17:50,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:17:50,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:17:50,950 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/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/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 -> c4862b5ebb887702302f2980511014b313d3fbe17ee23cc3bf7542b446fc70eb [2024-11-20 03:17:51,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:17:51,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:17:51,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:17:51,339 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:17:51,339 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:17:51,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-20 03:17:52,954 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:17:53,201 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:17:53,203 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-20 03:17:53,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7de1aac7/25d6d9174fec4ff4a961eb0f001985e1/FLAGdd70ed5c4 [2024-11-20 03:17:53,238 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7de1aac7/25d6d9174fec4ff4a961eb0f001985e1 [2024-11-20 03:17:53,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:17:53,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:17:53,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:17:53,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:17:53,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:17:53,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17beb805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53, skipping insertion in model container [2024-11-20 03:17:53,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:17:53,482 WARN L250 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_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2024-11-20 03:17:53,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:17:53,589 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:17:53,604 WARN L250 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_fillercode_fillercodesize_ps-cn-10_file-85.i[915,928] [2024-11-20 03:17:53,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:17:53,677 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:17:53,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53 WrapperNode [2024-11-20 03:17:53,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:17:53,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:17:53,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:17:53,679 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:17:53,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,731 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-20 03:17:53,731 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:17:53,732 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:17:53,732 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:17:53,732 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:17:53,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,765 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-11-20 03:17:53,769 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,769 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:17:53,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:17:53,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:17:53,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:17:53,809 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (1/1) ... [2024-11-20 03:17:53,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:17:53,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:17:53,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 03:17:53,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 03:17:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:17:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 03:17:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:17:53,887 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:17:53,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:17:53,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:17:53,959 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:17:53,971 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:17:56,053 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 03:17:56,053 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:17:56,068 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:17:56,070 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:17:56,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:17:56 BoogieIcfgContainer [2024-11-20 03:17:56,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:17:56,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:17:56,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:17:56,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:17:56,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:17:53" (1/3) ... [2024-11-20 03:17:56,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b647826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:17:56, skipping insertion in model container [2024-11-20 03:17:56,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:17:53" (2/3) ... [2024-11-20 03:17:56,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b647826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:17:56, skipping insertion in model container [2024-11-20 03:17:56,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:17:56" (3/3) ... [2024-11-20 03:17:56,078 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-85.i [2024-11-20 03:17:56,092 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:17:56,092 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:17:56,142 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:17:56,152 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;@12c9348a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:17:56,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:17:56,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 03:17:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 03:17:56,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:17:56,177 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:17:56,177 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:17:56,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:17:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash -29964851, now seen corresponding path program 1 times [2024-11-20 03:17:56,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:17:56,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193982405] [2024-11-20 03:17:56,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:56,198 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-11-20 03:17:56,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:17:56,201 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-20 03:17:56,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 03:17:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:56,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 03:17:56,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:17:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-20 03:17:56,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:17:56,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:17:56,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193982405] [2024-11-20 03:17:56,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193982405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:17:56,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:17:56,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:17:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493536637] [2024-11-20 03:17:56,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:17:56,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:17:56,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:17:56,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:17:56,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:17:56,704 INFO L87 Difference]: Start difference. First operand has 68 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 03:17:56,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:17:56,728 INFO L93 Difference]: Finished difference Result 129 states and 222 transitions. [2024-11-20 03:17:56,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:17:56,730 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2024-11-20 03:17:56,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:17:56,737 INFO L225 Difference]: With dead ends: 129 [2024-11-20 03:17:56,737 INFO L226 Difference]: Without dead ends: 64 [2024-11-20 03:17:56,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-11-20 03:17:56,743 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:17:56,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:17:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-20 03:17:56,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-20 03:17:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 03:17:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2024-11-20 03:17:56,781 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 142 [2024-11-20 03:17:56,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:17:56,782 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2024-11-20 03:17:56,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 03:17:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2024-11-20 03:17:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 03:17:56,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:17:56,785 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:17:56,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 03:17:56,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-20 03:17:56,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:17:56,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:17:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1810870079, now seen corresponding path program 1 times [2024-11-20 03:17:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:17:56,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201974534] [2024-11-20 03:17:56,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:17:56,989 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-11-20 03:17:56,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:17:56,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-20 03:17:57,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 03:17:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:17:57,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 03:17:57,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:17:58,156 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 03:17:58,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:17:58,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:17:58,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201974534] [2024-11-20 03:17:58,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201974534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:17:58,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:17:58,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:17:58,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259339972] [2024-11-20 03:17:58,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:17:58,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:17:58,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:17:58,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:17:58,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:17:58,163 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 03:18:00,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:18:00,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:00,323 INFO L93 Difference]: Finished difference Result 125 states and 189 transitions. [2024-11-20 03:18:00,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:18:00,342 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-20 03:18:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:00,344 INFO L225 Difference]: With dead ends: 125 [2024-11-20 03:18:00,344 INFO L226 Difference]: Without dead ends: 64 [2024-11-20 03:18:00,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:18:00,346 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 78 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 03:18:00,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 131 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 03:18:00,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-20 03:18:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-20 03:18:00,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 03:18:00,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-11-20 03:18:00,360 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 142 [2024-11-20 03:18:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:00,362 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-11-20 03:18:00,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 03:18:00,363 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-11-20 03:18:00,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 03:18:00,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:00,365 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:18:00,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Ended with exit code 0 [2024-11-20 03:18:00,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-11-20 03:18:00,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:00,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:00,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1951073965, now seen corresponding path program 1 times [2024-11-20 03:18:00,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:18:00,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154814563] [2024-11-20 03:18:00,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:00,572 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-11-20 03:18:00,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:18:00,574 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-11-20 03:18:00,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-20 03:18:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:00,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 03:18:00,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:18:03,469 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 477 proven. 27 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-20 03:18:03,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:18:04,612 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 36 proven. 27 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-20 03:18:04,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:18:04,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154814563] [2024-11-20 03:18:04,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154814563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 03:18:04,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 03:18:04,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-11-20 03:18:04,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751468371] [2024-11-20 03:18:04,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 03:18:04,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 03:18:04,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:18:04,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 03:18:04,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-20 03:18:04,620 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-20 03:18:08,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 03:18:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:18:11,033 INFO L93 Difference]: Finished difference Result 249 states and 367 transitions. [2024-11-20 03:18:11,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 03:18:11,034 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 143 [2024-11-20 03:18:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:18:11,037 INFO L225 Difference]: With dead ends: 249 [2024-11-20 03:18:11,037 INFO L226 Difference]: Without dead ends: 188 [2024-11-20 03:18:11,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 273 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2024-11-20 03:18:11,039 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 258 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-20 03:18:11,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 503 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-20 03:18:11,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-20 03:18:11,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 152. [2024-11-20 03:18:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 93 states have internal predecessors, (114), 55 states have call successors, (55), 4 states have call predecessors, (55), 4 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-20 03:18:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-11-20 03:18:11,083 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 143 [2024-11-20 03:18:11,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:18:11,084 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-11-20 03:18:11,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.071428571428571) internal successors, (71), 14 states have internal predecessors, (71), 4 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-20 03:18:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-11-20 03:18:11,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 03:18:11,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:18:11,089 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 03:18:11,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-20 03:18:11,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-11-20 03:18:11,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:18:11,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:18:11,292 INFO L85 PathProgramCache]: Analyzing trace with hash 503991767, now seen corresponding path program 1 times [2024-11-20 03:18:11,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:18:11,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [314856871] [2024-11-20 03:18:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:18:11,293 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-11-20 03:18:11,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:18:11,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-11-20 03:18:11,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (5)] Waiting until timeout for monitored process [2024-11-20 03:18:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:18:11,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 03:18:11,654 INFO L278 TraceCheckSpWp]: Computing forward predicates...