./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.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 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:20:47,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:20:47,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:20:47,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:20:47,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:20:47,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:20:47,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:20:47,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:20:47,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:20:47,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:20:47,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:20:47,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:20:47,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:20:47,972 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:20:47,972 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:20:47,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:20:47,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:20:47,973 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:20:47,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:20:47,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:20:47,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:20:47,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:20:47,978 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:20:47,978 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:20:47,978 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:20:47,978 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:20:47,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:20:47,979 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:20:47,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:20:47,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:20:47,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:20:47,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:20:47,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:20:47,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:20:47,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:20:47,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:20:47,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:20:47,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:20:47,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:20:47,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:20:47,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:20:47,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:20:47,983 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 -> 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 [2024-10-24 09:20:48,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:20:48,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:20:48,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:20:48,268 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:20:48,269 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:20:48,269 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-24 09:20:49,775 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:20:50,003 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:20:50,004 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-24 09:20:50,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70481567c/bc1e3f938e7b4670accbe848b5ccd8b0/FLAG81eeb7ac9 [2024-10-24 09:20:50,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70481567c/bc1e3f938e7b4670accbe848b5ccd8b0 [2024-10-24 09:20:50,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:20:50,038 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:20:50,039 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:20:50,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:20:50,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:20:50,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d766337 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50, skipping insertion in model container [2024-10-24 09:20:50,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:20:50,271 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i[915,928] [2024-10-24 09:20:50,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:20:50,394 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:20:50,408 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i[915,928] [2024-10-24 09:20:50,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:20:50,485 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:20:50,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50 WrapperNode [2024-10-24 09:20:50,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:20:50,490 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:20:50,490 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:20:50,490 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:20:50,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,547 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2024-10-24 09:20:50,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:20:50,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:20:50,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:20:50,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:20:50,560 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,560 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,583 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:20:50,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,628 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:20:50,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:20:50,633 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:20:50,633 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:20:50,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (1/1) ... [2024-10-24 09:20:50,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:20:50,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:20:50,672 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-10-24 09:20:50,675 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-10-24 09:20:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:20:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:20:50,719 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:20:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:20:50,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:20:50,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:20:50,799 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:20:50,803 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:20:51,335 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-24 09:20:51,335 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:20:51,375 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:20:51,376 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:20:51,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:20:51 BoogieIcfgContainer [2024-10-24 09:20:51,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:20:51,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:20:51,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:20:51,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:20:51,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:20:50" (1/3) ... [2024-10-24 09:20:51,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364ba878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:20:51, skipping insertion in model container [2024-10-24 09:20:51,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:20:50" (2/3) ... [2024-10-24 09:20:51,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@364ba878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:20:51, skipping insertion in model container [2024-10-24 09:20:51,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:20:51" (3/3) ... [2024-10-24 09:20:51,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-24 09:20:51,400 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:20:51,400 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:20:51,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:20:51,497 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;@30c4eadf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:20:51,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:20:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 70 states have internal predecessors, (103), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:20:51,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 09:20:51,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:51,519 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:20:51,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:51,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash 386756682, now seen corresponding path program 1 times [2024-10-24 09:20:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:51,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418835683] [2024-10-24 09:20:51,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:51,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:20:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:20:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:20:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:20:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:20:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:20:52,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:20:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:20:52,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:20:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:20:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:20:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:20:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:20:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:20:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:20:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:20:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:20:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:20:52,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418835683] [2024-10-24 09:20:52,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418835683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:52,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:52,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:20:52,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944134799] [2024-10-24 09:20:52,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:52,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:20:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:52,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:20:52,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:20:52,396 INFO L87 Difference]: Start difference. First operand has 102 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 70 states have internal predecessors, (103), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:52,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:52,546 INFO L93 Difference]: Finished difference Result 300 states and 545 transitions. [2024-10-24 09:20:52,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:20:52,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-24 09:20:52,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:52,560 INFO L225 Difference]: With dead ends: 300 [2024-10-24 09:20:52,560 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 09:20:52,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:20:52,568 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 152 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:52,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 432 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:20:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 09:20:52,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 110. [2024-10-24 09:20:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:20:52,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 173 transitions. [2024-10-24 09:20:52,633 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 173 transitions. Word has length 194 [2024-10-24 09:20:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:52,635 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 173 transitions. [2024-10-24 09:20:52,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:52,635 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 173 transitions. [2024-10-24 09:20:52,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-24 09:20:52,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:52,640 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:20:52,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:20:52,641 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:52,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:52,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1087821260, now seen corresponding path program 1 times [2024-10-24 09:20:52,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:52,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529140777] [2024-10-24 09:20:52,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:20:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:20:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:20:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:20:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:20:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:20:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:20:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:20:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:20:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:20:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:52,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:20:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:20:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:52,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:20:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:20:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:20:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:20:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:20:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:20:52,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:52,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529140777] [2024-10-24 09:20:52,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529140777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:52,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:52,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:20:52,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891950370] [2024-10-24 09:20:52,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:52,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:20:52,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:20:52,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:20:52,981 INFO L87 Difference]: Start difference. First operand 110 states and 173 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:53,044 INFO L93 Difference]: Finished difference Result 294 states and 467 transitions. [2024-10-24 09:20:53,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:20:53,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-24 09:20:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:53,050 INFO L225 Difference]: With dead ends: 294 [2024-10-24 09:20:53,052 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 09:20:53,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:20:53,054 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 152 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:53,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 383 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:20:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 09:20:53,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 100. [2024-10-24 09:20:53,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:20:53,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-10-24 09:20:53,068 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 194 [2024-10-24 09:20:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:53,069 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-10-24 09:20:53,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-10-24 09:20:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-24 09:20:53,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:53,074 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:20:53,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:20:53,074 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:53,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:53,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1994441518, now seen corresponding path program 1 times [2024-10-24 09:20:53,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:53,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70289592] [2024-10-24 09:20:53,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:53,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:20:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:20:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:20:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:20:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:20:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:20:53,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:20:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:20:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:20:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:20:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:20:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:20:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:20:53,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:20:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:20:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:20:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:20:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:20:53,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:53,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70289592] [2024-10-24 09:20:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70289592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:53,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:53,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:20:53,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125547865] [2024-10-24 09:20:53,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:53,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:20:53,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:53,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:20:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:20:53,415 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:53,492 INFO L93 Difference]: Finished difference Result 298 states and 466 transitions. [2024-10-24 09:20:53,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:20:53,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 195 [2024-10-24 09:20:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:53,495 INFO L225 Difference]: With dead ends: 298 [2024-10-24 09:20:53,495 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 09:20:53,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:20:53,497 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 86 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:53,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 277 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:20:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 09:20:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2024-10-24 09:20:53,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 133 states have (on average 1.3984962406015038) internal successors, (186), 133 states have internal predecessors, (186), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:20:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 306 transitions. [2024-10-24 09:20:53,542 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 306 transitions. Word has length 195 [2024-10-24 09:20:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:53,543 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 306 transitions. [2024-10-24 09:20:53,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 306 transitions. [2024-10-24 09:20:53,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 09:20:53,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:53,545 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:20:53,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:20:53,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:53,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1050487887, now seen corresponding path program 1 times [2024-10-24 09:20:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818789381] [2024-10-24 09:20:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:53,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:20:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:20:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:20:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:20:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:20:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:20:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:20:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:20:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:20:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:20:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:20:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:20:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:20:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:20:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:20:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:53,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:20:53,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:20:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:20:53,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:53,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818789381] [2024-10-24 09:20:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818789381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:53,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:53,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:20:53,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345507702] [2024-10-24 09:20:53,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:53,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:20:53,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:53,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:20:53,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:20:53,885 INFO L87 Difference]: Start difference. First operand 196 states and 306 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:54,363 INFO L93 Difference]: Finished difference Result 493 states and 767 transitions. [2024-10-24 09:20:54,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:20:54,364 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-24 09:20:54,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:54,367 INFO L225 Difference]: With dead ends: 493 [2024-10-24 09:20:54,367 INFO L226 Difference]: Without dead ends: 298 [2024-10-24 09:20:54,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:20:54,369 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 191 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:54,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 608 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:20:54,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-24 09:20:54,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 208. [2024-10-24 09:20:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 145 states have (on average 1.3862068965517242) internal successors, (201), 145 states have internal predecessors, (201), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:20:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 321 transitions. [2024-10-24 09:20:54,400 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 321 transitions. Word has length 196 [2024-10-24 09:20:54,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:54,402 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 321 transitions. [2024-10-24 09:20:54,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:54,403 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 321 transitions. [2024-10-24 09:20:54,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 09:20:54,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:54,406 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:20:54,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:20:54,407 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:54,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:54,408 INFO L85 PathProgramCache]: Analyzing trace with hash 463681873, now seen corresponding path program 1 times [2024-10-24 09:20:54,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:54,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126116232] [2024-10-24 09:20:54,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:54,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:54,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:20:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:20:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:20:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:20:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:20:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:20:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:20:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:20:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:20:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:20:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:20:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:20:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:20:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:20:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:20:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:20:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:20:54,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:54,646 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:20:54,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:54,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126116232] [2024-10-24 09:20:54,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126116232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:54,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:54,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:20:54,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598704534] [2024-10-24 09:20:54,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:54,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:20:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:54,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:20:54,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:20:54,649 INFO L87 Difference]: Start difference. First operand 208 states and 321 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:55,006 INFO L93 Difference]: Finished difference Result 493 states and 766 transitions. [2024-10-24 09:20:55,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:20:55,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-24 09:20:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:55,010 INFO L225 Difference]: With dead ends: 493 [2024-10-24 09:20:55,010 INFO L226 Difference]: Without dead ends: 286 [2024-10-24 09:20:55,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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-10-24 09:20:55,012 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 171 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:55,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 488 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 09:20:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-24 09:20:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 196. [2024-10-24 09:20:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 133 states have (on average 1.3834586466165413) internal successors, (184), 133 states have internal predecessors, (184), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:20:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 304 transitions. [2024-10-24 09:20:55,061 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 304 transitions. Word has length 196 [2024-10-24 09:20:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:55,062 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 304 transitions. [2024-10-24 09:20:55,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:55,063 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 304 transitions. [2024-10-24 09:20:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 09:20:55,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:55,066 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:20:55,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:20:55,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:55,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:55,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1936274770, now seen corresponding path program 1 times [2024-10-24 09:20:55,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:55,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234991336] [2024-10-24 09:20:55,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:55,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:20:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:20:55,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 09:20:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 09:20:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:20:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:20:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:20:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:20:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:20:55,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 09:20:55,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 09:20:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 09:20:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 09:20:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:20:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 09:20:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:20:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 09:20:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 09:20:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 09:20:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 09:20:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 09:20:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 09:20:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 09:20:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 09:20:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 09:20:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 09:20:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 09:20:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 09:20:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 09:20:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-24 09:20:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:20:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:20:55,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:20:55,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234991336] [2024-10-24 09:20:55,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234991336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:20:55,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:20:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:20:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000404237] [2024-10-24 09:20:55,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:20:55,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:20:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:20:55,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:20:55,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:20:55,329 INFO L87 Difference]: Start difference. First operand 196 states and 304 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:55,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:20:55,519 INFO L93 Difference]: Finished difference Result 512 states and 797 transitions. [2024-10-24 09:20:55,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:20:55,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 196 [2024-10-24 09:20:55,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:20:55,527 INFO L225 Difference]: With dead ends: 512 [2024-10-24 09:20:55,527 INFO L226 Difference]: Without dead ends: 413 [2024-10-24 09:20:55,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:20:55,529 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 210 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:20:55,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 458 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 09:20:55,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-24 09:20:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 203. [2024-10-24 09:20:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 140 states have internal predecessors, (195), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 09:20:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 315 transitions. [2024-10-24 09:20:55,562 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 315 transitions. Word has length 196 [2024-10-24 09:20:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:20:55,563 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 315 transitions. [2024-10-24 09:20:55,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:20:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 315 transitions. [2024-10-24 09:20:55,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-24 09:20:55,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:20:55,565 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:20:55,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 09:20:55,566 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:20:55,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:20:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash -130836436, now seen corresponding path program 1 times [2024-10-24 09:20:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:20:55,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754109226] [2024-10-24 09:20:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:55,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:20:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:20:55,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012669316] [2024-10-24 09:20:55,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:20:55,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:20:55,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:20:55,748 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-10-24 09:20:55,753 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-10-24 09:20:55,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:20:55,920 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:20:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:20:56,146 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:20:56,147 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:20:56,148 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:20:56,174 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-10-24 09:20:56,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:20:56,356 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:20:56,491 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:20:56,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:20:56 BoogieIcfgContainer [2024-10-24 09:20:56,500 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:20:56,500 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:20:56,500 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:20:56,501 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:20:56,501 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:20:51" (3/4) ... [2024-10-24 09:20:56,503 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:20:56,504 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:20:56,506 INFO L158 Benchmark]: Toolchain (without parser) took 6466.75ms. Allocated memory was 136.3MB in the beginning and 220.2MB in the end (delta: 83.9MB). Free memory was 82.7MB in the beginning and 123.8MB in the end (delta: -41.2MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2024-10-24 09:20:56,506 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 136.3MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:20:56,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.31ms. Allocated memory is still 136.3MB. Free memory was 82.4MB in the beginning and 64.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 09:20:56,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.30ms. Allocated memory is still 136.3MB. Free memory was 64.6MB in the beginning and 60.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:20:56,507 INFO L158 Benchmark]: Boogie Preprocessor took 83.86ms. Allocated memory is still 136.3MB. Free memory was 60.4MB in the beginning and 106.0MB in the end (delta: -45.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-10-24 09:20:56,507 INFO L158 Benchmark]: RCFGBuilder took 743.30ms. Allocated memory is still 136.3MB. Free memory was 106.0MB in the beginning and 72.7MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-24 09:20:56,508 INFO L158 Benchmark]: TraceAbstraction took 5121.83ms. Allocated memory was 136.3MB in the beginning and 220.2MB in the end (delta: 83.9MB). Free memory was 72.1MB in the beginning and 124.9MB in the end (delta: -52.8MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-10-24 09:20:56,508 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 220.2MB. Free memory was 124.9MB in the beginning and 123.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:20:56,509 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.09ms. Allocated memory is still 136.3MB. Free memory is still 97.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.31ms. Allocated memory is still 136.3MB. Free memory was 82.4MB in the beginning and 64.6MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.30ms. Allocated memory is still 136.3MB. Free memory was 64.6MB in the beginning and 60.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 83.86ms. Allocated memory is still 136.3MB. Free memory was 60.4MB in the beginning and 106.0MB in the end (delta: -45.6MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * RCFGBuilder took 743.30ms. Allocated memory is still 136.3MB. Free memory was 106.0MB in the beginning and 72.7MB in the end (delta: 33.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5121.83ms. Allocated memory was 136.3MB in the beginning and 220.2MB in the end (delta: 83.9MB). Free memory was 72.1MB in the beginning and 124.9MB in the end (delta: -52.8MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 220.2MB. Free memory was 124.9MB in the beginning and 123.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryArithmeticFLOAToperation at line 111. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 256.8; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] signed long int var_1_8 = 1227169815; [L28] signed short int var_1_11 = 4; [L29] unsigned char var_1_12 = 1; [L30] double var_1_14 = -0.5; [L31] double var_1_15 = 7.5; [L32] unsigned char var_1_16 = 1; [L33] double var_1_17 = 25.2; [L34] double var_1_18 = 256.4; [L35] signed long int var_1_19 = 4; [L36] unsigned char var_1_20 = 1; [L37] unsigned char var_1_22 = 50; [L38] float var_1_23 = 15.4; [L39] signed short int var_1_24 = -32; [L40] signed short int var_1_25 = 20388; [L41] signed long int var_1_26 = 0; [L42] double var_1_27 = 0.6; [L43] unsigned char var_1_28 = 128; [L44] unsigned char var_1_29 = 5; [L45] signed char var_1_30 = -2; [L46] signed char var_1_31 = 5; [L47] signed char var_1_32 = 10; [L48] signed char var_1_33 = 4; [L49] signed char var_1_34 = 8; [L50] float last_1_var_1_1 = 256.8; [L51] unsigned char last_1_var_1_20 = 1; [L52] float last_1_var_1_23 = 15.4; [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L188] last_1_var_1_1 = var_1_1 [L189] last_1_var_1_20 = var_1_20 [L190] last_1_var_1_23 = var_1_23 [L200] RET updateLastVariables() [L201] CALL updateVariables() [L140] var_1_4 = __VERIFIER_nondet_long() [L141] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L141] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L142] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L142] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L143] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L143] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L144] var_1_5 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L145] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_6=2476/25, var_1_7=-2, var_1_8=1227169815] [L146] var_1_6 = __VERIFIER_nondet_float() [L147] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L147] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1227169815] [L148] var_1_8 = __VERIFIER_nondet_long() [L149] CALL assume_abort_if_not(var_1_8 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L149] RET assume_abort_if_not(var_1_8 >= 1073741822) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L150] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L150] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=1, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L151] var_1_12 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L152] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L153] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L153] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=1, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L154] var_1_16 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L155] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L156] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L156] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_17=126/5, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L157] var_1_17 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L158] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_18=1282/5, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L159] var_1_18 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L160] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=50, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L161] var_1_22 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L162] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L163] CALL assume_abort_if_not(var_1_22 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L163] RET assume_abort_if_not(var_1_22 <= 254) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-32, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L164] var_1_24 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L165] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L166] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L166] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L167] CALL assume_abort_if_not(var_1_24 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L167] RET assume_abort_if_not(var_1_24 != 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=20388, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L168] var_1_25 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_25 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L169] RET assume_abort_if_not(var_1_25 >= 16383) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L170] CALL assume_abort_if_not(var_1_25 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L170] RET assume_abort_if_not(var_1_25 <= 32767) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=5, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L171] var_1_29 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L172] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L173] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L173] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=5, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L174] var_1_31 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_31 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L175] RET assume_abort_if_not(var_1_31 >= -63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L176] CALL assume_abort_if_not(var_1_31 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L176] RET assume_abort_if_not(var_1_31 <= 63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=10, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L177] var_1_32 = __VERIFIER_nondet_char() [L178] CALL assume_abort_if_not(var_1_32 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L178] RET assume_abort_if_not(var_1_32 >= -63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L179] CALL assume_abort_if_not(var_1_32 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L179] RET assume_abort_if_not(var_1_32 <= 63) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=4, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L180] var_1_33 = __VERIFIER_nondet_char() [L181] CALL assume_abort_if_not(var_1_33 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L181] RET assume_abort_if_not(var_1_33 >= -127) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L182] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L182] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=8, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L183] var_1_34 = __VERIFIER_nondet_char() [L184] CALL assume_abort_if_not(var_1_34 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L184] RET assume_abort_if_not(var_1_34 >= -127) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L185] CALL assume_abort_if_not(var_1_34 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L185] RET assume_abort_if_not(var_1_34 <= 126) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L201] RET updateVariables() [L202] CALL step() [L56] COND FALSE !(var_1_18 < last_1_var_1_23) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=4, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L67] COND TRUE var_1_8 > var_1_4 [L68] var_1_11 = 0 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_27=3/5, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L80] COND TRUE (var_1_22 + (var_1_20 / var_1_24)) <= var_1_20 [L81] var_1_27 = (10000.2 + (((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) < 0 ) ? -((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) : ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L85] signed long int stepLocal_5 = 10000000; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_5=10000000, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L86] COND TRUE (var_1_5 - var_1_6) >= var_1_27 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_5=10000000, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=-2, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L87] COND TRUE stepLocal_5 > var_1_11 [L88] var_1_30 = (((((var_1_31 + var_1_32)) > (var_1_33)) ? ((var_1_31 + var_1_32)) : (var_1_33))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L93] signed char stepLocal_4 = var_1_30; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_4=0, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=128, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L94] COND TRUE ((var_1_30 + var_1_20) / var_1_4) > stepLocal_4 [L95] var_1_28 = ((((var_1_22) < (var_1_29)) ? (var_1_22) : (var_1_29))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=4, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L97] var_1_19 = (var_1_28 + (var_1_30 + var_1_11)) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L98] EXPR 8 << var_1_19 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L98] COND FALSE !(var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) [L103] unsigned char stepLocal_1 = var_1_4 >= var_1_11; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_1=1, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=-2, var_1_8=1073741823] [L104] COND TRUE ((var_1_6 - var_1_5) < var_1_23) || stepLocal_1 [L105] var_1_7 = ((var_1_8 - var_1_28) - var_1_28) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=1073741823, var_1_8=1073741823] [L109] signed long int stepLocal_0 = var_1_7 % var_1_4; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_0=0, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_1=1284/5, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=1073741823, var_1_8=1073741823] [L110] COND TRUE var_1_19 == stepLocal_0 [L111] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_7=1073741823, var_1_8=1073741823] [L113] COND FALSE !(\read(var_1_12)) [L120] var_1_14 = var_1_6 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=0, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [L122] COND TRUE 1.000000004E8 == var_1_23 [L123] var_1_26 = (64 + var_1_20) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [L127] unsigned char stepLocal_3 = var_1_16; [L128] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_2=1073741823, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [L129] EXPR var_1_26 ^ var_1_30 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_2=1073741823, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=15/2, var_1_16=0, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [L129] COND FALSE !(stepLocal_2 < (var_1_26 ^ var_1_30)) [L136] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, stepLocal_3=0, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR (((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17))) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [L193] EXPR ((((((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17)))) && (var_1_19 == ((signed long int) (var_1_28 + (var_1_30 + var_1_11))))) && ((var_1_18 < last_1_var_1_23) ? (var_1_12 ? (((last_1_var_1_1 + var_1_6) != last_1_var_1_1) ? (var_1_20 == ((unsigned char) var_1_22)) : (var_1_20 == ((unsigned char) var_1_22))) : (var_1_20 == ((unsigned char) var_1_22))) : 1)) && ((var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) ? (((256 - (var_1_25 - var_1_22)) >= var_1_11) ? (var_1_23 == ((float) (((((var_1_5 - var_1_6)) < (var_1_17)) ? ((var_1_5 - var_1_6)) : (var_1_17))))) : 1) : 1) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [L193-L194] return ((((((((((((var_1_19 == (var_1_7 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((((var_1_6 - var_1_5) < var_1_23) || (var_1_4 >= var_1_11)) ? (var_1_7 == ((signed long int) ((var_1_8 - var_1_28) - var_1_28))) : (var_1_7 == ((signed long int) -32)))) && ((var_1_8 > var_1_4) ? (var_1_11 == ((signed short int) 0)) : ((var_1_8 <= (last_1_var_1_20 + (last_1_var_1_20 / var_1_4))) ? (var_1_12 ? (var_1_11 == ((signed short int) last_1_var_1_20)) : (var_1_11 == ((signed short int) last_1_var_1_20))) : (var_1_11 == ((signed short int) last_1_var_1_20))))) && (var_1_12 ? ((((var_1_19 + var_1_20) * var_1_20) == ((var_1_8 + var_1_4) * var_1_20)) ? (var_1_14 == ((double) var_1_6)) : (var_1_14 == ((double) var_1_6))) : (var_1_14 == ((double) var_1_6)))) && ((var_1_8 < (var_1_26 ^ var_1_30)) ? (((! var_1_12) || var_1_16) ? (var_1_15 == ((double) ((((var_1_6) < ((var_1_17 + var_1_18))) ? (var_1_6) : ((var_1_17 + var_1_18)))))) : (var_1_15 == ((double) var_1_17))) : (var_1_15 == ((double) var_1_17)))) && (var_1_19 == ((signed long int) (var_1_28 + (var_1_30 + var_1_11))))) && ((var_1_18 < last_1_var_1_23) ? (var_1_12 ? (((last_1_var_1_1 + var_1_6) != last_1_var_1_1) ? (var_1_20 == ((unsigned char) var_1_22)) : (var_1_20 == ((unsigned char) var_1_22))) : (var_1_20 == ((unsigned char) var_1_22))) : 1)) && ((var_1_20 < ((8 << var_1_19) / ((((var_1_4) < (var_1_24)) ? (var_1_4) : (var_1_24))))) ? (((256 - (var_1_25 - var_1_22)) >= var_1_11) ? (var_1_23 == ((float) (((((var_1_5 - var_1_6)) < (var_1_17)) ? ((var_1_5 - var_1_6)) : (var_1_17))))) : 1) : 1)) && ((1.000000004E8 == var_1_23) ? (var_1_26 == ((signed long int) (64 + var_1_20))) : (var_1_26 == ((signed long int) ((((-4) < 0 ) ? -(-4) : (-4))))))) && (((var_1_22 + (var_1_20 / var_1_24)) <= var_1_20) ? (var_1_27 == ((double) (10000.2 + (((((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) < 0 ) ? -((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) : ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18)))))))) : (var_1_27 == ((double) (var_1_5 - var_1_6))))) && ((((var_1_30 + var_1_20) / var_1_4) > var_1_30) ? (var_1_28 == ((unsigned char) ((((var_1_22) < (var_1_29)) ? (var_1_22) : (var_1_29))))) : 1)) && (((var_1_5 - var_1_6) >= var_1_27) ? ((10000000 > var_1_11) ? (var_1_30 == ((signed char) (((((var_1_31 + var_1_32)) > (var_1_33)) ? ((var_1_31 + var_1_32)) : (var_1_33))))) : (var_1_30 == ((signed char) var_1_34))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=1284/5, last_1_var_1_20=1, last_1_var_1_23=77/5, var_1_11=0, var_1_12=0, var_1_14=2, var_1_15=3, var_1_16=0, var_1_17=3, var_1_19=0, var_1_20=1, var_1_22=-255, var_1_23=77/5, var_1_24=-6, var_1_25=16383, var_1_26=65, var_1_28=0, var_1_29=-256, var_1_30=0, var_1_31=-62, var_1_32=-62, var_1_33=0, var_1_34=-126, var_1_4=1, var_1_6=2, var_1_7=1073741823, var_1_8=1073741823] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 102 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 7, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 962 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 962 mSDsluCounter, 2646 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1153 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 486 IncrementalHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 1493 mSDtfsCounter, 486 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 567 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1563 NumberOfCodeBlocks, 1563 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1165 ConstructedInterpolants, 0 QuantifiedInterpolants, 2015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 10440/10440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:20:56,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.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 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:20:58,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:20:58,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:20:58,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:20:58,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:20:58,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:20:58,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:20:58,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:20:58,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:20:58,994 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:20:58,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:20:58,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:20:58,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:20:58,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:20:58,997 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:20:58,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:20:58,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:20:58,998 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:20:58,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:20:58,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:20:58,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:20:58,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:20:59,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:20:59,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:20:59,000 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:20:59,001 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:20:59,001 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:20:59,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:20:59,002 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:20:59,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:20:59,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:20:59,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:20:59,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:20:59,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:20:59,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:20:59,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:20:59,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:20:59,004 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:20:59,004 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:20:59,004 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:20:59,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:20:59,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:20:59,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:20:59,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:20:59,007 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:20:59,007 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 -> 9cd61dabb502d294946ebef32260e71c9554ff9367245793066a81be145185c6 [2024-10-24 09:20:59,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:20:59,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:20:59,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:20:59,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:20:59,404 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:20:59,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-24 09:21:01,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:21:01,345 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:21:01,346 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-24 09:21:01,361 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f3f130d/fba9a4cf574a48f7b6be66bb7257fea0/FLAGf777f6202 [2024-10-24 09:21:01,382 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45f3f130d/fba9a4cf574a48f7b6be66bb7257fea0 [2024-10-24 09:21:01,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:21:01,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:21:01,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:21:01,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:21:01,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:21:01,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:01,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79fd0b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01, skipping insertion in model container [2024-10-24 09:21:01,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:01,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:21:01,629 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i[915,928] [2024-10-24 09:21:01,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:21:01,752 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:21:01,768 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-8.i[915,928] [2024-10-24 09:21:01,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:21:01,868 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:21:01,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01 WrapperNode [2024-10-24 09:21:01,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:21:01,870 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:21:01,870 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:21:01,870 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:21:01,878 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:01,897 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:01,938 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-10-24 09:21:01,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:21:01,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:21:01,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:21:01,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:21:01,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:01,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:01,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:01,990 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:21:01,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:01,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:02,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:02,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:02,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:02,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:02,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:21:02,027 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:21:02,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:21:02,028 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:21:02,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (1/1) ... [2024-10-24 09:21:02,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:21:02,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:21:02,066 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-10-24 09:21:02,074 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-10-24 09:21:02,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:21:02,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:21:02,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:21:02,127 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:21:02,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:21:02,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:21:02,214 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:21:02,216 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:21:09,869 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 09:21:09,869 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:21:09,928 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:21:09,929 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:21:09,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:21:09 BoogieIcfgContainer [2024-10-24 09:21:09,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:21:09,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:21:09,934 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:21:09,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:21:09,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:21:01" (1/3) ... [2024-10-24 09:21:09,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe987f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:21:09, skipping insertion in model container [2024-10-24 09:21:09,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:21:01" (2/3) ... [2024-10-24 09:21:09,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe987f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:21:09, skipping insertion in model container [2024-10-24 09:21:09,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:21:09" (3/3) ... [2024-10-24 09:21:09,941 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-8.i [2024-10-24 09:21:09,955 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:21:09,955 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:21:10,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:21:10,022 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;@73af2cb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:21:10,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:21:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:21:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 09:21:10,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:21:10,042 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:21:10,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:21:10,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:21:10,046 INFO L85 PathProgramCache]: Analyzing trace with hash -131504856, now seen corresponding path program 1 times [2024-10-24 09:21:10,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:21:10,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070200918] [2024-10-24 09:21:10,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:10,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:21:10,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:21:10,062 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-10-24 09:21:10,082 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-10-24 09:21:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:10,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:21:10,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:21:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-24 09:21:10,737 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:21:10,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:21:10,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070200918] [2024-10-24 09:21:10,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2070200918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:21:10,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:21:10,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:21:10,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265001041] [2024-10-24 09:21:10,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:21:10,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:21:10,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:21:10,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:21:10,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:21:10,774 INFO L87 Difference]: Start difference. First operand has 84 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:21:15,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:21:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:21:15,005 INFO L93 Difference]: Finished difference Result 165 states and 298 transitions. [2024-10-24 09:21:15,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:21:15,061 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-10-24 09:21:15,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:21:15,069 INFO L225 Difference]: With dead ends: 165 [2024-10-24 09:21:15,069 INFO L226 Difference]: Without dead ends: 82 [2024-10-24 09:21:15,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:21:15,075 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:21:15,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-24 09:21:15,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-24 09:21:15,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-24 09:21:15,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 09:21:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 129 transitions. [2024-10-24 09:21:15,124 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 129 transitions. Word has length 188 [2024-10-24 09:21:15,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:21:15,128 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 129 transitions. [2024-10-24 09:21:15,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-24 09:21:15,129 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 129 transitions. [2024-10-24 09:21:15,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-24 09:21:15,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:21:15,133 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:21:15,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-24 09:21:15,333 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-10-24 09:21:15,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:21:15,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:21:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash -74246554, now seen corresponding path program 1 times [2024-10-24 09:21:15,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:21:15,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357957320] [2024-10-24 09:21:15,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:21:15,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:21:15,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:21:15,339 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-10-24 09:21:15,342 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-10-24 09:21:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:21:15,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 09:21:15,977 INFO L278 TraceCheckSpWp]: Computing forward predicates...