./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-94.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-94.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c185aaf4a9cc952b10ab55137c5789b08cb7a017f917b034409a16b5090ed213 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:23:16,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:23:16,263 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:23:16,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:23:16,270 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:23:16,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:23:16,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:23:16,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:23:16,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:23:16,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:23:16,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:23:16,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:23:16,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:23:16,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:23:16,298 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:23:16,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:23:16,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:23:16,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:23:16,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:23:16,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:23:16,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:23:16,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:23:16,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:23:16,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:23:16,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:23:16,306 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:23:16,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:23:16,306 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:23:16,306 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:23:16,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:23:16,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:23:16,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:23:16,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:23:16,307 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:23:16,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:23:16,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:23:16,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:23:16,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:23:16,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:23:16,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:23:16,309 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:23:16,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:23:16,310 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c185aaf4a9cc952b10ab55137c5789b08cb7a017f917b034409a16b5090ed213 [2024-10-11 11:23:16,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:23:16,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:23:16,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:23:16,540 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:23:16,540 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:23:16,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-94.i [2024-10-11 11:23:17,868 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:23:18,056 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:23:18,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-94.i [2024-10-11 11:23:18,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c5863c82b/017ec9ef52f34ba49feeb03d0b53fab3/FLAG4d89fd7a9 [2024-10-11 11:23:18,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c5863c82b/017ec9ef52f34ba49feeb03d0b53fab3 [2024-10-11 11:23:18,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:23:18,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:23:18,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:23:18,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:23:18,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:23:18,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@683821f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18, skipping insertion in model container [2024-10-11 11:23:18,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,115 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:23:18,236 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-94.i[916,929] [2024-10-11 11:23:18,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:23:18,315 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:23:18,326 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-94.i[916,929] [2024-10-11 11:23:18,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:23:18,398 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:23:18,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18 WrapperNode [2024-10-11 11:23:18,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:23:18,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:23:18,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:23:18,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:23:18,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,419 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,479 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-10-11 11:23:18,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:23:18,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:23:18,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:23:18,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:23:18,491 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,518 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,548 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:23:18,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,583 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:23:18,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:23:18,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:23:18,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:23:18,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (1/1) ... [2024-10-11 11:23:18,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:23:18,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:18,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:23:18,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:23:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:23:18,701 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:23:18,702 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:23:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:23:18,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:23:18,702 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:23:18,779 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:23:18,780 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:23:19,179 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-11 11:23:19,180 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:23:19,221 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:23:19,222 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:23:19,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:19 BoogieIcfgContainer [2024-10-11 11:23:19,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:23:19,223 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:23:19,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:23:19,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:23:19,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:23:18" (1/3) ... [2024-10-11 11:23:19,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc62cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:23:19, skipping insertion in model container [2024-10-11 11:23:19,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:18" (2/3) ... [2024-10-11 11:23:19,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc62cea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:23:19, skipping insertion in model container [2024-10-11 11:23:19,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:19" (3/3) ... [2024-10-11 11:23:19,228 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-94.i [2024-10-11 11:23:19,241 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:23:19,241 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:23:19,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:23:19,298 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;@5c54fe35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:23:19,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:23:19,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 11:23:19,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 11:23:19,311 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:19,311 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:19,311 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:19,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:19,315 INFO L85 PathProgramCache]: Analyzing trace with hash -135881231, now seen corresponding path program 1 times [2024-10-11 11:23:19,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:19,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864657861] [2024-10-11 11:23:19,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:19,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:19,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:23:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:23:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:23:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:23:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:23:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:23:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:19,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:23:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:23:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:23:20,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:23:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:23:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:23:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:23:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:23:20,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:23:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:23:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:23:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:23:20,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:23:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:23:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:23:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:23:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:23:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:23:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:23:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:23:20,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:23:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 11:23:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:23:20,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864657861] [2024-10-11 11:23:20,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864657861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:23:20,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:23:20,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:23:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730034061] [2024-10-11 11:23:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:23:20,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:23:20,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:23:20,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:23:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:23:20,109 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:20,280 INFO L93 Difference]: Finished difference Result 199 states and 363 transitions. [2024-10-11 11:23:20,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:23:20,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 174 [2024-10-11 11:23:20,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:20,292 INFO L225 Difference]: With dead ends: 199 [2024-10-11 11:23:20,293 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 11:23:20,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:23:20,298 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 67 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:20,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 280 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:23:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 11:23:20,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-10-11 11:23:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.328358208955224) internal successors, (89), 68 states have internal predecessors, (89), 43 states have call successors, (43), 2 states have call predecessors, (43), 2 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-10-11 11:23:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 175 transitions. [2024-10-11 11:23:20,354 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 175 transitions. Word has length 174 [2024-10-11 11:23:20,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:20,355 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 175 transitions. [2024-10-11 11:23:20,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:20,355 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 175 transitions. [2024-10-11 11:23:20,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 11:23:20,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:20,358 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:20,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:23:20,359 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:20,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:20,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1137044820, now seen corresponding path program 1 times [2024-10-11 11:23:20,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:20,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325345570] [2024-10-11 11:23:20,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:20,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:23:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:23:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:23:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:23:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:23:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:23:20,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:23:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:23:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:23:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:23:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:23:20,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:23:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:23:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:23:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:23:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:23:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:23:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:23:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:23:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:23:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:23:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:23:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:23:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:23:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:23:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:23:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:23:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 11:23:20,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:23:20,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325345570] [2024-10-11 11:23:20,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325345570] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:23:20,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:23:20,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:23:20,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354490208] [2024-10-11 11:23:20,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:23:20,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:23:20,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:23:20,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:23:20,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:23:20,912 INFO L87 Difference]: Start difference. First operand 113 states and 175 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:21,094 INFO L93 Difference]: Finished difference Result 317 states and 486 transitions. [2024-10-11 11:23:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:23:21,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-10-11 11:23:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:21,103 INFO L225 Difference]: With dead ends: 317 [2024-10-11 11:23:21,105 INFO L226 Difference]: Without dead ends: 230 [2024-10-11 11:23:21,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-11 11:23:21,109 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 167 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:21,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 366 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:23:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-11 11:23:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 196. [2024-10-11 11:23:21,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 122 states have internal predecessors, (159), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 11:23:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 299 transitions. [2024-10-11 11:23:21,150 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 299 transitions. Word has length 175 [2024-10-11 11:23:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:21,152 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 299 transitions. [2024-10-11 11:23:21,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 299 transitions. [2024-10-11 11:23:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 11:23:21,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:21,158 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:21,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:23:21,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:21,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:21,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1355899538, now seen corresponding path program 1 times [2024-10-11 11:23:21,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:21,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474594751] [2024-10-11 11:23:21,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:21,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:23:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 11:23:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 11:23:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 11:23:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 11:23:21,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 11:23:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 11:23:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 11:23:21,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 11:23:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:21,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 11:23:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 11:23:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:23:22,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 11:23:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:23:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 11:23:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:23:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:23:22,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:23:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 11:23:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 11:23:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 11:23:22,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 11:23:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:23:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:23:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:23:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 11:23:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 11:23:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 11:23:22,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:23:22,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474594751] [2024-10-11 11:23:22,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474594751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:23:22,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:23:22,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:23:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798111891] [2024-10-11 11:23:22,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:23:22,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:23:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:23:22,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:23:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:23:22,111 INFO L87 Difference]: Start difference. First operand 196 states and 299 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:22,536 INFO L93 Difference]: Finished difference Result 485 states and 731 transitions. [2024-10-11 11:23:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:23:22,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 175 [2024-10-11 11:23:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:22,540 INFO L225 Difference]: With dead ends: 485 [2024-10-11 11:23:22,540 INFO L226 Difference]: Without dead ends: 315 [2024-10-11 11:23:22,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:23:22,543 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 211 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:22,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 428 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:23:22,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-10-11 11:23:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 267. [2024-10-11 11:23:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 180 states have (on average 1.3666666666666667) internal successors, (246), 180 states have internal predecessors, (246), 81 states have call successors, (81), 5 states have call predecessors, (81), 5 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-10-11 11:23:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 408 transitions. [2024-10-11 11:23:22,586 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 408 transitions. Word has length 175 [2024-10-11 11:23:22,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:22,586 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 408 transitions. [2024-10-11 11:23:22,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 408 transitions. [2024-10-11 11:23:22,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 11:23:22,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:22,588 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:22,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:23:22,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:22,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:22,588 INFO L85 PathProgramCache]: Analyzing trace with hash 546552912, now seen corresponding path program 1 times [2024-10-11 11:23:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:22,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403128573] [2024-10-11 11:23:22,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:22,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:23:22,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [55505950] [2024-10-11 11:23:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:22,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:22,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:22,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:23:22,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:23:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:23,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 11:23:23,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 456 proven. 63 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-10-11 11:23:25,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:23:26,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:23:26,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403128573] [2024-10-11 11:23:26,884 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:23:26,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55505950] [2024-10-11 11:23:26,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55505950] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:23:26,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:23:26,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-11 11:23:26,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252212764] [2024-10-11 11:23:26,886 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:23:26,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:23:26,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:23:26,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:23:26,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:23:26,888 INFO L87 Difference]: Start difference. First operand 267 states and 408 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 11:23:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:27,840 INFO L93 Difference]: Finished difference Result 944 states and 1397 transitions. [2024-10-11 11:23:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 11:23:27,841 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2024-10-11 11:23:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:27,845 INFO L225 Difference]: With dead ends: 944 [2024-10-11 11:23:27,845 INFO L226 Difference]: Without dead ends: 756 [2024-10-11 11:23:27,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=684, Unknown=0, NotChecked=0, Total=930 [2024-10-11 11:23:27,847 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 578 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:27,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 622 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:23:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-11 11:23:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 670. [2024-10-11 11:23:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 502 states have (on average 1.3844621513944224) internal successors, (695), 506 states have internal predecessors, (695), 151 states have call successors, (151), 16 states have call predecessors, (151), 16 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2024-10-11 11:23:27,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 997 transitions. [2024-10-11 11:23:27,899 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 997 transitions. Word has length 175 [2024-10-11 11:23:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:27,899 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 997 transitions. [2024-10-11 11:23:27,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 11:23:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 997 transitions. [2024-10-11 11:23:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 11:23:27,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:27,901 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:27,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:23:28,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:28,103 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:28,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:28,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1247617490, now seen corresponding path program 1 times [2024-10-11 11:23:28,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:28,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264999145] [2024-10-11 11:23:28,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:28,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:23:28,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052772836] [2024-10-11 11:23:28,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:28,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:28,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:28,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:23:28,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:23:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:28,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 11:23:28,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:28,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 656 proven. 27 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2024-10-11 11:23:28,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:23:29,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:23:29,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264999145] [2024-10-11 11:23:29,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:23:29,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052772836] [2024-10-11 11:23:29,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052772836] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:23:29,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:23:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-10-11 11:23:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27559824] [2024-10-11 11:23:29,322 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:23:29,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 11:23:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:23:29,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 11:23:29,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=298, Unknown=3, NotChecked=0, Total=380 [2024-10-11 11:23:29,327 INFO L87 Difference]: Start difference. First operand 670 states and 997 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2024-10-11 11:23:31,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:31,473 INFO L93 Difference]: Finished difference Result 2167 states and 3130 transitions. [2024-10-11 11:23:31,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-10-11 11:23:31,473 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 175 [2024-10-11 11:23:31,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:31,487 INFO L225 Difference]: With dead ends: 2167 [2024-10-11 11:23:31,487 INFO L226 Difference]: Without dead ends: 1616 [2024-10-11 11:23:31,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=515, Invalid=1462, Unknown=3, NotChecked=0, Total=1980 [2024-10-11 11:23:31,491 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 435 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 175 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:31,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1253 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 911 Invalid, 1 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 11:23:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-10-11 11:23:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 916. [2024-10-11 11:23:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 699 states have (on average 1.3819742489270386) internal successors, (966), 704 states have internal predecessors, (966), 182 states have call successors, (182), 34 states have call predecessors, (182), 34 states have return successors, (182), 177 states have call predecessors, (182), 182 states have call successors, (182) [2024-10-11 11:23:31,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1330 transitions. [2024-10-11 11:23:31,621 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1330 transitions. Word has length 175 [2024-10-11 11:23:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:31,621 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1330 transitions. [2024-10-11 11:23:31,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2024-10-11 11:23:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1330 transitions. [2024-10-11 11:23:31,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-11 11:23:31,623 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:31,623 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:31,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:23:31,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:31,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:31,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:31,829 INFO L85 PathProgramCache]: Analyzing trace with hash -746527216, now seen corresponding path program 1 times [2024-10-11 11:23:31,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:23:31,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076701743] [2024-10-11 11:23:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:23:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:23:31,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713393873] [2024-10-11 11:23:31,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:31,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:31,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:31,919 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:23:31,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:23:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:23:32,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:23:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:23:32,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:23:32,247 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:23:32,248 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:23:32,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 11:23:32,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:23:32,453 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 11:23:32,586 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:23:32,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:23:32 BoogieIcfgContainer [2024-10-11 11:23:32,590 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:23:32,591 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:23:32,591 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:23:32,591 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:23:32,591 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:19" (3/4) ... [2024-10-11 11:23:32,593 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:23:32,594 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:23:32,595 INFO L158 Benchmark]: Toolchain (without parser) took 14515.96ms. Allocated memory was 211.8MB in the beginning and 436.2MB in the end (delta: 224.4MB). Free memory was 144.8MB in the beginning and 241.1MB in the end (delta: -96.3MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2024-10-11 11:23:32,595 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:23:32,595 INFO L158 Benchmark]: CACSL2BoogieTranslator took 319.77ms. Allocated memory is still 211.8MB. Free memory was 144.6MB in the beginning and 125.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:23:32,595 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.23ms. Allocated memory is still 211.8MB. Free memory was 125.4MB in the beginning and 180.6MB in the end (delta: -55.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2024-10-11 11:23:32,595 INFO L158 Benchmark]: Boogie Preprocessor took 119.59ms. Allocated memory is still 211.8MB. Free memory was 180.6MB in the beginning and 169.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 11:23:32,596 INFO L158 Benchmark]: RCFGBuilder took 621.90ms. Allocated memory is still 211.8MB. Free memory was 169.2MB in the beginning and 132.3MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-11 11:23:32,596 INFO L158 Benchmark]: TraceAbstraction took 13366.99ms. Allocated memory was 211.8MB in the beginning and 436.2MB in the end (delta: 224.4MB). Free memory was 132.3MB in the beginning and 241.1MB in the end (delta: -108.7MB). Peak memory consumption was 116.5MB. Max. memory is 16.1GB. [2024-10-11 11:23:32,596 INFO L158 Benchmark]: Witness Printer took 3.55ms. Allocated memory is still 436.2MB. Free memory is still 241.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:23:32,598 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.13ms. Allocated memory is still 117.4MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 319.77ms. Allocated memory is still 211.8MB. Free memory was 144.6MB in the beginning and 125.4MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.23ms. Allocated memory is still 211.8MB. Free memory was 125.4MB in the beginning and 180.6MB in the end (delta: -55.2MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.59ms. Allocated memory is still 211.8MB. Free memory was 180.6MB in the beginning and 169.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 621.90ms. Allocated memory is still 211.8MB. Free memory was 169.2MB in the beginning and 132.3MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 13366.99ms. Allocated memory was 211.8MB in the beginning and 436.2MB in the end (delta: 224.4MB). Free memory was 132.3MB in the beginning and 241.1MB in the end (delta: -108.7MB). Peak memory consumption was 116.5MB. Max. memory is 16.1GB. * Witness Printer took 3.55ms. Allocated memory is still 436.2MB. Free memory is still 241.1MB. 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 188, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = -0.25; [L23] double var_1_2 = -0.125; [L24] double var_1_3 = 127.5; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 10; [L28] float var_1_7 = -0.2; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char var_1_11 = 1; [L32] unsigned char var_1_12 = 0; [L33] unsigned char var_1_13 = 0; [L34] unsigned char var_1_14 = 0; [L35] signed long int var_1_15 = -100000; [L36] signed char var_1_18 = 8; [L37] signed char var_1_19 = 64; [L38] signed short int var_1_20 = -16; [L39] signed long int var_1_22 = -1; [L40] double var_1_23 = 500.8; [L41] double var_1_24 = 9.8; [L42] unsigned short int var_1_25 = 16; [L43] unsigned short int var_1_26 = 41277; [L44] signed long int var_1_27 = 1000; [L45] double var_1_29 = 99.5; [L46] double var_1_30 = 99999999.6; [L47] unsigned long int var_1_31 = 4; [L48] unsigned short int var_1_32 = 10; [L49] unsigned short int var_1_33 = 52075; [L50] unsigned char last_1_var_1_4 = 4; [L51] unsigned char last_1_var_1_9 = 0; [L52] signed long int last_1_var_1_15 = -100000; [L53] signed short int last_1_var_1_20 = -16; [L54] signed long int last_1_var_1_22 = -1; [L55] unsigned short int last_1_var_1_32 = 10; [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] CALL updateLastVariables() [L180] last_1_var_1_4 = var_1_4 [L181] last_1_var_1_9 = var_1_9 [L182] last_1_var_1_15 = var_1_15 [L183] last_1_var_1_20 = var_1_20 [L184] last_1_var_1_22 = var_1_22 [L185] last_1_var_1_32 = var_1_32 [L195] RET updateLastVariables() [L196] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L137] RET assume_abort_if_not((var_1_2 >= -461168.6018427382800e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 4611686.018427382800e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_3=255/2, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L138] var_1_3 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L139] RET assume_abort_if_not((var_1_3 >= -461168.6018427382800e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 4611686.018427382800e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L140] var_1_5 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_6=10, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=10, var_1_9=0] [L143] var_1_6 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_6 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L145] RET assume_abort_if_not(var_1_6 <= 254) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=1, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L146] var_1_10 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L147] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L148] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L149] var_1_11 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L159] RET assume_abort_if_not(var_1_14 >= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L160] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=64, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L161] var_1_19 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L162] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L163] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=49/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L164] var_1_24 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L165] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=41277, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_26 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L167] RET assume_abort_if_not(var_1_26 >= 32767) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L168] CALL assume_abort_if_not(var_1_26 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L168] RET assume_abort_if_not(var_1_26 <= 65535) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=1000, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L169] var_1_27 = __VERIFIER_nondet_long() [L170] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L170] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L171] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L172] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_30=499999998/5, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L173] var_1_30 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L174] RET assume_abort_if_not((var_1_30 >= -922337.2036854765600e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854765600e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=52075, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L175] var_1_33 = __VERIFIER_nondet_ushort() [L176] CALL assume_abort_if_not(var_1_33 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-16385, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-16385, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L176] RET assume_abort_if_not(var_1_33 >= 49150) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-16385, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-16385, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-16385, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-16385, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L196] RET updateVariables() [L197] CALL step() [L59] signed long int stepLocal_7 = ((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4)))); VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_7=4, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=4, var_1_32=10, var_1_33=-16385, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L60] COND TRUE stepLocal_7 >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15) [L61] var_1_31 = (last_1_var_1_32 + (1891941459u - last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L65] COND FALSE !(\read(last_1_var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=199/2, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L68] var_1_1 = ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))) [L69] var_1_29 = ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30))) [L70] unsigned char stepLocal_2 = var_1_10; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L71] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L80] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=16, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L85] COND FALSE !((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) [L88] var_1_25 = ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L90] unsigned char stepLocal_1 = var_1_6 <= var_1_31; [L91] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L92] COND FALSE !(stepLocal_0 > (var_1_25 * var_1_31)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L97] COND FALSE !(var_1_3 <= (- var_1_7)) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L102] unsigned char stepLocal_3 = var_1_9; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=8, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L103] COND FALSE !(var_1_3 != var_1_29) [L110] var_1_18 = var_1_19 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L112] EXPR var_1_4 >> var_1_18 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L112] COND FALSE !(var_1_6 >= (var_1_4 >> var_1_18)) [L115] signed char stepLocal_5 = var_1_18; [L116] signed char stepLocal_4 = var_1_18; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L117] COND FALSE !(stepLocal_5 < var_1_19) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_4=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-16, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L120] COND FALSE !(((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == stepLocal_4) [L123] var_1_20 = -10 VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L126] signed short int stepLocal_6 = var_1_20; VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, stepLocal_6=-10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L127] COND FALSE !(stepLocal_6 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, stepLocal_1=1, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L197] RET step() [L198] CALL, EXPR property() [L188] EXPR ((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L188-L189] return ((((((((((((var_1_1 == ((double) ((((9.999999999999925E13) < ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3)))))) ? (9.999999999999925E13) : ((var_1_2 + ((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))))))))) && (var_1_9 ? ((var_1_3 <= ((((499.25) < (999999.3)) ? (499.25) : (999999.3)))) ? (var_1_4 == ((unsigned char) var_1_6)) : 1) : 1)) && ((var_1_6 > (var_1_25 * var_1_31)) ? (((var_1_6 <= var_1_31) && var_1_9) ? (var_1_7 == ((float) var_1_3)) : 1) : 1)) && (var_1_5 ? ((var_1_11 || var_1_10) ? ((! (var_1_29 < var_1_2)) ? (var_1_9 == ((unsigned char) (var_1_12 || var_1_13))) : (var_1_9 == ((unsigned char) (var_1_11 && ((var_1_12 && var_1_13) || (! var_1_14)))))) : 1) : 1)) && ((var_1_6 >= (var_1_4 >> var_1_18)) ? (var_1_15 == ((signed long int) (((((var_1_4 + var_1_32)) < ((var_1_18 + (var_1_6 + var_1_18)))) ? ((var_1_4 + var_1_32)) : ((var_1_18 + (var_1_6 + var_1_18))))))) : 1)) && ((var_1_3 != var_1_29) ? (((var_1_32 <= var_1_31) && var_1_9) ? (var_1_18 == ((signed char) var_1_19)) : (var_1_18 == ((signed char) var_1_19))) : (var_1_18 == ((signed char) var_1_19)))) && ((var_1_18 < var_1_19) ? (var_1_20 == ((signed short int) (var_1_31 + var_1_19))) : ((((((last_1_var_1_20) < (var_1_6)) ? (last_1_var_1_20) : (var_1_6))) == var_1_18) ? (var_1_20 == ((signed short int) ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) : (var_1_20 == ((signed short int) -10))))) && ((var_1_20 > ((((var_1_20) > (var_1_19)) ? (var_1_20) : (var_1_19)))) ? ((! var_1_12) ? (var_1_22 == ((signed long int) (var_1_31 - var_1_20))) : (var_1_22 == ((signed long int) 2))) : 1)) && ((var_1_3 <= (- var_1_7)) ? (var_1_9 ? (var_1_23 == ((double) (var_1_24 - 31.25))) : 1) : 1)) && (((var_1_26 - var_1_32) <= (var_1_19 % var_1_27)) ? (var_1_25 == ((unsigned short int) ((((var_1_6) > (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32))))) ? (var_1_6) : (((((var_1_32) > (var_1_32)) ? (var_1_32) : (var_1_32)))))))) : (var_1_25 == ((unsigned short int) ((((((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) > (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4))))) ? (((((var_1_6) < (var_1_32)) ? (var_1_6) : (var_1_32)))) : (((((var_1_32) < (var_1_4)) ? (var_1_32) : (var_1_4)))))))))) && (var_1_29 == ((double) ((((((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) > (var_1_30)) ? (((((var_1_24) < (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))) ? (var_1_24) : (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3))))))) : (var_1_30)))))) && (((((((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) < 0 ) ? -((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))) : ((((last_1_var_1_32) < (last_1_var_1_4)) ? (last_1_var_1_32) : (last_1_var_1_4))))) >= ((last_1_var_1_22 * var_1_6) * last_1_var_1_15)) ? (var_1_31 == ((unsigned long int) (last_1_var_1_32 + (1891941459u - last_1_var_1_15)))) : (var_1_31 == ((unsigned long int) ((((((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) > (var_1_26)) ? (((((last_1_var_1_15) < (last_1_var_1_4)) ? (last_1_var_1_15) : (last_1_var_1_4)))) : (var_1_26))))))) && (last_1_var_1_9 ? (var_1_32 == ((unsigned short int) ((var_1_33 - last_1_var_1_15) - var_1_6))) : 1) ; [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=-100000, last_1_var_1_20=-16, last_1_var_1_22=-1, last_1_var_1_32=10, last_1_var_1_4=4, last_1_var_1_9=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=-100000, var_1_18=0, var_1_19=0, var_1_1=399999999999997/4, var_1_20=-10, var_1_22=-1, var_1_23=2504/5, var_1_24=2, var_1_25=4, var_1_26=-32768, var_1_27=2, var_1_29=2, var_1_2=0, var_1_30=0, var_1_31=1892041469, var_1_32=10, var_1_33=-16385, var_1_3=0, var_1_4=4, var_1_5=0, var_1_6=-256, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.2s, OverallIterations: 6, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1477 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1458 mSDsluCounter, 2949 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2295 mSDsCounter, 454 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1854 IncrementalHoareTripleChecker+Invalid, 2309 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 454 mSolverCounterUnsat, 654 mSDtfsCounter, 1854 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 774 GetRequests, 687 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=916occurred in iteration=5, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 869 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 1574 NumberOfCodeBlocks, 1574 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 869 ConstructedInterpolants, 6 QuantifiedInterpolants, 6300 SizeOfPredicates, 15 NumberOfNonLiveVariables, 824 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 6930/7020 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:23:32,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-94.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c185aaf4a9cc952b10ab55137c5789b08cb7a017f917b034409a16b5090ed213 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:23:34,786 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:23:34,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:23:34,855 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:23:34,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:23:34,877 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:23:34,879 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:23:34,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:23:34,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:23:34,882 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:23:34,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:23:34,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:23:34,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:23:34,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:23:34,883 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:23:34,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:23:34,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:23:34,884 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:23:34,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:23:34,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:23:34,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:23:34,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:23:34,886 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:23:34,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:23:34,886 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:23:34,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:23:34,887 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:23:34,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:23:34,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:23:34,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:23:34,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:23:34,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:23:34,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:23:34,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:23:34,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:23:34,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:23:34,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:23:34,890 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:23:34,890 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:23:34,890 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:23:34,890 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:23:34,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:23:34,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:23:34,891 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:23:34,891 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:23:34,891 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c185aaf4a9cc952b10ab55137c5789b08cb7a017f917b034409a16b5090ed213 [2024-10-11 11:23:35,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:23:35,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:23:35,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:23:35,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:23:35,222 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:23:35,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-94.i [2024-10-11 11:23:36,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:23:37,137 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:23:37,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-94.i [2024-10-11 11:23:37,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/490c75b9b/048a5e375b1f4c6c85ad726892f2527a/FLAG43f09f06f [2024-10-11 11:23:37,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/490c75b9b/048a5e375b1f4c6c85ad726892f2527a [2024-10-11 11:23:37,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:23:37,169 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:23:37,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:23:37,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:23:37,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:23:37,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27546a00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37, skipping insertion in model container [2024-10-11 11:23:37,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:23:37,415 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-94.i[916,929] [2024-10-11 11:23:37,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:23:37,519 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:23:37,532 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-94.i[916,929] [2024-10-11 11:23:37,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:23:37,587 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:23:37,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37 WrapperNode [2024-10-11 11:23:37,588 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:23:37,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:23:37,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:23:37,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:23:37,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,637 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-11 11:23:37,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:23:37,639 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:23:37,639 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:23:37,639 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:23:37,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,663 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:23:37,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,672 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,675 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:23:37,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:23:37,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:23:37,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:23:37,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (1/1) ... [2024-10-11 11:23:37,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:23:37,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:23:37,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:23:37,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:23:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:23:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:23:37,794 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:23:37,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:23:37,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:23:37,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:23:37,879 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:23:37,881 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:23:41,249 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-11 11:23:41,249 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:23:41,301 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:23:41,301 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:23:41,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:41 BoogieIcfgContainer [2024-10-11 11:23:41,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:23:41,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:23:41,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:23:41,310 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:23:41,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:23:37" (1/3) ... [2024-10-11 11:23:41,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f21b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:23:41, skipping insertion in model container [2024-10-11 11:23:41,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:23:37" (2/3) ... [2024-10-11 11:23:41,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f21b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:23:41, skipping insertion in model container [2024-10-11 11:23:41,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:23:41" (3/3) ... [2024-10-11 11:23:41,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-94.i [2024-10-11 11:23:41,326 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:23:41,326 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:23:41,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:23:41,384 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;@2c14839d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:23:41,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:23:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 11:23:41,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 11:23:41,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:41,398 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:41,398 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:41,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:41,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1126631580, now seen corresponding path program 1 times [2024-10-11 11:23:41,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:23:41,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313863914] [2024-10-11 11:23:41,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:41,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:23:41,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:23:41,438 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:23:41,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:23:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:41,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:23:41,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:41,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 712 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked. [2024-10-11 11:23:41,855 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:23:41,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:23:41,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313863914] [2024-10-11 11:23:41,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313863914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:23:41,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:23:41,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:23:41,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491327505] [2024-10-11 11:23:41,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:23:41,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:23:41,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:23:41,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:23:41,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:23:41,881 INFO L87 Difference]: Start difference. First operand has 79 states, 49 states have (on average 1.489795918367347) internal successors, (73), 50 states have internal predecessors, (73), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 11:23:44,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:44,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:44,671 INFO L93 Difference]: Finished difference Result 155 states and 279 transitions. [2024-10-11 11:23:44,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:23:44,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2024-10-11 11:23:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:44,710 INFO L225 Difference]: With dead ends: 155 [2024-10-11 11:23:44,710 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 11:23:44,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:23:44,715 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:44,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 11:23:44,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 11:23:44,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-10-11 11:23:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 11:23:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 122 transitions. [2024-10-11 11:23:44,749 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 122 transitions. Word has length 171 [2024-10-11 11:23:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:44,750 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 122 transitions. [2024-10-11 11:23:44,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-11 11:23:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 122 transitions. [2024-10-11 11:23:44,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 11:23:44,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:44,753 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:44,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:23:44,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:23:44,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:44,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:44,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1604097570, now seen corresponding path program 1 times [2024-10-11 11:23:44,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:23:44,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792817121] [2024-10-11 11:23:44,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:44,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:23:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:23:44,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:23:44,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:23:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:45,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:23:45,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:45,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 11:23:45,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:23:45,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:23:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792817121] [2024-10-11 11:23:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792817121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:23:45,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:23:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:23:45,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251422394] [2024-10-11 11:23:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:23:45,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:23:45,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:23:45,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:23:45,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:23:45,913 INFO L87 Difference]: Start difference. First operand 77 states and 122 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:48,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:50,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:50,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:50,653 INFO L93 Difference]: Finished difference Result 278 states and 441 transitions. [2024-10-11 11:23:50,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:23:50,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-11 11:23:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:50,697 INFO L225 Difference]: With dead ends: 278 [2024-10-11 11:23:50,697 INFO L226 Difference]: Without dead ends: 202 [2024-10-11 11:23:50,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 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-11 11:23:50,699 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 176 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:50,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 343 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 11:23:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-10-11 11:23:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 149. [2024-10-11 11:23:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 92 states have (on average 1.3695652173913044) internal successors, (126), 92 states have internal predecessors, (126), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 11:23:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 234 transitions. [2024-10-11 11:23:50,739 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 234 transitions. Word has length 171 [2024-10-11 11:23:50,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:50,740 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 234 transitions. [2024-10-11 11:23:50,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:50,741 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 234 transitions. [2024-10-11 11:23:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 11:23:50,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:50,743 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:50,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 11:23:50,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:23:50,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:50,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:50,945 INFO L85 PathProgramCache]: Analyzing trace with hash 696725020, now seen corresponding path program 1 times [2024-10-11 11:23:50,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:23:50,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743443922] [2024-10-11 11:23:50,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:50,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:23:50,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:23:50,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:23:50,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 11:23:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:51,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 11:23:51,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:51,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-10-11 11:23:51,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:23:51,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:23:51,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743443922] [2024-10-11 11:23:51,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743443922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:23:51,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:23:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:23:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027369275] [2024-10-11 11:23:51,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:23:51,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:23:51,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:23:51,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:23:51,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:23:51,482 INFO L87 Difference]: Start difference. First operand 149 states and 234 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:54,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:23:55,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:23:55,029 INFO L93 Difference]: Finished difference Result 331 states and 515 transitions. [2024-10-11 11:23:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:23:55,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-10-11 11:23:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:23:55,032 INFO L225 Difference]: With dead ends: 331 [2024-10-11 11:23:55,032 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 11:23:55,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:23:55,033 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 59 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:23:55,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 363 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 11:23:55,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 11:23:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2024-10-11 11:23:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 108 states have internal predecessors, (139), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 11:23:55,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 279 transitions. [2024-10-11 11:23:55,059 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 279 transitions. Word has length 171 [2024-10-11 11:23:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:23:55,060 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 279 transitions. [2024-10-11 11:23:55,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-10-11 11:23:55,060 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 279 transitions. [2024-10-11 11:23:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 11:23:55,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:23:55,062 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:23:55,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:23:55,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:23:55,263 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:23:55,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:23:55,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1771369862, now seen corresponding path program 1 times [2024-10-11 11:23:55,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:23:55,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328985649] [2024-10-11 11:23:55,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:23:55,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:23:55,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:23:55,269 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:23:55,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 11:23:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:23:55,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 11:23:55,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:23:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 647 proven. 27 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2024-10-11 11:23:59,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:24:02,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:24:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328985649] [2024-10-11 11:24:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328985649] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:24:02,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [297411092] [2024-10-11 11:24:02,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:24:02,062 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 11:24:02,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 11:24:02,064 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 11:24:02,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-11 11:24:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:24:04,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-11 11:24:04,418 INFO L278 TraceCheckSpWp]: Computing forward predicates...