/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-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 00:20:33,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 00:20:33,670 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:20:33,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 00:20:33,684 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 00:20:33,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 00:20:33,745 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 00:20:33,745 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 00:20:33,746 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 00:20:33,750 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 00:20:33,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 00:20:33,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 00:20:33,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 00:20:33,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 00:20:33,752 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 00:20:33,753 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 00:20:33,753 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 00:20:33,753 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 00:20:33,754 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 00:20:33,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 00:20:33,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 00:20:33,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 00:20:33,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 00:20:33,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 00:20:33,756 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 00:20:33,756 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 00:20:33,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 00:20:33,757 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 00:20:33,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 00:20:33,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 00:20:33,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 00:20:33,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 00:20:33,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 00:20:33,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 00:20:33,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 00:20:33,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 00:20:33,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 00:20:33,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 00:20:33,760 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 00:20:33,760 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 00:20:33,760 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 00:20:33,760 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 00:20:33,760 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 00:20:33,760 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:20:34,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 00:20:34,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 00:20:34,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 00:20:34,103 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 00:20:34,103 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 00:20:34,104 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-3.i [2023-12-21 00:20:35,996 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 00:20:36,291 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 00:20:36,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-3.i [2023-12-21 00:20:36,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6206c0dc9/fc3a98d73bb947b59a16c1ab461731c0/FLAGc2eae564e [2023-12-21 00:20:36,327 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6206c0dc9/fc3a98d73bb947b59a16c1ab461731c0 [2023-12-21 00:20:36,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 00:20:36,331 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 00:20:36,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 00:20:36,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 00:20:36,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 00:20:36,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:36,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cab68f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36, skipping insertion in model container [2023-12-21 00:20:36,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:36,426 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 00:20:36,655 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-3.i[914,927] [2023-12-21 00:20:36,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 00:20:36,760 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 00:20:36,776 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-3.i[914,927] [2023-12-21 00:20:36,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 00:20:36,839 INFO L206 MainTranslator]: Completed translation [2023-12-21 00:20:36,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36 WrapperNode [2023-12-21 00:20:36,840 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 00:20:36,841 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 00:20:36,841 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 00:20:36,841 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 00:20:36,857 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:20:36" (1/1) ... [2023-12-21 00:20:36,872 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:20:36" (1/1) ... [2023-12-21 00:20:36,917 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2023-12-21 00:20:36,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 00:20:36,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 00:20:36,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 00:20:36,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 00:20:36,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:36,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:36,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:36,989 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:20:36,989 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:36,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:36,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:36,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:37,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:37,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:37,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 00:20:37,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 00:20:37,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 00:20:37,018 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 00:20:37,019 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (1/1) ... [2023-12-21 00:20:37,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 00:20:37,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 00:20:37,106 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:20:37,149 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:20:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 00:20:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 00:20:37,170 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 00:20:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 00:20:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 00:20:37,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 00:20:37,283 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 00:20:37,287 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 00:20:37,609 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 00:20:37,687 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 00:20:37,687 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 00:20:37,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:20:37 BoogieIcfgContainer [2023-12-21 00:20:37,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 00:20:37,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 00:20:37,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 00:20:37,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 00:20:37,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 12:20:36" (1/3) ... [2023-12-21 00:20:37,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645a3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:20:37, skipping insertion in model container [2023-12-21 00:20:37,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 12:20:36" (2/3) ... [2023-12-21 00:20:37,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645a3be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 12:20:37, skipping insertion in model container [2023-12-21 00:20:37,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 12:20:37" (3/3) ... [2023-12-21 00:20:37,694 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-3.i [2023-12-21 00:20:37,738 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 00:20:37,738 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 00:20:37,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 00:20:37,845 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;@7ccab9c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 00:20:37,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 00:20:37,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 00:20:37,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 00:20:37,871 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:20:37,872 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:20:37,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:20:37,880 INFO L85 PathProgramCache]: Analyzing trace with hash 171684699, now seen corresponding path program 1 times [2023-12-21 00:20:37,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:20:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198686270] [2023-12-21 00:20:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:20:37,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:20:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:20:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:20:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:20:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 00:20:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 00:20:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 00:20:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 00:20:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 00:20:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 00:20:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 00:20:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 00:20:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 00:20:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 00:20:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 00:20:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 00:20:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-21 00:20:38,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:20:38,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198686270] [2023-12-21 00:20:38,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198686270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 00:20:38,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 00:20:38,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 00:20:38,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201076990] [2023-12-21 00:20:38,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 00:20:38,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 00:20:38,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:20:38,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 00:20:38,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 00:20:38,467 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.4) internal successors, (35), 26 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 00:20:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:20:38,497 INFO L93 Difference]: Finished difference Result 83 states and 143 transitions. [2023-12-21 00:20:38,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 00:20:38,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 93 [2023-12-21 00:20:38,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:20:38,505 INFO L225 Difference]: With dead ends: 83 [2023-12-21 00:20:38,505 INFO L226 Difference]: Without dead ends: 41 [2023-12-21 00:20:38,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:20:38,511 INFO L413 NwaCegarLoop]: 57 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, 57 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:20:38,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 00:20:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-21 00:20:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-21 00:20:38,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 00:20:38,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2023-12-21 00:20:38,546 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 93 [2023-12-21 00:20:38,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:20:38,546 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-12-21 00:20:38,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-21 00:20:38,547 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2023-12-21 00:20:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 00:20:38,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:20:38,550 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:38,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 00:20:38,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:20:38,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:20:38,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1956768611, now seen corresponding path program 1 times [2023-12-21 00:20:38,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:20:38,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042490758] [2023-12-21 00:20:38,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:20:38,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:20:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 00:20:39,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-21 00:20:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-21 00:20:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-21 00:20:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-21 00:20:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 00:20:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 00:20:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-21 00:20:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-21 00:20:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-21 00:20:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-21 00:20:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-21 00:20:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-21 00:20:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-21 00:20:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-21 00:20:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-21 00:20:39,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 00:20:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042490758] [2023-12-21 00:20:39,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042490758] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 00:20:39,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299683705] [2023-12-21 00:20:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:20:39,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 00:20:39,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 00:20:39,264 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-21 00:20:39,298 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-21 00:20:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 00:20:39,394 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 00:20:39,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 00:20:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 92 proven. 3 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2023-12-21 00:20:39,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 00:20:39,756 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-21 00:20:39,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299683705] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 00:20:39,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-21 00:20:39,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-21 00:20:39,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144084214] [2023-12-21 00:20:39,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-21 00:20:39,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 00:20:39,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 00:20:39,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 00:20:39,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-21 00:20:39,764 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 00:20:40,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 00:20:40,260 INFO L93 Difference]: Finished difference Result 118 states and 166 transitions. [2023-12-21 00:20:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 00:20:40,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 93 [2023-12-21 00:20:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 00:20:40,265 INFO L225 Difference]: With dead ends: 118 [2023-12-21 00:20:40,265 INFO L226 Difference]: Without dead ends: 78 [2023-12-21 00:20:40,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 212 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2023-12-21 00:20:40,270 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 125 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 00:20:40,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 105 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 00:20:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-12-21 00:20:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2023-12-21 00:20:40,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-21 00:20:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 65 transitions. [2023-12-21 00:20:40,298 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 65 transitions. Word has length 93 [2023-12-21 00:20:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 00:20:40,306 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 65 transitions. [2023-12-21 00:20:40,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-12-21 00:20:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 65 transitions. [2023-12-21 00:20:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-21 00:20:40,312 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 00:20:40,312 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:40,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 00:20:40,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 00:20:40,521 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 00:20:40,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 00:20:40,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1528852059, now seen corresponding path program 1 times [2023-12-21 00:20:40,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 00:20:40,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852615746] [2023-12-21 00:20:40,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 00:20:40,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 00:20:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 00:20:40,657 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 00:20:40,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 00:20:40,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 00:20:40,831 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 00:20:40,851 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 00:20:40,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 00:20:40,856 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-21 00:20:40,859 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 00:20:40,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 12:20:40 BoogieIcfgContainer [2023-12-21 00:20:40,966 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 00:20:40,967 INFO L158 Benchmark]: Toolchain (without parser) took 4636.36ms. Allocated memory is still 315.6MB. Free memory was 265.6MB in the beginning and 276.1MB in the end (delta: -10.5MB). Peak memory consumption was 142.5MB. Max. memory is 8.0GB. [2023-12-21 00:20:40,967 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 189.8MB. Free memory was 142.1MB in the beginning and 141.9MB in the end (delta: 150.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 00:20:40,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.20ms. Allocated memory is still 315.6MB. Free memory was 265.6MB in the beginning and 253.3MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 00:20:40,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.05ms. Allocated memory is still 315.6MB. Free memory was 253.3MB in the beginning and 250.9MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-21 00:20:40,968 INFO L158 Benchmark]: Boogie Preprocessor took 98.79ms. Allocated memory is still 315.6MB. Free memory was 250.9MB in the beginning and 248.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 00:20:40,969 INFO L158 Benchmark]: RCFGBuilder took 669.35ms. Allocated memory is still 315.6MB. Free memory was 248.5MB in the beginning and 231.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 00:20:40,969 INFO L158 Benchmark]: TraceAbstraction took 3276.99ms. Allocated memory is still 315.6MB. Free memory was 231.0MB in the beginning and 276.1MB in the end (delta: -45.1MB). Peak memory consumption was 107.9MB. Max. memory is 8.0GB. [2023-12-21 00:20:40,971 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.53ms. Allocated memory is still 189.8MB. Free memory was 142.1MB in the beginning and 141.9MB in the end (delta: 150.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 491.20ms. Allocated memory is still 315.6MB. Free memory was 265.6MB in the beginning and 253.3MB in the end (delta: 12.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 77.05ms. Allocated memory is still 315.6MB. Free memory was 253.3MB in the beginning and 250.9MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 98.79ms. Allocated memory is still 315.6MB. Free memory was 250.9MB in the beginning and 248.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 669.35ms. Allocated memory is still 315.6MB. Free memory was 248.5MB in the beginning and 231.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3276.99ms. Allocated memory is still 315.6MB. Free memory was 231.0MB in the beginning and 276.1MB in the end (delta: -45.1MB). Peak memory consumption was 107.9MB. 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 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 7.25; [L33] unsigned char var_1_14 = 1; [L34] unsigned char var_1_15 = 0; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] var_1_7 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L70] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L70] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=500, var_1_9=-5] [L71] var_1_8 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=-5] [L73] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=-5] [L73] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=-5] [L74] var_1_9 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L75] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L76] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L76] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L77] var_1_10 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L78] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L79] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L79] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L80] var_1_13 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L81] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L82] var_1_15 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L83] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L84] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L84] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L97] RET updateVariables() [L98] CALL step() [L38] var_1_12 = var_1_13 [L39] var_1_14 = var_1_15 VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=1073741827, var_1_13=1073741827, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L40] COND FALSE !(! var_1_14) [L43] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=1073741827, var_1_13=1073741827, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L45] signed long int stepLocal_2 = var_1_7; [L46] signed long int stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_1=536870912, stepLocal_2=-1073741823, var_1_10=536870911, var_1_11=1, var_1_12=1073741827, var_1_13=1073741827, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L47] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, stepLocal_1=536870912, stepLocal_2=-1073741823, var_1_10=536870911, var_1_11=1, var_1_12=1073741827, var_1_13=1073741827, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L54] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=536870912, stepLocal_2=-1073741823, var_1_10=536870911, var_1_11=1, var_1_12=1073741827, var_1_13=1073741827, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L55] COND FALSE !(! var_1_11) VAL [isInitial=1, stepLocal_0=1, stepLocal_1=536870912, stepLocal_2=-1073741823, var_1_10=536870911, var_1_11=1, var_1_12=1073741827, var_1_13=1073741827, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L98] RET step() [L99] CALL, EXPR property() [L89-L90] return (((((! var_1_11) ? ((var_1_11 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_14) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_14 || (! var_1_5))))) : 1)) && (var_1_12 == ((double) var_1_13))) && (var_1_14 == ((unsigned char) var_1_15)) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=1073741827, var_1_13=1073741827, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=1073741827, var_1_13=1073741827, var_1_14=1, var_1_15=1, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=-1073741823, var_1_8=1073741822, var_1_9=536870912] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 139 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 162 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 83 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 158 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 83 mSolverCounterUnsat, 115 mSDtfsCounter, 158 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 29 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 368 ConstructedInterpolants, 0 QuantifiedInterpolants, 532 SizeOfPredicates, 4 NumberOfNonLiveVariables, 225 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 1671/1680 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:20:41,008 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...