/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-51.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 05:38:04,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 05:38:04,567 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 05:38:04,571 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 05:38:04,572 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 05:38:04,599 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 05:38:04,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 05:38:04,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 05:38:04,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 05:38:04,604 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 05:38:04,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 05:38:04,605 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 05:38:04,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 05:38:04,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 05:38:04,606 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 05:38:04,606 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 05:38:04,606 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 05:38:04,608 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 05:38:04,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 05:38:04,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 05:38:04,609 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 05:38:04,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 05:38:04,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 05:38:04,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 05:38:04,609 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 05:38:04,610 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 05:38:04,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 05:38:04,610 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 05:38:04,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 05:38:04,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 05:38:04,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 05:38:04,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 05:38:04,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 05:38:04,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 05:38:04,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 05:38:04,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 05:38:04,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 05:38:04,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 05:38:04,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 05:38:04,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 05:38:04,614 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 05:38:04,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 05:38:04,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 05:38:04,615 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: Use bitabs translation -> true [2023-12-19 05:38:04,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 05:38:04,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 05:38:04,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 05:38:04,899 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 05:38:04,900 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 05:38:04,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-51.i [2023-12-19 05:38:06,152 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 05:38:06,381 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 05:38:06,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-51.i [2023-12-19 05:38:06,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d667439/314e551eb7ed40eb80171cdc118b8a73/FLAG9064d8eac [2023-12-19 05:38:06,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86d667439/314e551eb7ed40eb80171cdc118b8a73 [2023-12-19 05:38:06,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 05:38:06,405 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 05:38:06,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 05:38:06,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 05:38:06,410 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 05:38:06,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403eb899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06, skipping insertion in model container [2023-12-19 05:38:06,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,446 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 05:38:06,583 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-51.i[919,932] [2023-12-19 05:38:06,635 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 05:38:06,653 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 05:38:06,662 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-51.i[919,932] [2023-12-19 05:38:06,688 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 05:38:06,705 INFO L206 MainTranslator]: Completed translation [2023-12-19 05:38:06,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06 WrapperNode [2023-12-19 05:38:06,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 05:38:06,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 05:38:06,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 05:38:06,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 05:38:06,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,757 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2023-12-19 05:38:06,757 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 05:38:06,758 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 05:38:06,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 05:38:06,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 05:38:06,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,791 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]. [2023-12-19 05:38:06,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 05:38:06,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 05:38:06,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 05:38:06,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 05:38:06,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (1/1) ... [2023-12-19 05:38:06,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 05:38:06,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 05:38:06,846 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) [2023-12-19 05:38:06,871 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 [2023-12-19 05:38:06,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 05:38:06,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 05:38:06,881 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 05:38:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 05:38:06,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 05:38:06,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 05:38:06,978 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 05:38:06,981 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 05:38:07,274 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 05:38:07,312 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 05:38:07,312 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 05:38:07,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:38:07 BoogieIcfgContainer [2023-12-19 05:38:07,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 05:38:07,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 05:38:07,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 05:38:07,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 05:38:07,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:38:06" (1/3) ... [2023-12-19 05:38:07,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12abd36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:38:07, skipping insertion in model container [2023-12-19 05:38:07,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:06" (2/3) ... [2023-12-19 05:38:07,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12abd36d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:38:07, skipping insertion in model container [2023-12-19 05:38:07,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:38:07" (3/3) ... [2023-12-19 05:38:07,329 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-51.i [2023-12-19 05:38:07,344 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 05:38:07,344 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 05:38:07,398 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 05:38:07,404 INFO L357 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, mHoare=true, 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;@540c66a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 05:38:07,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 05:38:07,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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) [2023-12-19 05:38:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 05:38:07,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:07,431 INFO L195 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] [2023-12-19 05:38:07,431 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:07,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1694795912, now seen corresponding path program 1 times [2023-12-19 05:38:07,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:07,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943606536] [2023-12-19 05:38:07,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 05:38:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 05:38:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 05:38:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 05:38:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 05:38:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 05:38:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:07,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 05:38:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 05:38:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 05:38:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 05:38:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 05:38:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 05:38:07,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 05:38:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 05:38:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 05:38:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-19 05:38:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 05:38:07,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 05:38:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-19 05:38:07,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:07,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943606536] [2023-12-19 05:38:07,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943606536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:07,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:07,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 05:38:07,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605378751] [2023-12-19 05:38:07,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:07,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 05:38:07,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:07,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 05:38:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 05:38:07,937 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-19 05:38:07,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:07,990 INFO L93 Difference]: Finished difference Result 113 states and 205 transitions. [2023-12-19 05:38:07,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 05:38:07,993 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 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 128 [2023-12-19 05:38:07,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:08,005 INFO L225 Difference]: With dead ends: 113 [2023-12-19 05:38:08,005 INFO L226 Difference]: Without dead ends: 56 [2023-12-19 05:38:08,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 05:38:08,015 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:08,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 05:38:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-19 05:38:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-12-19 05:38:08,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 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) [2023-12-19 05:38:08,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 87 transitions. [2023-12-19 05:38:08,074 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 87 transitions. Word has length 128 [2023-12-19 05:38:08,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:08,075 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 87 transitions. [2023-12-19 05:38:08,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2023-12-19 05:38:08,076 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 87 transitions. [2023-12-19 05:38:08,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 05:38:08,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:08,090 INFO L195 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] [2023-12-19 05:38:08,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 05:38:08,091 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:08,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:08,092 INFO L85 PathProgramCache]: Analyzing trace with hash -929478398, now seen corresponding path program 1 times [2023-12-19 05:38:08,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:08,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362977072] [2023-12-19 05:38:08,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:08,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 05:38:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 05:38:08,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 05:38:08,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 05:38:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 05:38:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 05:38:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 05:38:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 05:38:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 05:38:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 05:38:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 05:38:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 05:38:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 05:38:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 05:38:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 05:38:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-19 05:38:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 05:38:08,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 05:38:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-19 05:38:08,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:08,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362977072] [2023-12-19 05:38:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362977072] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:08,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:08,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 05:38:08,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342757590] [2023-12-19 05:38:08,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:08,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 05:38:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:08,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 05:38:08,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 05:38:08,670 INFO L87 Difference]: Start difference. First operand 56 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-12-19 05:38:08,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:08,842 INFO L93 Difference]: Finished difference Result 167 states and 260 transitions. [2023-12-19 05:38:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 05:38:08,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 128 [2023-12-19 05:38:08,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:08,845 INFO L225 Difference]: With dead ends: 167 [2023-12-19 05:38:08,845 INFO L226 Difference]: Without dead ends: 112 [2023-12-19 05:38:08,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 05:38:08,847 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 60 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:08,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 241 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 05:38:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-19 05:38:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 95. [2023-12-19 05:38:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 50 states have (on average 1.24) internal successors, (62), 50 states have internal predecessors, (62), 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) [2023-12-19 05:38:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 146 transitions. [2023-12-19 05:38:08,877 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 146 transitions. Word has length 128 [2023-12-19 05:38:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:08,880 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 146 transitions. [2023-12-19 05:38:08,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-12-19 05:38:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 146 transitions. [2023-12-19 05:38:08,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-19 05:38:08,883 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:08,884 INFO L195 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] [2023-12-19 05:38:08,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 05:38:08,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:08,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:08,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1454725883, now seen corresponding path program 1 times [2023-12-19 05:38:08,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:08,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674243498] [2023-12-19 05:38:08,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:08,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:09,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 05:38:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 05:38:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 05:38:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 05:38:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 05:38:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 05:38:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 05:38:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 05:38:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 05:38:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 05:38:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 05:38:09,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 05:38:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 05:38:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 05:38:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 05:38:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-19 05:38:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 05:38:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 05:38:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2023-12-19 05:38:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674243498] [2023-12-19 05:38:09,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674243498] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:09,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:09,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 05:38:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181348749] [2023-12-19 05:38:09,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:09,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 05:38:09,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:09,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 05:38:09,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 05:38:09,282 INFO L87 Difference]: Start difference. First operand 95 states and 146 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2023-12-19 05:38:09,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:09,437 INFO L93 Difference]: Finished difference Result 211 states and 324 transitions. [2023-12-19 05:38:09,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 05:38:09,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 129 [2023-12-19 05:38:09,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:09,444 INFO L225 Difference]: With dead ends: 211 [2023-12-19 05:38:09,444 INFO L226 Difference]: Without dead ends: 156 [2023-12-19 05:38:09,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 05:38:09,446 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 69 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:09,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 252 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 05:38:09,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-19 05:38:09,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2023-12-19 05:38:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 81 states have internal predecessors, (104), 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) [2023-12-19 05:38:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2023-12-19 05:38:09,481 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 129 [2023-12-19 05:38:09,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:09,481 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2023-12-19 05:38:09,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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) [2023-12-19 05:38:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2023-12-19 05:38:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-19 05:38:09,483 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:09,483 INFO L195 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] [2023-12-19 05:38:09,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 05:38:09,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:09,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:09,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1750276602, now seen corresponding path program 1 times [2023-12-19 05:38:09,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:09,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736588605] [2023-12-19 05:38:09,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:09,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:09,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 05:38:09,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 05:38:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 05:38:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 05:38:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 05:38:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 05:38:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:09,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:09,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 05:38:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 05:38:09,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 05:38:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 05:38:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 05:38:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 05:38:09,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 05:38:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 05:38:09,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 05:38:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-19 05:38:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 05:38:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 05:38:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-19 05:38:09,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736588605] [2023-12-19 05:38:09,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736588605] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 05:38:09,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932089448] [2023-12-19 05:38:09,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:09,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 05:38:09,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 05:38:09,878 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) [2023-12-19 05:38:09,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 05:38:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:10,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 05:38:10,027 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 05:38:10,207 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 420 proven. 36 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2023-12-19 05:38:10,207 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 05:38:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 24 proven. 36 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-19 05:38:10,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932089448] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 05:38:10,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 05:38:10,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-12-19 05:38:10,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065388409] [2023-12-19 05:38:10,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 05:38:10,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 05:38:10,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:10,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 05:38:10,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 05:38:10,410 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-12-19 05:38:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:10,591 INFO L93 Difference]: Finished difference Result 274 states and 415 transitions. [2023-12-19 05:38:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 05:38:10,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 131 [2023-12-19 05:38:10,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:10,600 INFO L225 Difference]: With dead ends: 274 [2023-12-19 05:38:10,600 INFO L226 Difference]: Without dead ends: 166 [2023-12-19 05:38:10,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-12-19 05:38:10,609 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 40 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:10,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 125 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 05:38:10,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-19 05:38:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2023-12-19 05:38:10,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 90 states have internal predecessors, (111), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-19 05:38:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 237 transitions. [2023-12-19 05:38:10,654 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 237 transitions. Word has length 131 [2023-12-19 05:38:10,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:10,656 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 237 transitions. [2023-12-19 05:38:10,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2023-12-19 05:38:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 237 transitions. [2023-12-19 05:38:10,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-19 05:38:10,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:10,660 INFO L195 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] [2023-12-19 05:38:10,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 05:38:10,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 05:38:10,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:10,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash 24730760, now seen corresponding path program 1 times [2023-12-19 05:38:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133309598] [2023-12-19 05:38:10,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:10,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 05:38:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 05:38:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 05:38:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 05:38:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 05:38:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 05:38:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-19 05:38:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-19 05:38:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-19 05:38:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-19 05:38:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-19 05:38:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 05:38:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 05:38:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 05:38:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 05:38:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-19 05:38:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 05:38:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-19 05:38:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-19 05:38:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133309598] [2023-12-19 05:38:11,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133309598] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 05:38:11,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110233986] [2023-12-19 05:38:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:11,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 05:38:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 05:38:11,289 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) [2023-12-19 05:38:11,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 05:38:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:11,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 05:38:11,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 05:38:11,481 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 200 proven. 6 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-12-19 05:38:11,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 05:38:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 54 proven. 6 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2023-12-19 05:38:11,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110233986] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 05:38:11,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 05:38:11,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2023-12-19 05:38:11,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473948388] [2023-12-19 05:38:11,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 05:38:11,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 05:38:11,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:11,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 05:38:11,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-19 05:38:11,613 INFO L87 Difference]: Start difference. First operand 160 states and 237 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-19 05:38:11,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:11,982 INFO L93 Difference]: Finished difference Result 319 states and 456 transitions. [2023-12-19 05:38:11,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 05:38:11,983 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 131 [2023-12-19 05:38:11,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:11,986 INFO L225 Difference]: With dead ends: 319 [2023-12-19 05:38:11,986 INFO L226 Difference]: Without dead ends: 260 [2023-12-19 05:38:11,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 299 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-19 05:38:11,987 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 104 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:11,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 275 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 05:38:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-12-19 05:38:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 174. [2023-12-19 05:38:12,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 101 states have (on average 1.188118811881188) internal successors, (120), 101 states have internal predecessors, (120), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-19 05:38:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 246 transitions. [2023-12-19 05:38:12,050 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 246 transitions. Word has length 131 [2023-12-19 05:38:12,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:12,051 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 246 transitions. [2023-12-19 05:38:12,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-19 05:38:12,051 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 246 transitions. [2023-12-19 05:38:12,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-19 05:38:12,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:12,053 INFO L195 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] [2023-12-19 05:38:12,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 05:38:12,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 05:38:12,260 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:12,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:12,260 INFO L85 PathProgramCache]: Analyzing trace with hash 766245201, now seen corresponding path program 1 times [2023-12-19 05:38:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747794747] [2023-12-19 05:38:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:12,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 05:38:12,323 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 05:38:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 05:38:12,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 05:38:12,447 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 05:38:12,448 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 05:38:12,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 05:38:12,452 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-19 05:38:12,456 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 05:38:12,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:38:12 BoogieIcfgContainer [2023-12-19 05:38:12,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 05:38:12,556 INFO L158 Benchmark]: Toolchain (without parser) took 6151.90ms. Allocated memory was 184.5MB in the beginning and 298.8MB in the end (delta: 114.3MB). Free memory was 137.9MB in the beginning and 252.1MB in the end (delta: -114.2MB). Peak memory consumption was 126.0MB. Max. memory is 8.0GB. [2023-12-19 05:38:12,557 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 05:38:12,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.82ms. Allocated memory is still 184.5MB. Free memory was 137.6MB in the beginning and 123.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 05:38:12,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.11ms. Allocated memory is still 184.5MB. Free memory was 123.9MB in the beginning and 121.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 05:38:12,557 INFO L158 Benchmark]: Boogie Preprocessor took 50.04ms. Allocated memory is still 184.5MB. Free memory was 121.2MB in the beginning and 117.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 05:38:12,558 INFO L158 Benchmark]: RCFGBuilder took 503.37ms. Allocated memory is still 184.5MB. Free memory was 117.7MB in the beginning and 97.4MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-19 05:38:12,558 INFO L158 Benchmark]: TraceAbstraction took 5241.31ms. Allocated memory was 184.5MB in the beginning and 298.8MB in the end (delta: 114.3MB). Free memory was 96.7MB in the beginning and 252.1MB in the end (delta: -155.4MB). Peak memory consumption was 84.0MB. Max. memory is 8.0GB. [2023-12-19 05:38:12,560 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.15ms. Allocated memory is still 184.5MB. Free memory is still 141.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.82ms. Allocated memory is still 184.5MB. Free memory was 137.6MB in the beginning and 123.9MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.11ms. Allocated memory is still 184.5MB. Free memory was 123.9MB in the beginning and 121.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.04ms. Allocated memory is still 184.5MB. Free memory was 121.2MB in the beginning and 117.7MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 503.37ms. Allocated memory is still 184.5MB. Free memory was 117.7MB in the beginning and 97.4MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5241.31ms. Allocated memory was 184.5MB in the beginning and 298.8MB in the end (delta: 114.3MB). Free memory was 96.7MB in the beginning and 252.1MB in the end (delta: -155.4MB). Peak memory consumption was 84.0MB. Max. memory is 8.0GB. * 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 136, overapproximation of someUnaryDOUBLEoperation at line 37. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] double var_1_4 = 32.3; [L24] double var_1_5 = 0.25; [L25] unsigned char var_1_7 = 2; [L26] signed char var_1_8 = -10; [L27] signed char var_1_9 = 5; [L28] signed char var_1_10 = 4; [L29] signed char var_1_11 = 100; [L30] unsigned long int var_1_12 = 8; [L31] unsigned char var_1_13 = 0; [L32] unsigned long int var_1_15 = 1114432789; [L33] double var_1_17 = 256.8; [L34] double var_1_18 = 1.25; [L35] unsigned long int var_1_19 = 16; [L36] unsigned char var_1_21 = 1; [L37] double var_1_22 = -0.5; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 1; [L40] unsigned char last_1_var_1_1 = 128; [L41] unsigned long int last_1_var_1_12 = 8; [L42] double last_1_var_1_17 = 256.8; [L43] unsigned char last_1_var_1_21 = 1; [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] CALL updateLastVariables() [L130] last_1_var_1_1 = var_1_1 [L131] last_1_var_1_12 = var_1_12 [L132] last_1_var_1_17 = var_1_17 [L133] last_1_var_1_21 = var_1_21 [L143] RET updateLastVariables() [L144] CALL updateVariables() [L95] var_1_4 = __VERIFIER_nondet_double() [L96] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L96] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_7=2, var_1_8=-10, var_1_9=5] [L97] var_1_5 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L98] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L99] var_1_7 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L100] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=5] [L102] var_1_9 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L103] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L104] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L104] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L105] var_1_10 = __VERIFIER_nondet_char() [L106] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L106] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L107] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L107] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=100, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L108] var_1_11 = __VERIFIER_nondet_char() [L109] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L109] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L110] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L110] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=0, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L111] var_1_13 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L112] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L113] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L113] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L114] var_1_15 = __VERIFIER_nondet_ulong() [L115] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L115] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L116] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L116] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L117] var_1_18 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L118] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L119] var_1_22 = __VERIFIER_nondet_double() [L120] 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L120] 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_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L121] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L121] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L122] var_1_23 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L123] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L124] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L124] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L125] var_1_24 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L126] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L127] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L127] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L144] RET updateVariables() [L145] CALL step() [L47] COND TRUE last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L48] COND TRUE var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17))) [L49] var_1_19 = last_1_var_1_1 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L56] COND TRUE 32u >= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L57] COND TRUE last_1_var_1_12 <= last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L58] COND TRUE (var_1_4 - var_1_5) >= last_1_var_1_17 [L59] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L65] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=-10, var_1_9=126] [L68] COND TRUE ! (var_1_17 > var_1_5) [L69] var_1_8 = (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L73] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L84] var_1_21 = var_1_23 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L86] COND FALSE !(var_1_21 && var_1_21) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L89] COND FALSE !(\read(var_1_21)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L145] RET step() [L146] CALL, EXPR property() [L136-L137] return ((((((32u >= last_1_var_1_12) ? ((last_1_var_1_12 <= last_1_var_1_12) ? (((var_1_4 - var_1_5) >= last_1_var_1_17) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_17 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_21 && var_1_21) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_21 ? (var_1_12 == ((unsigned long int) (((((var_1_19) > ((var_1_11 + var_1_7))) ? (var_1_19) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_1)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((last_1_var_1_21 || (((((var_1_4) > (last_1_var_1_17)) ? (var_1_4) : (last_1_var_1_17))) > var_1_18)) ? ((var_1_18 > ((((last_1_var_1_17) < 0 ) ? -(last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_19 == ((unsigned long int) last_1_var_1_1)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) last_1_var_1_1)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_1 < var_1_19) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_12=8, last_1_var_1_17=1284/5, last_1_var_1_1=128, last_1_var_1_21=1, var_1_10=126, var_1_11=126, var_1_12=8, var_1_13=1, var_1_15=2147483647, var_1_17=1284/5, var_1_19=128, var_1_1=254, var_1_21=0, var_1_23=0, var_1_24=1, var_1_7=254, var_1_8=0, var_1_9=126] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 6, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 300 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 273 mSDsluCounter, 977 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 562 mSDsCounter, 178 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 464 IncrementalHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 178 mSolverCounterUnsat, 415 mSDtfsCounter, 464 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 791 GetRequests, 754 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=5, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 117 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1041 NumberOfCodeBlocks, 1041 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1162 ConstructedInterpolants, 0 QuantifiedInterpolants, 2204 SizeOfPredicates, 8 NumberOfNonLiveVariables, 620 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 7434/7560 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 [2023-12-19 05:38:12,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...