./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.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 3323554ed5d8a95c631cfba7b209abf31440dbfb83bb65542e5f9a71f94c9b4b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:34:13,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:34:13,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:34:13,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:34:13,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:34:13,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:34:13,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:34:13,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:34:13,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:34:13,286 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:34:13,287 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:34:13,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:34:13,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:34:13,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:34:13,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:34:13,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:34:13,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:34:13,291 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:34:13,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:34:13,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:34:13,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:34:13,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:34:13,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:34:13,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:34:13,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:34:13,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:34:13,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:34:13,294 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:34:13,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:34:13,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:34:13,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:34:13,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:34:13,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:34:13,296 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:34:13,296 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:34:13,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:34:13,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:34:13,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:34:13,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:34:13,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:34:13,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:34:13,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:34:13,299 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 -> 3323554ed5d8a95c631cfba7b209abf31440dbfb83bb65542e5f9a71f94c9b4b [2024-11-08 23:34:13,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:34:13,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:34:13,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:34:13,575 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:34:13,576 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:34:13,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i [2024-11-08 23:34:15,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:34:15,245 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:34:15,246 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i [2024-11-08 23:34:15,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c624f0d23/ced61c6f83c84dfe910a86a4dcb88691/FLAGce08dd10d [2024-11-08 23:34:15,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c624f0d23/ced61c6f83c84dfe910a86a4dcb88691 [2024-11-08 23:34:15,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:34:15,595 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:34:15,596 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:34:15,596 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:34:15,602 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:34:15,603 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:34:15" (1/1) ... [2024-11-08 23:34:15,604 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@172ab8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:15, skipping insertion in model container [2024-11-08 23:34:15,604 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:34:15" (1/1) ... [2024-11-08 23:34:15,641 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:34:15,827 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_loopvsstraightlinecode_100-while_file-7.i[915,928] [2024-11-08 23:34:15,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:34:15,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:34:15,960 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_loopvsstraightlinecode_100-while_file-7.i[915,928] [2024-11-08 23:34:16,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:34:16,041 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:34:16,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16 WrapperNode [2024-11-08 23:34:16,042 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:34:16,043 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:34:16,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:34:16,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:34:16,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,111 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-11-08 23:34:16,111 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:34:16,112 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:34:16,112 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:34:16,112 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:34:16,122 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,131 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,170 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-08 23:34:16,171 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,171 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,203 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,211 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:34:16,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:34:16,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:34:16,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:34:16,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (1/1) ... [2024-11-08 23:34:16,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:34:16,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:34:16,256 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-08 23:34:16,263 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-08 23:34:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:34:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:34:16,308 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:34:16,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:34:16,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:34:16,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:34:16,416 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:34:16,418 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:34:17,006 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 23:34:17,006 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:34:17,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:34:17,024 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:34:17,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:34:17 BoogieIcfgContainer [2024-11-08 23:34:17,025 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:34:17,027 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:34:17,027 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:34:17,030 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:34:17,031 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:34:15" (1/3) ... [2024-11-08 23:34:17,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632685f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:34:17, skipping insertion in model container [2024-11-08 23:34:17,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:16" (2/3) ... [2024-11-08 23:34:17,032 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632685f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:34:17, skipping insertion in model container [2024-11-08 23:34:17,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:34:17" (3/3) ... [2024-11-08 23:34:17,034 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-7.i [2024-11-08 23:34:17,050 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:34:17,051 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:34:17,123 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:34:17,129 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;@678d374c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:34:17,130 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:34:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 23:34:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 23:34:17,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:34:17,159 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:34:17,160 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:34:17,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:17,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1076478273, now seen corresponding path program 1 times [2024-11-08 23:34:17,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:34:17,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132421634] [2024-11-08 23:34:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:34:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:34:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:34:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:34:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:34:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:34:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:34:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:34:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:34:17,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:34:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:34:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:34:17,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:34:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:34:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:34:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:34:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:34:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:34:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:34:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:34:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:34:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:34:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:34:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:34:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 23:34:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 23:34:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:34:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 23:34:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 23:34:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 23:34:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:34:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 23:34:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 23:34:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 23:34:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 23:34:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 23:34:17,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:34:17,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132421634] [2024-11-08 23:34:17,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132421634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:34:17,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:34:17,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:34:17,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767005407] [2024-11-08 23:34:17,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:34:17,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:34:17,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:34:17,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:34:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:34:17,837 INFO L87 Difference]: Start difference. First operand has 109 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 72 states have internal predecessors, (103), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 23:34:17,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:34:17,870 INFO L93 Difference]: Finished difference Result 211 states and 375 transitions. [2024-11-08 23:34:17,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:34:17,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 223 [2024-11-08 23:34:17,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:34:17,884 INFO L225 Difference]: With dead ends: 211 [2024-11-08 23:34:17,884 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 23:34:17,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 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-08 23:34:17,895 INFO L432 NwaCegarLoop]: 165 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, 165 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-08 23:34:17,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:34:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 23:34:17,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-08 23:34:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 23:34:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 165 transitions. [2024-11-08 23:34:17,969 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 165 transitions. Word has length 223 [2024-11-08 23:34:17,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:34:17,970 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 165 transitions. [2024-11-08 23:34:17,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 23:34:17,973 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 165 transitions. [2024-11-08 23:34:17,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 23:34:17,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:34:17,979 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:34:17,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:34:17,979 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:34:17,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1943230963, now seen corresponding path program 1 times [2024-11-08 23:34:17,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:34:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292599605] [2024-11-08 23:34:17,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:34:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:34:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:34:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:34:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:34:18,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:34:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:34:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:34:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:34:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:34:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:34:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:34:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:34:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:34:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:34:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:34:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:34:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:34:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:34:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:34:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:34:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:34:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:34:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:34:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 23:34:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 23:34:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:34:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 23:34:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 23:34:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 23:34:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:34:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 23:34:18,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 23:34:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 23:34:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 23:34:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 23:34:18,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:34:18,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292599605] [2024-11-08 23:34:18,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292599605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:34:18,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:34:18,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 23:34:18,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075483011] [2024-11-08 23:34:18,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:34:18,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:34:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:34:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:34:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:34:18,643 INFO L87 Difference]: Start difference. First operand 105 states and 165 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:34:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:34:18,886 INFO L93 Difference]: Finished difference Result 310 states and 490 transitions. [2024-11-08 23:34:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:34:18,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 223 [2024-11-08 23:34:18,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:34:18,901 INFO L225 Difference]: With dead ends: 310 [2024-11-08 23:34:18,901 INFO L226 Difference]: Without dead ends: 208 [2024-11-08 23:34:18,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:34:18,903 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 109 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 23:34:18,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 475 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 23:34:18,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-08 23:34:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 167. [2024-11-08 23:34:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 94 states have internal predecessors, (121), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 23:34:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 261 transitions. [2024-11-08 23:34:18,947 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 261 transitions. Word has length 223 [2024-11-08 23:34:18,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:34:18,948 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 261 transitions. [2024-11-08 23:34:18,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:34:18,948 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 261 transitions. [2024-11-08 23:34:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 23:34:18,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:34:18,952 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:34:18,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 23:34:18,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:34:18,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:18,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2117006148, now seen corresponding path program 1 times [2024-11-08 23:34:18,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:34:18,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106541967] [2024-11-08 23:34:18,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:34:19,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:34:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:34:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:34:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:34:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:34:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:34:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:34:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:34:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:34:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:34:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:34:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:34:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:34:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:34:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:34:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:34:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:34:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:34:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:34:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:34:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:34:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:34:19,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:34:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 23:34:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 23:34:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:34:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 23:34:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 23:34:19,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 23:34:19,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:34:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 23:34:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 23:34:19,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 23:34:19,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 23:34:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 23:34:19,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:34:19,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106541967] [2024-11-08 23:34:19,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106541967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:34:19,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:34:19,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:34:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608177197] [2024-11-08 23:34:19,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:34:19,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:34:19,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:34:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:34:19,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:34:19,269 INFO L87 Difference]: Start difference. First operand 167 states and 261 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:34:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:34:19,305 INFO L93 Difference]: Finished difference Result 269 states and 423 transitions. [2024-11-08 23:34:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:34:19,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-08 23:34:19,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:34:19,310 INFO L225 Difference]: With dead ends: 269 [2024-11-08 23:34:19,312 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 23:34:19,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:34:19,314 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:34:19,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:34:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 23:34:19,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-08 23:34:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 94 states have internal predecessors, (120), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 23:34:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 260 transitions. [2024-11-08 23:34:19,356 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 260 transitions. Word has length 224 [2024-11-08 23:34:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:34:19,358 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 260 transitions. [2024-11-08 23:34:19,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:34:19,358 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 260 transitions. [2024-11-08 23:34:19,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-08 23:34:19,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:34:19,364 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:34:19,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:34:19,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:34:19,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:19,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1530200134, now seen corresponding path program 1 times [2024-11-08 23:34:19,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:34:19,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570430459] [2024-11-08 23:34:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:19,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:34:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:34:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:34:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:34:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:34:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:34:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:34:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:34:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:34:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:34:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:34:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:34:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:34:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:34:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:34:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:34:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:34:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:34:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:34:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:34:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:34:19,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:34:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:34:19,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:34:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 23:34:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 23:34:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:34:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 23:34:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 23:34:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 23:34:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:34:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 23:34:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 23:34:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 23:34:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 23:34:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 23:34:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:34:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570430459] [2024-11-08 23:34:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570430459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:34:19,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:34:19,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:34:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897051388] [2024-11-08 23:34:19,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:34:19,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:34:19,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:34:19,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:34:19,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:34:19,695 INFO L87 Difference]: Start difference. First operand 167 states and 260 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:34:19,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:34:19,752 INFO L93 Difference]: Finished difference Result 269 states and 421 transitions. [2024-11-08 23:34:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:34:19,753 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 224 [2024-11-08 23:34:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:34:19,755 INFO L225 Difference]: With dead ends: 269 [2024-11-08 23:34:19,755 INFO L226 Difference]: Without dead ends: 167 [2024-11-08 23:34:19,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:34:19,760 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 23:34:19,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:34:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-08 23:34:19,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-08 23:34:19,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 23:34:19,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 259 transitions. [2024-11-08 23:34:19,787 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 259 transitions. Word has length 224 [2024-11-08 23:34:19,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:34:19,788 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 259 transitions. [2024-11-08 23:34:19,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:34:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 259 transitions. [2024-11-08 23:34:19,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 23:34:19,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:34:19,791 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:34:19,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 23:34:19,792 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:34:19,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:19,792 INFO L85 PathProgramCache]: Analyzing trace with hash -304629971, now seen corresponding path program 1 times [2024-11-08 23:34:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:34:19,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251263195] [2024-11-08 23:34:19,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:34:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:34:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:34:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:34:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:34:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:34:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:34:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:34:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:34:22,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:34:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:34:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:34:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:34:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:34:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:34:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:34:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:34:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:34:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:34:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:34:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:34:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:34:22,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:34:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:34:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 23:34:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 23:34:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:34:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 23:34:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 23:34:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 23:34:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:34:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 23:34:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 23:34:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 23:34:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 23:34:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 486 proven. 102 refuted. 0 times theorem prover too weak. 1792 trivial. 0 not checked. [2024-11-08 23:34:22,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:34:22,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251263195] [2024-11-08 23:34:22,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251263195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:34:22,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342396035] [2024-11-08 23:34:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:22,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:34:22,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:34:22,715 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-08 23:34:22,720 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-08 23:34:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:23,032 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 23:34:23,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:34:25,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 1668 proven. 120 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2024-11-08 23:34:25,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:34:26,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342396035] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:34:26,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 23:34:26,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 31] total 42 [2024-11-08 23:34:26,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500883143] [2024-11-08 23:34:26,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 23:34:26,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-08 23:34:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:34:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-08 23:34:26,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=414, Invalid=1656, Unknown=0, NotChecked=0, Total=2070 [2024-11-08 23:34:26,604 INFO L87 Difference]: Start difference. First operand 167 states and 259 transitions. Second operand has 42 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 36 states have internal predecessors, (113), 18 states have call successors, (54), 10 states have call predecessors, (54), 13 states have return successors, (54), 17 states have call predecessors, (54), 18 states have call successors, (54) [2024-11-08 23:34:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:34:32,189 INFO L93 Difference]: Finished difference Result 572 states and 778 transitions. [2024-11-08 23:34:32,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-08 23:34:32,191 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 36 states have internal predecessors, (113), 18 states have call successors, (54), 10 states have call predecessors, (54), 13 states have return successors, (54), 17 states have call predecessors, (54), 18 states have call successors, (54) Word has length 225 [2024-11-08 23:34:32,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:34:32,197 INFO L225 Difference]: With dead ends: 572 [2024-11-08 23:34:32,198 INFO L226 Difference]: Without dead ends: 470 [2024-11-08 23:34:32,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4680 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=3429, Invalid=12071, Unknown=0, NotChecked=0, Total=15500 [2024-11-08 23:34:32,206 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1031 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 710 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1031 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 710 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 23:34:32,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1031 Valid, 856 Invalid, 1973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [710 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 23:34:32,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-08 23:34:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 265. [2024-11-08 23:34:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 172 states have (on average 1.180232558139535) internal successors, (203), 172 states have internal predecessors, (203), 70 states have call successors, (70), 22 states have call predecessors, (70), 22 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 23:34:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 343 transitions. [2024-11-08 23:34:32,257 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 343 transitions. Word has length 225 [2024-11-08 23:34:32,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:34:32,261 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 343 transitions. [2024-11-08 23:34:32,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 36 states have internal predecessors, (113), 18 states have call successors, (54), 10 states have call predecessors, (54), 13 states have return successors, (54), 17 states have call predecessors, (54), 18 states have call successors, (54) [2024-11-08 23:34:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 343 transitions. [2024-11-08 23:34:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 23:34:32,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:34:32,265 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:34:32,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 23:34:32,466 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-08 23:34:32,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:34:32,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1325698325, now seen corresponding path program 1 times [2024-11-08 23:34:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:34:32,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573149333] [2024-11-08 23:34:32,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:32,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:34:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:34:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:34:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:34:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:34:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:34:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:34:33,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:34:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 23:34:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 23:34:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 23:34:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 23:34:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 23:34:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 23:34:33,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 23:34:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 23:34:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 23:34:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 23:34:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 23:34:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 23:34:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 23:34:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 23:34:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 23:34:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 23:34:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 23:34:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-08 23:34:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 23:34:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-08 23:34:33,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 23:34:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 23:34:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 23:34:33,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 23:34:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 23:34:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 23:34:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 23:34:33,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 12 proven. 90 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-08 23:34:33,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:34:33,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573149333] [2024-11-08 23:34:33,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573149333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:34:33,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034667563] [2024-11-08 23:34:33,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:33,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:34:33,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:34:33,222 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-08 23:34:33,224 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-08 23:34:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:33,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 23:34:33,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:34:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 554 proven. 174 refuted. 0 times theorem prover too weak. 1652 trivial. 0 not checked. [2024-11-08 23:34:34,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:34:34,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 12 proven. 90 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2024-11-08 23:34:34,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034667563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 23:34:34,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 23:34:34,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 14 [2024-11-08 23:34:34,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877922068] [2024-11-08 23:34:34,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 23:34:34,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-08 23:34:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:34:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-08 23:34:34,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-08 23:34:34,797 INFO L87 Difference]: Start difference. First operand 265 states and 343 transitions. Second operand has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 14 states have internal predecessors, (129), 4 states have call successors, (95), 3 states have call predecessors, (95), 5 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) [2024-11-08 23:34:35,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:34:35,984 INFO L93 Difference]: Finished difference Result 621 states and 794 transitions. [2024-11-08 23:34:35,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 23:34:35,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 14 states have internal predecessors, (129), 4 states have call successors, (95), 3 states have call predecessors, (95), 5 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) Word has length 225 [2024-11-08 23:34:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:34:35,991 INFO L225 Difference]: With dead ends: 621 [2024-11-08 23:34:35,991 INFO L226 Difference]: Without dead ends: 461 [2024-11-08 23:34:35,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 517 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=882, Unknown=0, NotChecked=0, Total=1260 [2024-11-08 23:34:35,993 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 263 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:34:35,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 826 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 23:34:35,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-11-08 23:34:36,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 333. [2024-11-08 23:34:36,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 216 states have (on average 1.1342592592592593) internal successors, (245), 217 states have internal predecessors, (245), 86 states have call successors, (86), 30 states have call predecessors, (86), 30 states have return successors, (86), 85 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-08 23:34:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 417 transitions. [2024-11-08 23:34:36,067 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 417 transitions. Word has length 225 [2024-11-08 23:34:36,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:34:36,068 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 417 transitions. [2024-11-08 23:34:36,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 14 states have internal predecessors, (129), 4 states have call successors, (95), 3 states have call predecessors, (95), 5 states have return successors, (96), 4 states have call predecessors, (96), 4 states have call successors, (96) [2024-11-08 23:34:36,068 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 417 transitions. [2024-11-08 23:34:36,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 23:34:36,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:34:36,072 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:34:36,091 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-08 23:34:36,272 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-08 23:34:36,273 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:34:36,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:36,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1082609928, now seen corresponding path program 1 times [2024-11-08 23:34:36,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:34:36,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138760356] [2024-11-08 23:34:36,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:36,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:34:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:34:36,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956260569] [2024-11-08 23:34:36,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:36,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:34:36,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:34:36,500 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 23:34:36,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 23:34:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:34:36,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:34:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:34:37,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:34:37,001 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:34:37,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:34:37,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 23:34:37,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:34:37,211 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 23:34:37,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:34:37,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:34:37 BoogieIcfgContainer [2024-11-08 23:34:37,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:34:37,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:34:37,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:34:37,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:34:37,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:34:17" (3/4) ... [2024-11-08 23:34:37,400 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:34:37,401 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:34:37,402 INFO L158 Benchmark]: Toolchain (without parser) took 21806.90ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 147.6MB in the beginning and 314.6MB in the end (delta: -167.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-11-08 23:34:37,402 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 87.3MB in the beginning and 87.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:34:37,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.17ms. Allocated memory is still 178.3MB. Free memory was 146.9MB in the beginning and 128.3MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 23:34:37,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.70ms. Allocated memory is still 178.3MB. Free memory was 128.3MB in the beginning and 121.3MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 23:34:37,402 INFO L158 Benchmark]: Boogie Preprocessor took 109.08ms. Allocated memory is still 178.3MB. Free memory was 121.3MB in the beginning and 110.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 23:34:37,403 INFO L158 Benchmark]: RCFGBuilder took 802.85ms. Allocated memory is still 178.3MB. Free memory was 110.9MB in the beginning and 127.3MB in the end (delta: -16.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 23:34:37,403 INFO L158 Benchmark]: TraceAbstraction took 20368.53ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 127.3MB in the beginning and 314.6MB in the end (delta: -187.3MB). Peak memory consumption was 212.7MB. Max. memory is 16.1GB. [2024-11-08 23:34:37,403 INFO L158 Benchmark]: Witness Printer took 5.01ms. Allocated memory is still 373.3MB. Free memory is still 314.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:34:37,406 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.17ms. Allocated memory is still 125.8MB. Free memory was 87.3MB in the beginning and 87.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.17ms. Allocated memory is still 178.3MB. Free memory was 146.9MB in the beginning and 128.3MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.70ms. Allocated memory is still 178.3MB. Free memory was 128.3MB in the beginning and 121.3MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.08ms. Allocated memory is still 178.3MB. Free memory was 121.3MB in the beginning and 110.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 802.85ms. Allocated memory is still 178.3MB. Free memory was 110.9MB in the beginning and 127.3MB in the end (delta: -16.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 20368.53ms. Allocated memory was 178.3MB in the beginning and 373.3MB in the end (delta: 195.0MB). Free memory was 127.3MB in the beginning and 314.6MB in the end (delta: -187.3MB). Peak memory consumption was 212.7MB. Max. memory is 16.1GB. * Witness Printer took 5.01ms. Allocated memory is still 373.3MB. Free memory is still 314.6MB. 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 212, overapproximation of someBinaryDOUBLEComparisonOperation at line 212, overapproximation of someUnaryDOUBLEoperation at line 31. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 5; [L23] signed char var_1_6 = -8; [L24] unsigned short int var_1_7 = 16; [L25] unsigned char var_1_8 = 1; [L26] unsigned short int var_1_10 = 47037; [L27] unsigned char var_1_12 = 1; [L28] float var_1_13 = 1.2; [L29] float var_1_14 = 100000000000.25; [L30] float var_1_15 = 25.4; [L31] float var_1_16 = -0.8; [L32] float var_1_17 = 10000000.625; [L33] float var_1_18 = 0.19999999999999996; [L34] float var_1_19 = -0.25; [L35] float var_1_20 = 0.6; [L36] signed char var_1_21 = -128; [L37] signed char var_1_22 = 4; [L38] signed char var_1_23 = 10; [L39] unsigned char var_1_24 = 64; [L40] signed long int var_1_25 = 1939664001; [L41] unsigned char var_1_26 = 1; [L42] signed short int var_1_27 = 1; [L43] signed char var_1_28 = -100; [L44] signed long int var_1_30 = -2; [L45] unsigned long int var_1_31 = 64; [L46] double var_1_32 = 99.4; [L47] unsigned char var_1_33 = 128; [L48] unsigned char var_1_34 = 64; [L49] unsigned char var_1_35 = 64; [L50] unsigned char var_1_36 = 200; [L51] unsigned char var_1_37 = 2; [L52] signed char var_1_38 = -5; [L53] signed char var_1_39 = -10; [L54] signed short int last_1_var_1_27 = 1; [L55] unsigned char last_1_var_1_33 = 128; [L56] signed char last_1_var_1_38 = -5; VAL [isInitial=0, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-8, var_1_7=16, var_1_8=1] [L216] isInitial = 1 [L217] FCALL initially() [L218] COND TRUE 1 [L219] CALL updateLastVariables() [L207] last_1_var_1_27 = var_1_27 [L208] last_1_var_1_33 = var_1_33 [L209] last_1_var_1_38 = var_1_38 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-8, var_1_7=16, var_1_8=1] [L219] RET updateLastVariables() [L220] CALL updateVariables() [L150] var_1_6 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_6 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L151] RET assume_abort_if_not(var_1_6 >= -127) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L152] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L152] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L153] var_1_8 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16] [L154] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16] [L155] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L155] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=47037, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L156] var_1_10 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L157] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L158] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L158] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L159] var_1_12 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L160] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L161] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L161] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_14=400000000001/4, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L162] var_1_14 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L163] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=127/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L164] var_1_15 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L165] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L166] var_1_16 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L167] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_17=80000005/8, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L168] var_1_17 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L169] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_18=4999999999999999/25000000000000000, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L170] var_1_18 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L171] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L172] var_1_19 = __VERIFIER_nondet_float() [L173] 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_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L173] 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_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=4, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L174] var_1_22 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L175] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L176] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L176] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=10, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L177] var_1_23 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L178] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L179] CALL assume_abort_if_not(var_1_23 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L179] RET assume_abort_if_not(var_1_23 <= 126) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1939664001, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L180] var_1_25 = __VERIFIER_nondet_long() [L181] CALL assume_abort_if_not(var_1_25 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L181] RET assume_abort_if_not(var_1_25 >= 1073741823) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L182] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L182] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=1, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L183] var_1_26 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L184] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L185] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L185] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=-100, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L186] var_1_28 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_28 >= -128) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L187] RET assume_abort_if_not(var_1_28 >= -128) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L188] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L188] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L189] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L189] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=64, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L190] var_1_34 = __VERIFIER_nondet_uchar() [L191] CALL assume_abort_if_not(var_1_34 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L191] RET assume_abort_if_not(var_1_34 >= 63) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L192] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L192] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L193] var_1_35 = __VERIFIER_nondet_uchar() [L194] CALL assume_abort_if_not(var_1_35 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L194] RET assume_abort_if_not(var_1_35 >= 64) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L195] CALL assume_abort_if_not(var_1_35 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L195] RET assume_abort_if_not(var_1_35 <= 127) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=200, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L196] var_1_36 = __VERIFIER_nondet_uchar() [L197] CALL assume_abort_if_not(var_1_36 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L197] RET assume_abort_if_not(var_1_36 >= 190) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L198] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L198] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=2, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L199] var_1_37 = __VERIFIER_nondet_uchar() [L200] CALL assume_abort_if_not(var_1_37 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L200] RET assume_abort_if_not(var_1_37 >= 0) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L201] CALL assume_abort_if_not(var_1_37 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L201] RET assume_abort_if_not(var_1_37 <= 63) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-10, var_1_6=-127, var_1_7=16, var_1_8=1] [L202] var_1_39 = __VERIFIER_nondet_char() [L203] CALL assume_abort_if_not(var_1_39 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L203] RET assume_abort_if_not(var_1_39 >= -63) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L204] CALL assume_abort_if_not(var_1_39 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L204] RET assume_abort_if_not(var_1_39 <= 63) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L220] RET updateVariables() [L221] CALL step() [L60] COND TRUE -64 <= last_1_var_1_38 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=64, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L61] COND TRUE ((last_1_var_1_33 - last_1_var_1_33) / var_1_10) > (var_1_23 - (var_1_25 - last_1_var_1_27)) [L62] var_1_24 = ((((var_1_23) > (var_1_26)) ? (var_1_23) : (var_1_26))) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_1=5, var_1_20=3/5, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L69] COND TRUE \read(var_1_8) [L70] var_1_20 = var_1_15 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=-128, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L72] COND TRUE var_1_16 >= (9.99999999999994E13f * var_1_20) [L73] var_1_21 = (var_1_22 - ((((4) > (var_1_23)) ? (4) : (var_1_23)))) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-2, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L75] COND FALSE !((((((var_1_17) > (var_1_16)) ? (var_1_17) : (var_1_16))) * var_1_19) <= (0.25f / 5.75f)) [L82] var_1_30 = -1 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=128, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L84] var_1_33 = ((((((var_1_34 + var_1_35)) > ((var_1_36 - var_1_37))) ? ((var_1_34 + var_1_35)) : ((var_1_36 - var_1_37)))) - var_1_23) [L85] unsigned char stepLocal_3 = var_1_37; VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, stepLocal_3=-240, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=-5, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L86] COND FALSE !(var_1_34 <= stepLocal_3) [L93] var_1_38 = var_1_22 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L95] unsigned char stepLocal_1 = var_1_33; VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, stepLocal_1=235, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L96] COND FALSE !(stepLocal_1 <= var_1_30) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=16, var_1_8=1] [L103] COND TRUE \read(var_1_12) [L104] var_1_7 = var_1_33 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L109] signed long int stepLocal_2 = - var_1_7; VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, stepLocal_2=-235, var_1_10=32767, var_1_12=1, var_1_13=6/5, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L110] COND TRUE stepLocal_2 <= var_1_24 [L111] var_1_13 = ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=64, var_1_32=497/5, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L115] COND TRUE (var_1_22 / var_1_28) == 32 [L116] var_1_31 = ((((var_1_25) < (var_1_38)) ? (var_1_25) : (var_1_38))) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=497/5, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L126] EXPR var_1_7 ^ var_1_33 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=497/5, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L126] COND FALSE !((~ (var_1_7 ^ var_1_33)) >= var_1_7) [L129] COND TRUE \read(var_1_8) [L130] var_1_32 = var_1_19 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L133] unsigned char stepLocal_0 = var_1_24; VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, stepLocal_0=3, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=5, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L134] COND FALSE !(var_1_30 > stepLocal_0) [L141] var_1_1 = var_1_6 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L143] COND FALSE !(var_1_14 <= var_1_15) [L146] var_1_27 = var_1_30 VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=-1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L221] RET step() [L222] CALL, EXPR property() [L212] EXPR ((((((((((var_1_30 > var_1_24) ? ((((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) < var_1_32) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) var_1_6))) : (var_1_1 == ((signed char) var_1_6))) && ((var_1_33 <= var_1_30) ? (var_1_8 ? (var_1_7 == ((unsigned short int) ((((var_1_33) > ((var_1_10 - var_1_24))) ? (var_1_33) : ((var_1_10 - var_1_24)))))) : (var_1_7 == ((unsigned short int) (var_1_10 - var_1_24)))) : (var_1_12 ? (var_1_7 == ((unsigned short int) var_1_33)) : (var_1_7 == ((unsigned short int) var_1_10))))) && (((- var_1_7) <= var_1_24) ? (var_1_13 == ((float) ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))))) : (var_1_13 == ((float) (((((var_1_16) > ((var_1_17 + var_1_18))) ? (var_1_16) : ((var_1_17 + var_1_18)))) + var_1_19))))) && (var_1_8 ? (var_1_20 == ((float) var_1_15)) : 1)) && ((var_1_16 >= (9.99999999999994E13f * var_1_20)) ? (var_1_21 == ((signed char) (var_1_22 - ((((4) > (var_1_23)) ? (4) : (var_1_23)))))) : 1)) && ((-64 <= last_1_var_1_38) ? ((((last_1_var_1_33 - last_1_var_1_33) / var_1_10) > (var_1_23 - (var_1_25 - last_1_var_1_27))) ? (var_1_24 == ((unsigned char) ((((var_1_23) > (var_1_26)) ? (var_1_23) : (var_1_26))))) : (var_1_24 == ((unsigned char) 4))) : (var_1_24 == ((unsigned char) var_1_23)))) && ((var_1_14 <= var_1_15) ? (var_1_27 == ((signed short int) (var_1_26 - ((((var_1_21) < ((var_1_23 + var_1_24))) ? (var_1_21) : ((var_1_23 + var_1_24))))))) : (var_1_27 == ((signed short int) var_1_30)))) && (((((((var_1_17) > (var_1_16)) ? (var_1_17) : (var_1_16))) * var_1_19) <= (0.25f / 5.75f)) ? (var_1_12 ? (var_1_30 == ((signed long int) var_1_26)) : (var_1_30 == ((signed long int) var_1_22))) : (var_1_30 == ((signed long int) -1)))) && (((var_1_22 / var_1_28) == 32) ? (var_1_31 == ((unsigned long int) ((((var_1_25) < (var_1_38)) ? (var_1_25) : (var_1_38))))) : (((((((- var_1_13)) < ((- var_1_19))) ? ((- var_1_13)) : ((- var_1_19)))) > 8.95f) ? ((var_1_33 <= var_1_33) ? (var_1_31 == ((unsigned long int) var_1_33)) : 1) : (var_1_31 == ((unsigned long int) var_1_33))))) && (((~ (var_1_7 ^ var_1_33)) >= var_1_7) ? (var_1_32 == ((double) var_1_15)) : (var_1_8 ? (var_1_32 == ((double) var_1_19)) : 1)) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=-1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L212-L213] return ((((((((((((var_1_30 > var_1_24) ? ((((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) < var_1_32) ? (var_1_1 == ((signed char) var_1_6)) : (var_1_1 == ((signed char) var_1_6))) : (var_1_1 == ((signed char) var_1_6))) && ((var_1_33 <= var_1_30) ? (var_1_8 ? (var_1_7 == ((unsigned short int) ((((var_1_33) > ((var_1_10 - var_1_24))) ? (var_1_33) : ((var_1_10 - var_1_24)))))) : (var_1_7 == ((unsigned short int) (var_1_10 - var_1_24)))) : (var_1_12 ? (var_1_7 == ((unsigned short int) var_1_33)) : (var_1_7 == ((unsigned short int) var_1_10))))) && (((- var_1_7) <= var_1_24) ? (var_1_13 == ((float) ((((var_1_14) > (var_1_15)) ? (var_1_14) : (var_1_15))))) : (var_1_13 == ((float) (((((var_1_16) > ((var_1_17 + var_1_18))) ? (var_1_16) : ((var_1_17 + var_1_18)))) + var_1_19))))) && (var_1_8 ? (var_1_20 == ((float) var_1_15)) : 1)) && ((var_1_16 >= (9.99999999999994E13f * var_1_20)) ? (var_1_21 == ((signed char) (var_1_22 - ((((4) > (var_1_23)) ? (4) : (var_1_23)))))) : 1)) && ((-64 <= last_1_var_1_38) ? ((((last_1_var_1_33 - last_1_var_1_33) / var_1_10) > (var_1_23 - (var_1_25 - last_1_var_1_27))) ? (var_1_24 == ((unsigned char) ((((var_1_23) > (var_1_26)) ? (var_1_23) : (var_1_26))))) : (var_1_24 == ((unsigned char) 4))) : (var_1_24 == ((unsigned char) var_1_23)))) && ((var_1_14 <= var_1_15) ? (var_1_27 == ((signed short int) (var_1_26 - ((((var_1_21) < ((var_1_23 + var_1_24))) ? (var_1_21) : ((var_1_23 + var_1_24))))))) : (var_1_27 == ((signed short int) var_1_30)))) && (((((((var_1_17) > (var_1_16)) ? (var_1_17) : (var_1_16))) * var_1_19) <= (0.25f / 5.75f)) ? (var_1_12 ? (var_1_30 == ((signed long int) var_1_26)) : (var_1_30 == ((signed long int) var_1_22))) : (var_1_30 == ((signed long int) -1)))) && (((var_1_22 / var_1_28) == 32) ? (var_1_31 == ((unsigned long int) ((((var_1_25) < (var_1_38)) ? (var_1_25) : (var_1_38))))) : (((((((- var_1_13)) < ((- var_1_19))) ? ((- var_1_13)) : ((- var_1_19)))) > 8.95f) ? ((var_1_33 <= var_1_33) ? (var_1_31 == ((unsigned long int) var_1_33)) : 1) : (var_1_31 == ((unsigned long int) var_1_33))))) && (((~ (var_1_7 ^ var_1_33)) >= var_1_7) ? (var_1_32 == ((double) var_1_15)) : (var_1_8 ? (var_1_32 == ((double) var_1_19)) : 1))) && (var_1_33 == ((unsigned char) ((((((var_1_34 + var_1_35)) > ((var_1_36 - var_1_37))) ? ((var_1_34 + var_1_35)) : ((var_1_36 - var_1_37)))) - var_1_23)))) && ((var_1_34 <= var_1_37) ? ((var_1_20 > var_1_20) ? (var_1_38 == ((signed char) ((((((((var_1_37) > (var_1_36)) ? (var_1_37) : (var_1_36)))) > (var_1_22)) ? (((((var_1_37) > (var_1_36)) ? (var_1_37) : (var_1_36)))) : (var_1_22))))) : (var_1_38 == ((signed char) (var_1_37 + var_1_39)))) : (var_1_38 == ((signed char) var_1_22))) ; [L222] RET, EXPR property() [L222] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=-1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_27=1, last_1_var_1_33=128, last_1_var_1_38=-5, var_1_10=32767, var_1_12=1, var_1_13=3, var_1_14=3, var_1_15=2, var_1_19=4, var_1_1=-127, var_1_20=2, var_1_21=61, var_1_22=65, var_1_23=3, var_1_24=3, var_1_25=1073741823, var_1_26=-253, var_1_27=-1, var_1_28=2, var_1_30=-1, var_1_31=65, var_1_32=4, var_1_33=235, var_1_34=63, var_1_35=64, var_1_36=254, var_1_37=-240, var_1_38=65, var_1_39=-63, var_1_6=-127, var_1_7=235, var_1_8=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.1s, OverallIterations: 7, TraceHistogramMax: 35, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1405 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1403 mSDsluCounter, 2948 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1976 mSDsCounter, 987 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2214 IncrementalHoareTripleChecker+Invalid, 3201 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 987 mSolverCounterUnsat, 972 mSDtfsCounter, 2214 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1337 GetRequests, 1174 SyntacticMatches, 1 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4931 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=333occurred in iteration=6, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 374 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 2248 NumberOfCodeBlocks, 2248 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 2010 ConstructedInterpolants, 0 QuantifiedInterpolants, 8369 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1013 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 20844/21420 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-08 23:34:37,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.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 3323554ed5d8a95c631cfba7b209abf31440dbfb83bb65542e5f9a71f94c9b4b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:34:39,901 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:34:39,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:34:39,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:34:39,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:34:40,022 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:34:40,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:34:40,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:34:40,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:34:40,027 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:34:40,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:34:40,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:34:40,028 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:34:40,030 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:34:40,030 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:34:40,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:34:40,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:34:40,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:34:40,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:34:40,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:34:40,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:34:40,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:34:40,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:34:40,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:34:40,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:34:40,035 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:34:40,035 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:34:40,035 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:34:40,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:34:40,036 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:34:40,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:34:40,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:34:40,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:34:40,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:34:40,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:34:40,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:34:40,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:34:40,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:34:40,039 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:34:40,039 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:34:40,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:34:40,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:34:40,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:34:40,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:34:40,041 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 -> 3323554ed5d8a95c631cfba7b209abf31440dbfb83bb65542e5f9a71f94c9b4b [2024-11-08 23:34:40,380 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:34:40,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:34:40,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:34:40,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:34:40,408 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:34:40,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i [2024-11-08 23:34:41,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:34:42,115 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:34:42,116 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-7.i [2024-11-08 23:34:42,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55226dedf/10aab387a3d14b7c9a46bdf7b96193a8/FLAG9519ae873 [2024-11-08 23:34:42,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55226dedf/10aab387a3d14b7c9a46bdf7b96193a8 [2024-11-08 23:34:42,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:34:42,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:34:42,146 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:34:42,146 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:34:42,152 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:34:42,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423eb10b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42, skipping insertion in model container [2024-11-08 23:34:42,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,191 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:34:42,387 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_loopvsstraightlinecode_100-while_file-7.i[915,928] [2024-11-08 23:34:42,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:34:42,522 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:34:42,537 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_loopvsstraightlinecode_100-while_file-7.i[915,928] [2024-11-08 23:34:42,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:34:42,631 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:34:42,632 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42 WrapperNode [2024-11-08 23:34:42,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:34:42,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:34:42,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:34:42,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:34:42,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,663 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,708 INFO L138 Inliner]: procedures = 27, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-08 23:34:42,709 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:34:42,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:34:42,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:34:42,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:34:42,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,758 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-08 23:34:42,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,760 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,794 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:34:42,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:34:42,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:34:42,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:34:42,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (1/1) ... [2024-11-08 23:34:42,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:34:42,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:34:42,841 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-08 23:34:42,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-08 23:34:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:34:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:34:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:34:42,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:34:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:34:42,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:34:43,027 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:34:43,031 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:34:46,998 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 23:34:46,998 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:34:47,017 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:34:47,018 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:34:47,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:34:47 BoogieIcfgContainer [2024-11-08 23:34:47,018 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:34:47,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:34:47,020 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:34:47,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:34:47,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:34:42" (1/3) ... [2024-11-08 23:34:47,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6eb8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:34:47, skipping insertion in model container [2024-11-08 23:34:47,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:34:42" (2/3) ... [2024-11-08 23:34:47,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e6eb8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:34:47, skipping insertion in model container [2024-11-08 23:34:47,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:34:47" (3/3) ... [2024-11-08 23:34:47,028 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-7.i [2024-11-08 23:34:47,045 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:34:47,045 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:34:47,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:34:47,133 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;@766deccd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:34:47,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:34:47,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 23:34:47,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-08 23:34:47,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:34:47,162 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:34:47,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:34:47,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash -712701319, now seen corresponding path program 1 times [2024-11-08 23:34:47,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:34:47,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815314427] [2024-11-08 23:34:47,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:47,186 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-08 23:34:47,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:34:47,190 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-08 23:34:47,192 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-08 23:34:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:47,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:34:47,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:34:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 1556 trivial. 0 not checked. [2024-11-08 23:34:47,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:34:47,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:34:47,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815314427] [2024-11-08 23:34:47,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815314427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:34:47,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:34:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:34:47,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176111513] [2024-11-08 23:34:47,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:34:47,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:34:47,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:34:47,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:34:47,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:34:47,997 INFO L87 Difference]: Start difference. First operand has 98 states, 60 states have (on average 1.4166666666666667) internal successors, (85), 61 states have internal predecessors, (85), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 23:34:48,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:34:48,043 INFO L93 Difference]: Finished difference Result 189 states and 339 transitions. [2024-11-08 23:34:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:34:48,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 220 [2024-11-08 23:34:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:34:48,055 INFO L225 Difference]: With dead ends: 189 [2024-11-08 23:34:48,055 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 23:34:48,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 219 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-08 23:34:48,064 INFO L432 NwaCegarLoop]: 144 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, 144 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-08 23:34:48,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:34:48,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 23:34:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-08 23:34:48,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-08 23:34:48,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions. [2024-11-08 23:34:48,117 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 220 [2024-11-08 23:34:48,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:34:48,117 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 144 transitions. [2024-11-08 23:34:48,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-08 23:34:48,118 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions. [2024-11-08 23:34:48,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 23:34:48,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:34:48,124 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:34:48,140 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-08 23:34:48,326 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-08 23:34:48,326 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:34:48,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:34:48,327 INFO L85 PathProgramCache]: Analyzing trace with hash -378844003, now seen corresponding path program 1 times [2024-11-08 23:34:48,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:34:48,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1594266224] [2024-11-08 23:34:48,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:34:48,329 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-08 23:34:48,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:34:48,331 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-08 23:34:48,332 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-08 23:34:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:34:48,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 23:34:48,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:34:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 23:34:50,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:34:50,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:34:50,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1594266224] [2024-11-08 23:34:50,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1594266224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:34:50,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:34:50,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:34:50,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660694734] [2024-11-08 23:34:50,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:34:50,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 23:34:50,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:34:50,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 23:34:50,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 23:34:50,986 INFO L87 Difference]: Start difference. First operand 94 states and 144 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:34:55,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:34:56,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:35:01,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 23:35:01,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:01,132 INFO L93 Difference]: Finished difference Result 277 states and 427 transitions. [2024-11-08 23:35:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 23:35:01,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 221 [2024-11-08 23:35:01,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:01,168 INFO L225 Difference]: With dead ends: 277 [2024-11-08 23:35:01,168 INFO L226 Difference]: Without dead ends: 186 [2024-11-08 23:35:01,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 23:35:01,170 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 85 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 71 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:01,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 414 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 10 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2024-11-08 23:35:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-08 23:35:01,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 156. [2024-11-08 23:35:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 83 states have internal predecessors, (100), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 23:35:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 240 transitions. [2024-11-08 23:35:01,216 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 240 transitions. Word has length 221 [2024-11-08 23:35:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:01,217 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 240 transitions. [2024-11-08 23:35:01,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:35:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 240 transitions. [2024-11-08 23:35:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 23:35:01,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:01,225 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:35:01,245 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-08 23:35:01,426 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-08 23:35:01,426 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:01,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:01,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1393904486, now seen corresponding path program 1 times [2024-11-08 23:35:01,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:35:01,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618521358] [2024-11-08 23:35:01,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:01,428 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-08 23:35:01,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:35:01,431 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-08 23:35:01,432 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-08 23:35:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:01,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 23:35:01,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:35:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-08 23:35:01,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:35:01,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:35:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618521358] [2024-11-08 23:35:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618521358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:35:01,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:35:01,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 23:35:01,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121075370] [2024-11-08 23:35:01,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:35:01,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 23:35:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:35:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 23:35:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:35:01,946 INFO L87 Difference]: Start difference. First operand 156 states and 240 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:35:04,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-08 23:35:04,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:35:04,715 INFO L93 Difference]: Finished difference Result 247 states and 381 transitions. [2024-11-08 23:35:04,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 23:35:04,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 222 [2024-11-08 23:35:04,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:35:04,750 INFO L225 Difference]: With dead ends: 247 [2024-11-08 23:35:04,750 INFO L226 Difference]: Without dead ends: 156 [2024-11-08 23:35:04,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 23:35:04,752 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-08 23:35:04,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-08 23:35:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-08 23:35:04,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-08 23:35:04,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 83 states have internal predecessors, (99), 70 states have call successors, (70), 2 states have call predecessors, (70), 2 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 23:35:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 239 transitions. [2024-11-08 23:35:04,797 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 239 transitions. Word has length 222 [2024-11-08 23:35:04,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:35:04,799 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 239 transitions. [2024-11-08 23:35:04,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-08 23:35:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 239 transitions. [2024-11-08 23:35:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-08 23:35:04,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:35:04,804 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:35:04,824 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 (4)] Ended with exit code 0 [2024-11-08 23:35:05,005 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-08 23:35:05,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:35:05,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:35:05,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2094969064, now seen corresponding path program 1 times [2024-11-08 23:35:05,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:35:05,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842717844] [2024-11-08 23:35:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:35:05,007 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-08 23:35:05,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:35:05,010 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-08 23:35:05,011 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-08 23:35:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:35:05,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 23:35:05,597 INFO L278 TraceCheckSpWp]: Computing forward predicates...