./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:35:38,464 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:35:38,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 22:35:38,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:35:38,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:35:38,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:35:38,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:35:38,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:35:38,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:35:38,594 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:35:38,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:35:38,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:35:38,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:35:38,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:35:38,599 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:35:38,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:35:38,599 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:35:38,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:35:38,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 22:35:38,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:35:38,604 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:35:38,604 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:35:38,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:35:38,605 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:35:38,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:35:38,605 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:35:38,606 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:35:38,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:35:38,606 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:35:38,606 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:35:38,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:35:38,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:35:38,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:35:38,607 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:35:38,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:35:38,608 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:35:38,608 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 22:35:38,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 22:35:38,609 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:35:38,609 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:35:38,609 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:35:38,611 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:35:38,611 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 [2024-11-18 22:35:38,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:35:38,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:35:38,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:35:38,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:35:38,940 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:35:38,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2024-11-18 22:35:40,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 22:35:40,711 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 22:35:40,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2024-11-18 22:35:40,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82827e28/13df6f1f0d3b4cc0bcae11403b6c9631/FLAG500e0639d [2024-11-18 22:35:40,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c82827e28/13df6f1f0d3b4cc0bcae11403b6c9631 [2024-11-18 22:35:40,742 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 22:35:40,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 22:35:40,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 22:35:40,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 22:35:40,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 22:35:40,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:35:40" (1/1) ... [2024-11-18 22:35:40,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50cac157 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:40, skipping insertion in model container [2024-11-18 22:35:40,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:35:40" (1/1) ... [2024-11-18 22:35:40,787 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 22:35:40,959 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i[916,929] [2024-11-18 22:35:41,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:35:41,084 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 22:35:41,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i[916,929] [2024-11-18 22:35:41,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 22:35:41,172 INFO L204 MainTranslator]: Completed translation [2024-11-18 22:35:41,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41 WrapperNode [2024-11-18 22:35:41,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 22:35:41,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 22:35:41,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 22:35:41,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 22:35:41,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,272 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2024-11-18 22:35:41,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 22:35:41,274 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 22:35:41,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 22:35:41,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 22:35:41,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,293 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,327 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 22:35:41,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,356 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,365 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 22:35:41,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 22:35:41,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 22:35:41,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 22:35:41,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (1/1) ... [2024-11-18 22:35:41,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:35:41,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:35:41,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 22:35:41,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 22:35:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 22:35:41,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 22:35:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 22:35:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 22:35:41,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 22:35:41,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 22:35:41,642 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 22:35:41,645 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 22:35:42,329 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-18 22:35:42,330 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 22:35:42,346 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 22:35:42,346 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 22:35:42,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:35:42 BoogieIcfgContainer [2024-11-18 22:35:42,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 22:35:42,350 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 22:35:42,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 22:35:42,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 22:35:42,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:35:40" (1/3) ... [2024-11-18 22:35:42,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bc7737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:35:42, skipping insertion in model container [2024-11-18 22:35:42,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:35:41" (2/3) ... [2024-11-18 22:35:42,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bc7737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:35:42, skipping insertion in model container [2024-11-18 22:35:42,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:35:42" (3/3) ... [2024-11-18 22:35:42,359 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-59.i [2024-11-18 22:35:42,378 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 22:35:42,379 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 22:35:42,460 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 22:35:42,468 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;@672f5cb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 22:35:42,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 22:35:42,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 87 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 22:35:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-18 22:35:42,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:42,489 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:42,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:42,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:42,495 INFO L85 PathProgramCache]: Analyzing trace with hash 486698185, now seen corresponding path program 1 times [2024-11-18 22:35:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:42,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416066453] [2024-11-18 22:35:42,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:42,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-18 22:35:42,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:42,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416066453] [2024-11-18 22:35:42,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416066453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:35:42,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104426989] [2024-11-18 22:35:42,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:42,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:35:42,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:35:42,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:35:42,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 22:35:43,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:43,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 22:35:43,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:35:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-18 22:35:43,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:35:43,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104426989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:43,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:35:43,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 22:35:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699572221] [2024-11-18 22:35:43,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:43,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 22:35:43,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:43,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 22:35:43,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:35:43,181 INFO L87 Difference]: Start difference. First operand has 110 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 87 states have internal predecessors, (131), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 22:35:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:43,213 INFO L93 Difference]: Finished difference Result 213 states and 361 transitions. [2024-11-18 22:35:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 22:35:43,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 148 [2024-11-18 22:35:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:43,222 INFO L225 Difference]: With dead ends: 213 [2024-11-18 22:35:43,222 INFO L226 Difference]: Without dead ends: 106 [2024-11-18 22:35:43,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 22:35:43,228 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:43,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:35:43,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-18 22:35:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-18 22:35:43,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-18 22:35:43,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 165 transitions. [2024-11-18 22:35:43,275 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 165 transitions. Word has length 148 [2024-11-18 22:35:43,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:43,275 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 165 transitions. [2024-11-18 22:35:43,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-18 22:35:43,276 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 165 transitions. [2024-11-18 22:35:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-18 22:35:43,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:43,279 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:43,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-18 22:35:43,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 22:35:43,481 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:43,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:43,481 INFO L85 PathProgramCache]: Analyzing trace with hash -171562737, now seen corresponding path program 1 times [2024-11-18 22:35:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:43,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843450185] [2024-11-18 22:35:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:43,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 22:35:43,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:43,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843450185] [2024-11-18 22:35:43,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843450185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:43,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:35:43,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:35:43,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849028339] [2024-11-18 22:35:43,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:43,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:35:43,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:43,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:35:43,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:35:43,802 INFO L87 Difference]: Start difference. First operand 106 states and 165 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:43,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:43,906 INFO L93 Difference]: Finished difference Result 309 states and 483 transitions. [2024-11-18 22:35:43,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:35:43,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 148 [2024-11-18 22:35:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:43,911 INFO L225 Difference]: With dead ends: 309 [2024-11-18 22:35:43,911 INFO L226 Difference]: Without dead ends: 206 [2024-11-18 22:35:43,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:35:43,913 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 144 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:43,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 295 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:35:43,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-18 22:35:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2024-11-18 22:35:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.440251572327044) internal successors, (229), 159 states have internal predecessors, (229), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 22:35:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2024-11-18 22:35:43,973 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 148 [2024-11-18 22:35:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:43,973 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2024-11-18 22:35:43,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2024-11-18 22:35:43,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-18 22:35:43,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:43,979 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:43,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 22:35:43,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:43,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:43,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1105003005, now seen corresponding path program 1 times [2024-11-18 22:35:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729308406] [2024-11-18 22:35:43,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:43,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 22:35:44,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729308406] [2024-11-18 22:35:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729308406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:44,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:35:44,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:35:44,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450472773] [2024-11-18 22:35:44,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:44,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:35:44,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:44,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:35:44,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:35:44,323 INFO L87 Difference]: Start difference. First operand 204 states and 313 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:44,403 INFO L93 Difference]: Finished difference Result 405 states and 623 transitions. [2024-11-18 22:35:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:35:44,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2024-11-18 22:35:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:44,407 INFO L225 Difference]: With dead ends: 405 [2024-11-18 22:35:44,407 INFO L226 Difference]: Without dead ends: 204 [2024-11-18 22:35:44,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:35:44,414 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:44,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:35:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-18 22:35:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-18 22:35:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.4276729559748427) internal successors, (227), 159 states have internal predecessors, (227), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 22:35:44,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 311 transitions. [2024-11-18 22:35:44,440 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 311 transitions. Word has length 149 [2024-11-18 22:35:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:44,440 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 311 transitions. [2024-11-18 22:35:44,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 311 transitions. [2024-11-18 22:35:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 22:35:44,443 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:44,443 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:44,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 22:35:44,443 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:44,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:44,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1145991477, now seen corresponding path program 1 times [2024-11-18 22:35:44,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:44,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449038387] [2024-11-18 22:35:44,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:44,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 22:35:44,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:44,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449038387] [2024-11-18 22:35:44,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449038387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:44,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:35:44,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 22:35:44,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106985053] [2024-11-18 22:35:44,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 22:35:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:44,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 22:35:44,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:35:44,862 INFO L87 Difference]: Start difference. First operand 204 states and 311 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:45,226 INFO L93 Difference]: Finished difference Result 517 states and 788 transitions. [2024-11-18 22:35:45,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 22:35:45,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2024-11-18 22:35:45,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:45,230 INFO L225 Difference]: With dead ends: 517 [2024-11-18 22:35:45,230 INFO L226 Difference]: Without dead ends: 316 [2024-11-18 22:35:45,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:35:45,232 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 111 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:45,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 508 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:35:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-18 22:35:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2024-11-18 22:35:45,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 246 states have (on average 1.4146341463414633) internal successors, (348), 246 states have internal predecessors, (348), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-18 22:35:45,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 474 transitions. [2024-11-18 22:35:45,266 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 474 transitions. Word has length 150 [2024-11-18 22:35:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:45,266 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 474 transitions. [2024-11-18 22:35:45,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 474 transitions. [2024-11-18 22:35:45,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 22:35:45,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:45,276 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:45,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 22:35:45,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:45,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:45,277 INFO L85 PathProgramCache]: Analyzing trace with hash -2079981786, now seen corresponding path program 1 times [2024-11-18 22:35:45,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:45,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468832955] [2024-11-18 22:35:45,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:45,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 22:35:45,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468832955] [2024-11-18 22:35:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468832955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:35:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:35:45,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360795614] [2024-11-18 22:35:45,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:45,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:35:45,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:45,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:35:45,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:35:45,576 INFO L87 Difference]: Start difference. First operand 313 states and 474 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:45,612 INFO L93 Difference]: Finished difference Result 629 states and 954 transitions. [2024-11-18 22:35:45,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:35:45,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2024-11-18 22:35:45,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:45,618 INFO L225 Difference]: With dead ends: 629 [2024-11-18 22:35:45,619 INFO L226 Difference]: Without dead ends: 319 [2024-11-18 22:35:45,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:35:45,623 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:45,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 22:35:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-18 22:35:45,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-11-18 22:35:45,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 252 states have (on average 1.4047619047619047) internal successors, (354), 252 states have internal predecessors, (354), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-18 22:35:45,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 480 transitions. [2024-11-18 22:35:45,659 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 480 transitions. Word has length 150 [2024-11-18 22:35:45,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:45,661 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 480 transitions. [2024-11-18 22:35:45,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 480 transitions. [2024-11-18 22:35:45,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 22:35:45,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:45,664 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:45,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 22:35:45,664 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:45,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1399923416, now seen corresponding path program 1 times [2024-11-18 22:35:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745713192] [2024-11-18 22:35:45,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:45,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 22:35:46,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:46,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745713192] [2024-11-18 22:35:46,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745713192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:46,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:35:46,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:35:46,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400978711] [2024-11-18 22:35:46,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:46,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:35:46,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:46,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:35:46,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:35:46,652 INFO L87 Difference]: Start difference. First operand 319 states and 480 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:47,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:47,018 INFO L93 Difference]: Finished difference Result 834 states and 1254 transitions. [2024-11-18 22:35:47,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:35:47,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2024-11-18 22:35:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:47,025 INFO L225 Difference]: With dead ends: 834 [2024-11-18 22:35:47,025 INFO L226 Difference]: Without dead ends: 518 [2024-11-18 22:35:47,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:35:47,028 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 79 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:47,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 323 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:35:47,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-11-18 22:35:47,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 441. [2024-11-18 22:35:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 374 states have (on average 1.4438502673796791) internal successors, (540), 374 states have internal predecessors, (540), 63 states have call successors, (63), 3 states have call predecessors, (63), 3 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-18 22:35:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 666 transitions. [2024-11-18 22:35:47,065 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 666 transitions. Word has length 150 [2024-11-18 22:35:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:47,067 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 666 transitions. [2024-11-18 22:35:47,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 666 transitions. [2024-11-18 22:35:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-18 22:35:47,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:47,070 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:47,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 22:35:47,070 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:47,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:47,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1909396506, now seen corresponding path program 1 times [2024-11-18 22:35:47,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:47,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340545396] [2024-11-18 22:35:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:47,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 22:35:47,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:47,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340545396] [2024-11-18 22:35:47,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340545396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:47,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:35:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:35:47,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312879287] [2024-11-18 22:35:47,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:47,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:35:47,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:47,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:35:47,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:35:47,286 INFO L87 Difference]: Start difference. First operand 441 states and 666 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:47,492 INFO L93 Difference]: Finished difference Result 1371 states and 2059 transitions. [2024-11-18 22:35:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:35:47,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2024-11-18 22:35:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:47,499 INFO L225 Difference]: With dead ends: 1371 [2024-11-18 22:35:47,499 INFO L226 Difference]: Without dead ends: 933 [2024-11-18 22:35:47,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:35:47,502 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 218 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:47,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 548 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:35:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2024-11-18 22:35:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 755. [2024-11-18 22:35:47,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 622 states have (on average 1.4212218649517685) internal successors, (884), 622 states have internal predecessors, (884), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2024-11-18 22:35:47,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1136 transitions. [2024-11-18 22:35:47,599 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1136 transitions. Word has length 150 [2024-11-18 22:35:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:47,599 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1136 transitions. [2024-11-18 22:35:47,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1136 transitions. [2024-11-18 22:35:47,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-18 22:35:47,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:47,602 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:47,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 22:35:47,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:47,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -397658682, now seen corresponding path program 1 times [2024-11-18 22:35:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:47,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292048257] [2024-11-18 22:35:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:50,104 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 22:35:50,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:50,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292048257] [2024-11-18 22:35:50,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292048257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:35:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257445915] [2024-11-18 22:35:50,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:50,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:35:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:35:50,108 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:35:50,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 22:35:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:50,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 22:35:50,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:35:50,362 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 22:35:50,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 22:35:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257445915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:50,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 22:35:50,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 17 [2024-11-18 22:35:50,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860845494] [2024-11-18 22:35:50,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:50,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 22:35:50,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:50,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 22:35:50,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-18 22:35:50,367 INFO L87 Difference]: Start difference. First operand 755 states and 1136 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:50,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:50,645 INFO L93 Difference]: Finished difference Result 1027 states and 1521 transitions. [2024-11-18 22:35:50,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 22:35:50,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2024-11-18 22:35:50,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:50,649 INFO L225 Difference]: With dead ends: 1027 [2024-11-18 22:35:50,649 INFO L226 Difference]: Without dead ends: 275 [2024-11-18 22:35:50,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-11-18 22:35:50,652 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 225 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:50,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 317 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 22:35:50,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-18 22:35:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2024-11-18 22:35:50,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 217 states have (on average 1.336405529953917) internal successors, (290), 217 states have internal predecessors, (290), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 22:35:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 374 transitions. [2024-11-18 22:35:50,677 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 374 transitions. Word has length 155 [2024-11-18 22:35:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:50,677 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 374 transitions. [2024-11-18 22:35:50,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 374 transitions. [2024-11-18 22:35:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-18 22:35:50,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:50,679 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:50,698 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-18 22:35:50,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-18 22:35:50,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:50,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:50,885 INFO L85 PathProgramCache]: Analyzing trace with hash -51109779, now seen corresponding path program 1 times [2024-11-18 22:35:50,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:50,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392493339] [2024-11-18 22:35:50,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 22:35:50,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:50,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392493339] [2024-11-18 22:35:50,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392493339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:50,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:35:50,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 22:35:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964293903] [2024-11-18 22:35:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:50,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 22:35:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 22:35:50,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:35:50,977 INFO L87 Difference]: Start difference. First operand 264 states and 374 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:51,135 INFO L93 Difference]: Finished difference Result 736 states and 1051 transitions. [2024-11-18 22:35:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 22:35:51,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2024-11-18 22:35:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:51,138 INFO L225 Difference]: With dead ends: 736 [2024-11-18 22:35:51,138 INFO L226 Difference]: Without dead ends: 475 [2024-11-18 22:35:51,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 22:35:51,140 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 116 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:51,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 255 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 22:35:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-18 22:35:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 367. [2024-11-18 22:35:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 320 states have (on average 1.35) internal successors, (432), 320 states have internal predecessors, (432), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 22:35:51,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 516 transitions. [2024-11-18 22:35:51,177 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 516 transitions. Word has length 156 [2024-11-18 22:35:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:51,178 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 516 transitions. [2024-11-18 22:35:51,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 516 transitions. [2024-11-18 22:35:51,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-18 22:35:51,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:51,180 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:51,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 22:35:51,182 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:51,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:51,183 INFO L85 PathProgramCache]: Analyzing trace with hash -198130535, now seen corresponding path program 1 times [2024-11-18 22:35:51,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:51,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421818356] [2024-11-18 22:35:51,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:51,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-18 22:35:51,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:51,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421818356] [2024-11-18 22:35:51,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421818356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 22:35:51,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 22:35:51,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 22:35:51,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494958935] [2024-11-18 22:35:51,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 22:35:51,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 22:35:51,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:51,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 22:35:51,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 22:35:51,291 INFO L87 Difference]: Start difference. First operand 367 states and 516 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:35:51,623 INFO L93 Difference]: Finished difference Result 956 states and 1351 transitions. [2024-11-18 22:35:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 22:35:51,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2024-11-18 22:35:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:35:51,627 INFO L225 Difference]: With dead ends: 956 [2024-11-18 22:35:51,627 INFO L226 Difference]: Without dead ends: 592 [2024-11-18 22:35:51,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 22:35:51,629 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 112 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 22:35:51,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 489 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 22:35:51,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-18 22:35:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 436. [2024-11-18 22:35:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 389 states have (on average 1.3727506426735219) internal successors, (534), 389 states have internal predecessors, (534), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 22:35:51,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 618 transitions. [2024-11-18 22:35:51,675 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 618 transitions. Word has length 157 [2024-11-18 22:35:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:35:51,676 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 618 transitions. [2024-11-18 22:35:51,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-18 22:35:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 618 transitions. [2024-11-18 22:35:51,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-18 22:35:51,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:35:51,680 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:35:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 22:35:51,680 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:35:51,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:35:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash 360821913, now seen corresponding path program 1 times [2024-11-18 22:35:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:35:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16933920] [2024-11-18 22:35:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:35:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 22:35:55,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:35:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16933920] [2024-11-18 22:35:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16933920] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:35:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727726655] [2024-11-18 22:35:55,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:35:55,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:35:55,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:35:55,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:35:55,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 22:35:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:35:56,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-18 22:35:56,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:35:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-11-18 22:35:57,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:35:58,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727726655] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:35:58,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 22:35:58,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2024-11-18 22:35:58,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281636744] [2024-11-18 22:35:58,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 22:35:58,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-18 22:35:58,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:35:58,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-18 22:35:58,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2024-11-18 22:35:58,164 INFO L87 Difference]: Start difference. First operand 436 states and 618 transitions. Second operand has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-18 22:36:01,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:36:01,649 INFO L93 Difference]: Finished difference Result 1012 states and 1403 transitions. [2024-11-18 22:36:01,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-18 22:36:01,650 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 157 [2024-11-18 22:36:01,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:36:01,654 INFO L225 Difference]: With dead ends: 1012 [2024-11-18 22:36:01,654 INFO L226 Difference]: Without dead ends: 579 [2024-11-18 22:36:01,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=390, Invalid=1962, Unknown=0, NotChecked=0, Total=2352 [2024-11-18 22:36:01,656 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 1060 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-18 22:36:01,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 624 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-18 22:36:01,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-18 22:36:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 482. [2024-11-18 22:36:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 429 states have (on average 1.3146853146853146) internal successors, (564), 429 states have internal predecessors, (564), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 22:36:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 648 transitions. [2024-11-18 22:36:01,701 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 648 transitions. Word has length 157 [2024-11-18 22:36:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:36:01,701 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 648 transitions. [2024-11-18 22:36:01,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-18 22:36:01,702 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 648 transitions. [2024-11-18 22:36:01,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-18 22:36:01,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:36:01,703 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:36:01,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-18 22:36:01,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:36:01,904 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:36:01,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:36:01,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1851260128, now seen corresponding path program 1 times [2024-11-18 22:36:01,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:36:01,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674300041] [2024-11-18 22:36:01,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:36:01,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:36:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:36:05,680 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 22:36:05,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:36:05,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674300041] [2024-11-18 22:36:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674300041] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:36:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331778049] [2024-11-18 22:36:05,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:36:05,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:36:05,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:36:05,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:36:05,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-18 22:36:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:36:05,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 22:36:05,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:36:06,685 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2024-11-18 22:36:06,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:36:07,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331778049] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:36:07,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 22:36:07,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2024-11-18 22:36:07,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073175419] [2024-11-18 22:36:07,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 22:36:07,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-18 22:36:07,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:36:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-18 22:36:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2024-11-18 22:36:07,078 INFO L87 Difference]: Start difference. First operand 482 states and 648 transitions. Second operand has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 21 states have internal predecessors, (117), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-18 22:36:10,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:36:10,983 INFO L93 Difference]: Finished difference Result 1113 states and 1492 transitions. [2024-11-18 22:36:10,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-18 22:36:10,984 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 21 states have internal predecessors, (117), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 159 [2024-11-18 22:36:10,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:36:10,987 INFO L225 Difference]: With dead ends: 1113 [2024-11-18 22:36:10,987 INFO L226 Difference]: Without dead ends: 634 [2024-11-18 22:36:10,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=535, Invalid=3247, Unknown=0, NotChecked=0, Total=3782 [2024-11-18 22:36:10,990 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 354 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 2560 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-18 22:36:10,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 940 Invalid, 2616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2560 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-18 22:36:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-18 22:36:11,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 488. [2024-11-18 22:36:11,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 435 states have (on average 1.3333333333333333) internal successors, (580), 435 states have internal predecessors, (580), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 22:36:11,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 664 transitions. [2024-11-18 22:36:11,031 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 664 transitions. Word has length 159 [2024-11-18 22:36:11,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:36:11,031 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 664 transitions. [2024-11-18 22:36:11,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 21 states have internal predecessors, (117), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2024-11-18 22:36:11,032 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 664 transitions. [2024-11-18 22:36:11,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-18 22:36:11,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:36:11,033 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:36:11,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 22:36:11,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:36:11,234 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:36:11,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:36:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1149660254, now seen corresponding path program 1 times [2024-11-18 22:36:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:36:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795496560] [2024-11-18 22:36:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:36:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:36:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:36:15,721 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 22:36:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:36:15,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795496560] [2024-11-18 22:36:15,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795496560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:36:15,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213209474] [2024-11-18 22:36:15,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:36:15,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:36:15,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:36:15,723 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:36:15,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 22:36:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:36:15,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-18 22:36:15,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:36:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 533 proven. 198 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-18 22:36:22,237 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:36:29,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213209474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:36:29,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 22:36:29,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 33] total 42 [2024-11-18 22:36:29,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159523847] [2024-11-18 22:36:29,709 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 22:36:29,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-18 22:36:29,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:36:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-18 22:36:29,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=3174, Unknown=0, NotChecked=0, Total=3906 [2024-11-18 22:36:29,711 INFO L87 Difference]: Start difference. First operand 488 states and 664 transitions. Second operand has 42 states, 42 states have (on average 3.261904761904762) internal successors, (137), 40 states have internal predecessors, (137), 8 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) [2024-11-18 22:36:33,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:36:33,970 INFO L93 Difference]: Finished difference Result 1097 states and 1457 transitions. [2024-11-18 22:36:33,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-18 22:36:33,970 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 3.261904761904762) internal successors, (137), 40 states have internal predecessors, (137), 8 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) Word has length 159 [2024-11-18 22:36:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:36:33,973 INFO L225 Difference]: With dead ends: 1097 [2024-11-18 22:36:33,973 INFO L226 Difference]: Without dead ends: 668 [2024-11-18 22:36:33,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1875 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1367, Invalid=5113, Unknown=0, NotChecked=0, Total=6480 [2024-11-18 22:36:33,977 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 690 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-18 22:36:33,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 751 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2147 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-18 22:36:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-18 22:36:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 584. [2024-11-18 22:36:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 523 states have (on average 1.311663479923518) internal successors, (686), 523 states have internal predecessors, (686), 42 states have call successors, (42), 18 states have call predecessors, (42), 18 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-18 22:36:34,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 770 transitions. [2024-11-18 22:36:34,024 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 770 transitions. Word has length 159 [2024-11-18 22:36:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:36:34,025 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 770 transitions. [2024-11-18 22:36:34,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.261904761904762) internal successors, (137), 40 states have internal predecessors, (137), 8 states have call successors, (41), 8 states have call predecessors, (41), 13 states have return successors, (42), 8 states have call predecessors, (42), 8 states have call successors, (42) [2024-11-18 22:36:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 770 transitions. [2024-11-18 22:36:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-18 22:36:34,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:36:34,027 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:36:34,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 22:36:34,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-18 22:36:34,228 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:36:34,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:36:34,229 INFO L85 PathProgramCache]: Analyzing trace with hash -539283488, now seen corresponding path program 1 times [2024-11-18 22:36:34,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:36:34,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586048812] [2024-11-18 22:36:34,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:36:34,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:36:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:36:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 22:36:36,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 22:36:36,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586048812] [2024-11-18 22:36:36,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586048812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 22:36:36,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307239989] [2024-11-18 22:36:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:36:36,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:36:36,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:36:36,656 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:36:36,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 22:36:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 22:36:36,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-18 22:36:36,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 22:36:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-18 22:36:39,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 22:36:43,877 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-18 22:36:43,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307239989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 22:36:43,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 22:36:43,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 36 [2024-11-18 22:36:43,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122895970] [2024-11-18 22:36:43,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 22:36:43,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-18 22:36:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 22:36:43,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-18 22:36:43,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1038, Unknown=0, NotChecked=0, Total=1260 [2024-11-18 22:36:43,880 INFO L87 Difference]: Start difference. First operand 584 states and 770 transitions. Second operand has 36 states, 36 states have (on average 4.666666666666667) internal successors, (168), 36 states have internal predecessors, (168), 5 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 5 states have call successors, (63) [2024-11-18 22:36:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 22:36:49,803 INFO L93 Difference]: Finished difference Result 2010 states and 2657 transitions. [2024-11-18 22:36:49,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-11-18 22:36:49,803 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.666666666666667) internal successors, (168), 36 states have internal predecessors, (168), 5 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 5 states have call successors, (63) Word has length 159 [2024-11-18 22:36:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 22:36:49,809 INFO L225 Difference]: With dead ends: 2010 [2024-11-18 22:36:49,809 INFO L226 Difference]: Without dead ends: 1501 [2024-11-18 22:36:49,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=812, Invalid=4590, Unknown=0, NotChecked=0, Total=5402 [2024-11-18 22:36:49,812 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 1666 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 3049 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 3134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-18 22:36:49,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 969 Invalid, 3134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3049 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-18 22:36:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-18 22:36:49,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 943. [2024-11-18 22:36:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 852 states have (on average 1.3039906103286385) internal successors, (1111), 852 states have internal predecessors, (1111), 63 states have call successors, (63), 27 states have call predecessors, (63), 27 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-18 22:36:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1237 transitions. [2024-11-18 22:36:49,892 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1237 transitions. Word has length 159 [2024-11-18 22:36:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 22:36:49,892 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1237 transitions. [2024-11-18 22:36:49,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.666666666666667) internal successors, (168), 36 states have internal predecessors, (168), 5 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 5 states have call successors, (63) [2024-11-18 22:36:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1237 transitions. [2024-11-18 22:36:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-18 22:36:49,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 22:36:49,895 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:36:49,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-18 22:36:50,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:36:50,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 22:36:50,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 22:36:50,097 INFO L85 PathProgramCache]: Analyzing trace with hash -418378049, now seen corresponding path program 1 times [2024-11-18 22:36:50,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 22:36:50,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640017682] [2024-11-18 22:36:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:36:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 22:36:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 22:36:50,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557378641] [2024-11-18 22:36:50,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 22:36:50,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:36:50,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 22:36:50,231 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 22:36:50,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 22:36:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:36:50,441 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 22:36:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 22:36:50,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 22:36:50,626 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 22:36:50,627 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 22:36:50,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 22:36:50,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 22:36:50,833 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 22:36:50,951 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 22:36:50,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:36:50 BoogieIcfgContainer [2024-11-18 22:36:50,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 22:36:50,954 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 22:36:50,954 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 22:36:50,955 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 22:36:50,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:35:42" (3/4) ... [2024-11-18 22:36:50,957 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 22:36:50,958 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 22:36:50,959 INFO L158 Benchmark]: Toolchain (without parser) took 70215.49ms. Allocated memory was 159.4MB in the beginning and 843.1MB in the end (delta: 683.7MB). Free memory was 103.5MB in the beginning and 403.4MB in the end (delta: -299.9MB). Peak memory consumption was 384.2MB. Max. memory is 16.1GB. [2024-11-18 22:36:50,959 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 159.4MB. Free memory was 117.8MB in the beginning and 117.7MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:36:50,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 428.60ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 84.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-18 22:36:50,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.75ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 76.8MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 22:36:50,960 INFO L158 Benchmark]: Boogie Preprocessor took 116.69ms. Allocated memory is still 159.4MB. Free memory was 76.8MB in the beginning and 66.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 22:36:50,960 INFO L158 Benchmark]: RCFGBuilder took 955.27ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 66.3MB in the beginning and 156.8MB in the end (delta: -90.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-18 22:36:50,961 INFO L158 Benchmark]: TraceAbstraction took 68603.92ms. Allocated memory was 228.6MB in the beginning and 843.1MB in the end (delta: 614.5MB). Free memory was 155.7MB in the beginning and 403.4MB in the end (delta: -247.7MB). Peak memory consumption was 365.8MB. Max. memory is 16.1GB. [2024-11-18 22:36:50,961 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 843.1MB. Free memory is still 403.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 22:36:50,965 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.20ms. Allocated memory is still 159.4MB. Free memory was 117.8MB in the beginning and 117.7MB in the end (delta: 176.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 428.60ms. Allocated memory is still 159.4MB. Free memory was 103.1MB in the beginning and 84.7MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.75ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 76.8MB in the end (delta: 7.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 116.69ms. Allocated memory is still 159.4MB. Free memory was 76.8MB in the beginning and 66.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 955.27ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 66.3MB in the beginning and 156.8MB in the end (delta: -90.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 68603.92ms. Allocated memory was 228.6MB in the beginning and 843.1MB in the end (delta: 614.5MB). Free memory was 155.7MB in the beginning and 403.4MB in the end (delta: -247.7MB). Peak memory consumption was 365.8MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 843.1MB. Free memory is still 403.4MB. 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 someBinaryDOUBLEComparisonOperation at line 167, overapproximation of shiftRight at line 167. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 50; [L23] unsigned char var_1_5 = 200; [L24] unsigned char var_1_6 = 64; [L25] signed short int var_1_7 = -2; [L26] signed long int var_1_8 = 16; [L27] unsigned char var_1_11 = 1; [L28] signed char var_1_12 = 8; [L29] signed char var_1_13 = 0; [L30] signed char var_1_14 = 10; [L31] signed char var_1_15 = 8; [L32] unsigned char var_1_16 = 5; [L33] unsigned char var_1_17 = 100; [L34] unsigned char var_1_18 = 25; [L35] unsigned char var_1_19 = 0; [L36] signed short int var_1_20 = -128; [L37] signed short int var_1_21 = -8; [L38] double var_1_22 = 100000000000.35; [L39] double var_1_23 = 199.4; [L40] double var_1_24 = 63.5; [L41] signed short int var_1_25 = 1; [L42] unsigned char var_1_27 = 1; [L43] unsigned char var_1_28 = 0; [L44] signed short int var_1_29 = -8; [L45] signed long int last_1_var_1_8 = 16; [L46] unsigned char last_1_var_1_16 = 5; VAL [isInitial=0, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L171] isInitial = 1 [L172] FCALL initially() [L173] COND TRUE 1 [L174] CALL updateLastVariables() [L163] last_1_var_1_8 = var_1_8 [L164] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L174] RET updateLastVariables() [L175] CALL updateVariables() [L128] var_1_5 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_5 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=64, var_1_7=-2, var_1_8=16] [L129] RET assume_abort_if_not(var_1_5 >= 190) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=64, var_1_7=-2, var_1_8=16] [L131] var_1_6 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_7=-2, var_1_8=16] [L132] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_7=-2, var_1_8=16] [L133] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L133] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L134] var_1_13 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L135] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L136] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L136] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L137] var_1_14 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L138] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L139] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L139] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L140] var_1_15 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L141] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L142] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L142] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L143] var_1_17 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_17 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L144] RET assume_abort_if_not(var_1_17 >= 95) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L145] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L145] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L146] var_1_18 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L147] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L148] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L148] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L149] var_1_19 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L150] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L151] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L151] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L152] var_1_22 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L153] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L154] var_1_23 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L155] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L156] var_1_24 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L157] RET assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L158] var_1_28 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L159] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L160] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L160] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L175] RET updateVariables() [L176] CALL step() [L50] COND TRUE (last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16 [L51] var_1_1 = ((var_1_5 - 2) - var_1_6) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L55] COND TRUE 100.5f < var_1_22 [L56] var_1_27 = (! var_1_28) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L58] COND TRUE var_1_27 || var_1_27 [L59] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L61] signed long int stepLocal_5 = 2; [L62] unsigned char stepLocal_4 = var_1_5; [L63] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_4=-2, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L64] COND FALSE !(stepLocal_4 <= var_1_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L67] COND TRUE stepLocal_3 || var_1_27 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=16] [L68] COND TRUE stepLocal_5 < var_1_1 [L69] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L73] COND FALSE !(! var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L80] signed long int stepLocal_2 = ~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))); VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-253, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L81] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-253, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L81] signed long int stepLocal_1 = var_1_11 >> var_1_1; [L82] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, stepLocal_1=0, stepLocal_2=-253, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L83] COND TRUE var_1_5 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, stepLocal_1=0, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L84] COND FALSE !(var_1_1 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L94] COND TRUE (var_1_22 * -0.625) < (var_1_23 * var_1_24) [L95] var_1_21 = ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L101] COND FALSE !(var_1_7 > var_1_5) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L106] COND TRUE \read(var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L107] COND FALSE !(var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=5, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L117] COND TRUE var_1_15 > var_1_25 [L118] var_1_16 = (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L120] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L120] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=-128, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L120] signed long int stepLocal_6 = (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))); [L121] COND FALSE !(stepLocal_6 > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) [L124] var_1_20 = ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=252, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L176] RET step() [L177] CALL, EXPR property() [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167] EXPR (var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L167-L168] return ((((((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16))))) && (((var_1_22 * -0.625) < (var_1_23 * var_1_24)) ? (var_1_21 == ((signed short int) ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))))) : (var_1_27 ? (var_1_21 == ((signed short int) (((((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) > ((var_1_13 + var_1_6))) ? ((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) : ((var_1_13 + var_1_6)))))) : 1))) && (var_1_27 ? ((var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) ? (var_1_27 ? (var_1_25 == ((signed short int) var_1_17)) : (var_1_25 == ((signed short int) var_1_18))) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((100.5f < var_1_22) ? (var_1_27 == ((unsigned char) (! var_1_28))) : 1)) && ((var_1_7 > var_1_5) ? (((var_1_21 <= var_1_6) || (var_1_27 || var_1_27)) ? (var_1_29 == ((signed short int) var_1_17)) : 1) : 1) ; [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=63, var_1_16=252, var_1_17=353, var_1_18=-224, var_1_19=-193, var_1_1=252, var_1_20=258, var_1_21=0, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=-2, var_1_6=256, var_1_7=-2, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.4s, OverallIterations: 15, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4803 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4777 mSDsluCounter, 6949 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4856 mSDsCounter, 350 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10888 IncrementalHoareTripleChecker+Invalid, 11238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 350 mSolverCounterUnsat, 2093 mSDtfsCounter, 10888 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1714 GetRequests, 1416 SyntacticMatches, 1 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5063 ImplicationChecksByTransitivity, 18.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=943occurred in iteration=14, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 1420 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 43.9s InterpolantComputationTime, 3408 NumberOfCodeBlocks, 3408 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3222 ConstructedInterpolants, 0 QuantifiedInterpolants, 43075 SizeOfPredicates, 42 NumberOfNonLiveVariables, 2173 ConjunctsInSsa, 128 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 16694/17640 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 22:36:51,184 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-18 22:36:51,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 22:36:53,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 22:36:53,279 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 22:36:53,284 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 22:36:53,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 22:36:53,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 22:36:53,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 22:36:53,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 22:36:53,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 22:36:53,312 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 22:36:53,313 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 22:36:53,313 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 22:36:53,313 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 22:36:53,314 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 22:36:53,314 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 22:36:53,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 22:36:53,315 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 22:36:53,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 22:36:53,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 22:36:53,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 22:36:53,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 22:36:53,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 22:36:53,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 22:36:53,318 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 22:36:53,318 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 22:36:53,319 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 22:36:53,319 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 22:36:53,319 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 22:36:53,320 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 22:36:53,320 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 22:36:53,320 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 22:36:53,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 22:36:53,321 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 22:36:53,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 22:36:53,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 22:36:53,322 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 22:36:53,322 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 22:36:53,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 22:36:53,323 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 22:36:53,323 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 22:36:53,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 22:36:53,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 22:36:53,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 22:36:53,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 22:36:53,325 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 [2024-11-18 22:36:53,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 22:36:53,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 22:36:53,664 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 22:36:53,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 22:36:53,666 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 22:36:53,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2024-11-18 22:36:55,155 INFO L533 CDTParser]: Created temporary CDT project at NULL