/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-73.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 00:25:35,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 00:25:35,330 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-21 00:25:35,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 00:25:35,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 00:25:35,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 00:25:35,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 00:25:35,370 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 00:25:35,370 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 00:25:35,374 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 00:25:35,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 00:25:35,375 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 00:25:35,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 00:25:35,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 00:25:35,377 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 00:25:35,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 00:25:35,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 00:25:35,378 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 00:25:35,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 00:25:35,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 00:25:35,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 00:25:35,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 00:25:35,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 00:25:35,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 00:25:35,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 00:25:35,380 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 00:25:35,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 00:25:35,381 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 00:25:35,381 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 00:25:35,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 00:25:35,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 00:25:35,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 00:25:35,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 00:25:35,383 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 00:25:35,384 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 00:25:35,384 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 00:25:35,384 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 00:25:35,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 00:25:35,384 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 00:25:35,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 00:25:35,385 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 00:25:35,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 00:25:35,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 00:25:35,385 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 -> false [2023-12-21 00:25:35,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 00:25:35,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 00:25:35,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 00:25:35,679 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 00:25:35,684 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 00:25:35,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-73.i [2023-12-21 00:25:36,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 00:25:37,225 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 00:25:37,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-73.i [2023-12-21 00:25:37,241 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fffa227f/3a26a0b577604c98bbf5af743fb5754b/FLAG67c5609bc [2023-12-21 00:25:37,258 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6fffa227f/3a26a0b577604c98bbf5af743fb5754b [2023-12-21 00:25:37,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 00:25:37,262 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 00:25:37,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 00:25:37,265 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 00:25:37,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 00:25:37,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,271 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563b8d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37, skipping insertion in model container [2023-12-21 00:25:37,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,301 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 00:25:37,457 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_operatoramount_amount25_file-73.i[915,928] [2023-12-21 00:25:37,494 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 00:25:37,510 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 00:25:37,521 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_operatoramount_amount25_file-73.i[915,928] [2023-12-21 00:25:37,536 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 00:25:37,559 INFO L206 MainTranslator]: Completed translation [2023-12-21 00:25:37,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37 WrapperNode [2023-12-21 00:25:37,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 00:25:37,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 00:25:37,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 00:25:37,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 00:25:37,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,600 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 86 [2023-12-21 00:25:37,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 00:25:37,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 00:25:37,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 00:25:37,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 00:25:37,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,641 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-21 00:25:37,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 00:25:37,671 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 00:25:37,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 00:25:37,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 00:25:37,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (1/1) ... [2023-12-21 00:25:37,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 00:25:37,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 00:25:37,718 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-21 00:25:37,744 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-21 00:25:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 00:25:37,755 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 00:25:37,755 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 00:25:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 00:25:37,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 00:25:37,756 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 00:25:37,814 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 00:25:37,816 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 00:25:38,048 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 00:25:38,103 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 00:25:38,103 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 00:25:38,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:25:38 BoogieIcfgContainer [2023-12-21 00:25:38,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 00:25:38,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 00:25:38,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 00:25:38,110 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 00:25:38,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:25:37" (1/3) ... [2023-12-21 00:25:38,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3025db73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:25:38, skipping insertion in model container [2023-12-21 00:25:38,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:25:37" (2/3) ... [2023-12-21 00:25:38,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3025db73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:25:38, skipping insertion in model container [2023-12-21 00:25:38,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:25:38" (3/3) ... [2023-12-21 00:25:38,112 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-73.i [2023-12-21 00:25:38,128 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 00:25:38,128 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 00:25:38,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 00:25:38,166 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;@29acfb6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 00:25:38,167 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 00:25:38,173 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 00:25:38,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 00:25:38,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:25:38,185 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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-21 00:25:38,187 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:25:38,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:25:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1008975170, now seen corresponding path program 1 times [2023-12-21 00:25:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:25:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575502343] [2023-12-21 00:25:38,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:25:38,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:25:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:25:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:25:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:25:38,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 00:25:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 00:25:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 00:25:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 00:25:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 00:25:38,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 00:25:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-21 00:25:38,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:25:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575502343] [2023-12-21 00:25:38,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575502343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:25:38,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:25:38,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 00:25:38,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663245966] [2023-12-21 00:25:38,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:25:38,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 00:25:38,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:25:38,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 00:25:38,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 00:25:38,534 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-21 00:25:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:25:38,579 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2023-12-21 00:25:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 00:25:38,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2023-12-21 00:25:38,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:25:38,610 INFO L225 Difference]: With dead ends: 61 [2023-12-21 00:25:38,611 INFO L226 Difference]: Without dead ends: 30 [2023-12-21 00:25:38,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-21 00:25:38,616 INFO L413 NwaCegarLoop]: 40 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, 40 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-21 00:25:38,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 00:25:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-21 00:25:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-21 00:25:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 00:25:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2023-12-21 00:25:38,664 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 58 [2023-12-21 00:25:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:25:38,665 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2023-12-21 00:25:38,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-21 00:25:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2023-12-21 00:25:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-21 00:25:38,667 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:25:38,668 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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-21 00:25:38,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 00:25:38,669 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:25:38,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:25:38,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1299726272, now seen corresponding path program 1 times [2023-12-21 00:25:38,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:25:38,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331716682] [2023-12-21 00:25:38,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:25:38,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:25:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:25:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:25:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:25:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 00:25:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 00:25:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 00:25:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 00:25:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 00:25:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 00:25:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-21 00:25:39,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:25:39,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331716682] [2023-12-21 00:25:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331716682] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:25:39,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:25:39,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 00:25:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578437495] [2023-12-21 00:25:39,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:25:39,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 00:25:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:25:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 00:25:39,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 00:25:39,216 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-21 00:25:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:25:39,390 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2023-12-21 00:25:39,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 00:25:39,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2023-12-21 00:25:39,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:25:39,395 INFO L225 Difference]: With dead ends: 89 [2023-12-21 00:25:39,396 INFO L226 Difference]: Without dead ends: 60 [2023-12-21 00:25:39,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-21 00:25:39,398 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 45 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 00:25:39,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 134 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 00:25:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-21 00:25:39,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2023-12-21 00:25:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 00:25:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2023-12-21 00:25:39,426 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 58 [2023-12-21 00:25:39,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:25:39,427 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2023-12-21 00:25:39,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-21 00:25:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2023-12-21 00:25:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 00:25:39,429 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:25:39,429 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 00:25:39,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 00:25:39,429 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:25:39,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:25:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash -416378588, now seen corresponding path program 1 times [2023-12-21 00:25:39,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:25:39,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612421355] [2023-12-21 00:25:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:25:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:25:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:25:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:25:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:25:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-21 00:25:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 00:25:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-21 00:25:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 00:25:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 00:25:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 00:25:39,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:25:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2023-12-21 00:25:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:25:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612421355] [2023-12-21 00:25:39,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612421355] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:25:39,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:25:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 00:25:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242724068] [2023-12-21 00:25:39,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:25:39,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 00:25:39,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:25:39,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 00:25:39,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 00:25:39,545 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-21 00:25:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:25:39,583 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2023-12-21 00:25:39,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 00:25:39,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2023-12-21 00:25:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:25:39,587 INFO L225 Difference]: With dead ends: 87 [2023-12-21 00:25:39,587 INFO L226 Difference]: Without dead ends: 58 [2023-12-21 00:25:39,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 00:25:39,591 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 00:25:39,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 78 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 00:25:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-21 00:25:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2023-12-21 00:25:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-21 00:25:39,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2023-12-21 00:25:39,612 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 59 [2023-12-21 00:25:39,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:25:39,614 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2023-12-21 00:25:39,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-12-21 00:25:39,614 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2023-12-21 00:25:39,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-21 00:25:39,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:25:39,615 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 00:25:39,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 00:25:39,616 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:25:39,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:25:39,617 INFO L85 PathProgramCache]: Analyzing trace with hash -359120286, now seen corresponding path program 1 times [2023-12-21 00:25:39,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:25:39,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66234823] [2023-12-21 00:25:39,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:25:39,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:25:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 00:25:39,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 00:25:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 00:25:39,762 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 00:25:39,763 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 00:25:39,763 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 00:25:39,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 00:25:39,768 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-21 00:25:39,771 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 00:25:39,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 12:25:39 BoogieIcfgContainer [2023-12-21 00:25:39,842 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 00:25:39,843 INFO L158 Benchmark]: Toolchain (without parser) took 2580.69ms. Allocated memory is still 181.4MB. Free memory was 139.8MB in the beginning and 67.1MB in the end (delta: 72.7MB). Peak memory consumption was 73.1MB. Max. memory is 8.0GB. [2023-12-21 00:25:39,843 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 181.4MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 00:25:39,844 INFO L158 Benchmark]: CACSL2BoogieTranslator took 295.36ms. Allocated memory is still 181.4MB. Free memory was 139.8MB in the beginning and 127.6MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 00:25:39,846 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.15ms. Allocated memory is still 181.4MB. Free memory was 127.3MB in the beginning and 124.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 00:25:39,846 INFO L158 Benchmark]: Boogie Preprocessor took 69.20ms. Allocated memory is still 181.4MB. Free memory was 124.8MB in the beginning and 121.4MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 00:25:39,847 INFO L158 Benchmark]: RCFGBuilder took 432.70ms. Allocated memory is still 181.4MB. Free memory was 121.4MB in the beginning and 103.8MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-21 00:25:39,847 INFO L158 Benchmark]: TraceAbstraction took 1735.70ms. Allocated memory is still 181.4MB. Free memory was 103.1MB in the beginning and 67.1MB in the end (delta: 36.0MB). Peak memory consumption was 36.4MB. Max. memory is 8.0GB. [2023-12-21 00:25:39,850 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 181.4MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 295.36ms. Allocated memory is still 181.4MB. Free memory was 139.8MB in the beginning and 127.6MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.15ms. Allocated memory is still 181.4MB. Free memory was 127.3MB in the beginning and 124.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 69.20ms. Allocated memory is still 181.4MB. Free memory was 124.8MB in the beginning and 121.4MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 432.70ms. Allocated memory is still 181.4MB. Free memory was 121.4MB in the beginning and 103.8MB in the end (delta: 17.6MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 1735.70ms. Allocated memory is still 181.4MB. Free memory was 103.1MB in the beginning and 67.1MB in the end (delta: 36.0MB). Peak memory consumption was 36.4MB. 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 81, overapproximation of someUnaryDOUBLEoperation at line 24. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_12 = 10; [L29] signed short int var_1_13 = -64; [L30] signed long int var_1_14 = 10; [L31] signed short int var_1_15 = -1; [L32] unsigned char last_1_var_1_8 = 25; [L33] signed long int last_1_var_1_14 = 10; [L85] isInitial = 1 [L86] FCALL initially() [L87] COND TRUE 1 [L88] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_14 = var_1_14 [L88] RET updateLastVariables() [L89] CALL updateVariables() [L61] var_1_6 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L62] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L63] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L63] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L64] var_1_7 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L65] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L69] var_1_10 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L70] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L71] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L71] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L72] var_1_12 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L74] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L74] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L89] RET updateVariables() [L90] CALL step() [L37] signed long int stepLocal_0 = (((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))); VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, stepLocal_0=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L38] COND TRUE last_1_var_1_14 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, stepLocal_0=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L39] COND FALSE !(! var_1_6) [L42] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, stepLocal_0=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=25, var_1_9=8] [L45] COND TRUE \read(var_1_6) [L46] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, stepLocal_0=25, var_1_10=2, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=8, var_1_9=8] [L52] COND TRUE (9.99999999999995E13f + var_1_1) >= var_1_1 [L53] var_1_13 = (-4 + var_1_10) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, stepLocal_0=25, var_1_10=2, var_1_12=254, var_1_13=-2, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=8, var_1_9=8] [L57] var_1_15 = var_1_12 [L58] var_1_14 = var_1_15 [L90] RET step() [L91] CALL, EXPR property() [L81-L82] return (((((last_1_var_1_14 <= ((((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((var_1_1 < (var_1_1 + var_1_7)) ? (var_1_8 == ((unsigned char) var_1_12)) : 1))) && (((9.99999999999995E13f + var_1_1) >= var_1_1) ? (var_1_13 == ((signed short int) (-4 + var_1_10))) : (var_1_13 == ((signed short int) (((((var_1_9) < (8)) ? (var_1_9) : (8))) - 32))))) && (var_1_14 == ((signed long int) var_1_15))) && (var_1_15 == ((signed short int) var_1_12)) ; [L91] RET, EXPR property() [L91] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-2, var_1_14=254, var_1_15=254, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=8, var_1_9=8] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=2, var_1_12=254, var_1_13=-2, var_1_14=254, var_1_15=254, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=8, var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 55 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 252 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 123 mSDtfsCounter, 52 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 237 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 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-21 00:25:39,876 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...