/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_loopvsstraightlinecode_25-1loop_file-20.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:53:11,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:53:11,525 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-20 22:53:11,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:53:11,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:53:11,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:53:11,550 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:53:11,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:53:11,551 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:53:11,553 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:53:11,553 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:53:11,554 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:53:11,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:53:11,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:53:11,555 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:53:11,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:53:11,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:53:11,555 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:53:11,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:53:11,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:53:11,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:53:11,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:53:11,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:53:11,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:53:11,557 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:53:11,557 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:53:11,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:53:11,557 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:53:11,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:53:11,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:53:11,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:53:11,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:53:11,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:53:11,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:53:11,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:53:11,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:53:11,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:53:11,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:53:11,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:53:11,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:53:11,559 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:53:11,560 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:53:11,560 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:53:11,560 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-20 22:53:11,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:53:11,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:53:11,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:53:11,747 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:53:11,748 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:53:11,748 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2023-12-20 22:53:12,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:53:12,927 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:53:12,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-20.i [2023-12-20 22:53:12,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57975ea53/ff065920d6db44ed8de3b8d617f5dd26/FLAG930bf4f9c [2023-12-20 22:53:12,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57975ea53/ff065920d6db44ed8de3b8d617f5dd26 [2023-12-20 22:53:12,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:53:12,949 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:53:12,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:53:12,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:53:12,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:53:12,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:53:12" (1/1) ... [2023-12-20 22:53:12,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9d769d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:12, skipping insertion in model container [2023-12-20 22:53:12,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:53:12" (1/1) ... [2023-12-20 22:53:12,978 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:53:13,070 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2023-12-20 22:53:13,090 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:53:13,098 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:53:13,105 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_loopvsstraightlinecode_25-1loop_file-20.i[915,928] [2023-12-20 22:53:13,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:53:13,123 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:53:13,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13 WrapperNode [2023-12-20 22:53:13,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:53:13,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:53:13,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:53:13,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:53:13,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,153 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2023-12-20 22:53:13,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:53:13,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:53:13,154 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:53:13,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:53:13,160 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,161 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,168 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-20 22:53:13,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,174 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,176 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:53:13,176 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:53:13,176 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:53:13,176 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:53:13,177 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (1/1) ... [2023-12-20 22:53:13,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:53:13,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:53:13,199 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-20 22:53:13,216 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-20 22:53:13,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:53:13,231 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:53:13,232 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:53:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:53:13,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:53:13,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:53:13,284 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:53:13,287 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:53:13,459 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:53:13,487 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:53:13,488 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:53:13,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:53:13 BoogieIcfgContainer [2023-12-20 22:53:13,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:53:13,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:53:13,490 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:53:13,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:53:13,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:53:12" (1/3) ... [2023-12-20 22:53:13,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3815f9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:53:13, skipping insertion in model container [2023-12-20 22:53:13,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:53:13" (2/3) ... [2023-12-20 22:53:13,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3815f9ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:53:13, skipping insertion in model container [2023-12-20 22:53:13,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:53:13" (3/3) ... [2023-12-20 22:53:13,493 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-20.i [2023-12-20 22:53:13,504 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:53:13,504 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:53:13,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:53:13,536 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;@4d8b8f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:53:13,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:53:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 22:53:13,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-20 22:53:13,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:13,544 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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-20 22:53:13,545 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:13,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2108197440, now seen corresponding path program 1 times [2023-12-20 22:53:13,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:13,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523523407] [2023-12-20 22:53:13,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:13,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 22:53:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 22:53:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 22:53:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,725 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-20 22:53:13,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:13,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523523407] [2023-12-20 22:53:13,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523523407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:13,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:13,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:53:13,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263282072] [2023-12-20 22:53:13,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:13,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:53:13,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:13,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:53:13,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:53:13,755 INFO L87 Difference]: Start difference. First operand has 30 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-20 22:53:13,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:13,793 INFO L93 Difference]: Finished difference Result 59 states and 93 transitions. [2023-12-20 22:53:13,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:53:13,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2023-12-20 22:53:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:13,799 INFO L225 Difference]: With dead ends: 59 [2023-12-20 22:53:13,799 INFO L226 Difference]: Without dead ends: 28 [2023-12-20 22:53:13,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-20 22:53:13,815 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:13,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:53:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-20 22:53:13,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-20 22:53:13,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 22:53:13,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2023-12-20 22:53:13,844 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 45 [2023-12-20 22:53:13,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:13,844 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2023-12-20 22:53:13,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-20 22:53:13,844 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2023-12-20 22:53:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-20 22:53:13,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:13,846 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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-20 22:53:13,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:53:13,846 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:13,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash 290116856, now seen corresponding path program 1 times [2023-12-20 22:53:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132689191] [2023-12-20 22:53:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:13,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:53:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:53:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:53:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 22:53:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 22:53:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-20 22:53:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:53:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-20 22:53:13,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:53:13,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132689191] [2023-12-20 22:53:13,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132689191] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:53:13,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:53:13,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 22:53:13,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764326574] [2023-12-20 22:53:13,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:53:13,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 22:53:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:53:13,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 22:53:13,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 22:53:13,937 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-20 22:53:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:53:13,972 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2023-12-20 22:53:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 22:53:13,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2023-12-20 22:53:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:53:13,974 INFO L225 Difference]: With dead ends: 64 [2023-12-20 22:53:13,974 INFO L226 Difference]: Without dead ends: 37 [2023-12-20 22:53:13,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-20 22:53:13,975 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:53:13,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:53:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-20 22:53:13,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2023-12-20 22:53:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-20 22:53:13,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2023-12-20 22:53:13,980 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 45 [2023-12-20 22:53:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:53:13,981 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2023-12-20 22:53:13,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-12-20 22:53:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2023-12-20 22:53:13,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-20 22:53:13,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:53:13,982 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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-20 22:53:13,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:53:13,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:53:13,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:53:13,983 INFO L85 PathProgramCache]: Analyzing trace with hash 53695480, now seen corresponding path program 1 times [2023-12-20 22:53:13,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:53:13,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228364401] [2023-12-20 22:53:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:53:13,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:53:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:53:14,013 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 22:53:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:53:14,048 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 22:53:14,048 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 22:53:14,049 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:53:14,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:53:14,056 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-20 22:53:14,059 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:53:14,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:53:14 BoogieIcfgContainer [2023-12-20 22:53:14,087 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:53:14,087 INFO L158 Benchmark]: Toolchain (without parser) took 1137.70ms. Allocated memory was 230.7MB in the beginning and 286.3MB in the end (delta: 55.6MB). Free memory was 190.3MB in the beginning and 229.0MB in the end (delta: -38.7MB). Peak memory consumption was 17.7MB. Max. memory is 8.0GB. [2023-12-20 22:53:14,087 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 230.7MB. Free memory was 178.3MB in the beginning and 178.1MB in the end (delta: 161.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:53:14,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.13ms. Allocated memory is still 230.7MB. Free memory was 190.1MB in the beginning and 178.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 22:53:14,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.63ms. Allocated memory is still 230.7MB. Free memory was 178.0MB in the beginning and 176.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:53:14,096 INFO L158 Benchmark]: Boogie Preprocessor took 22.08ms. Allocated memory is still 230.7MB. Free memory was 176.1MB in the beginning and 174.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:53:14,097 INFO L158 Benchmark]: RCFGBuilder took 311.82ms. Allocated memory is still 230.7MB. Free memory was 174.0MB in the beginning and 160.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 22:53:14,097 INFO L158 Benchmark]: TraceAbstraction took 597.21ms. Allocated memory was 230.7MB in the beginning and 286.3MB in the end (delta: 55.6MB). Free memory was 160.0MB in the beginning and 229.0MB in the end (delta: -69.1MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:53:14,104 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.09ms. Allocated memory is still 230.7MB. Free memory was 178.3MB in the beginning and 178.1MB in the end (delta: 161.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.13ms. Allocated memory is still 230.7MB. Free memory was 190.1MB in the beginning and 178.0MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.63ms. Allocated memory is still 230.7MB. Free memory was 178.0MB in the beginning and 176.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.08ms. Allocated memory is still 230.7MB. Free memory was 176.1MB in the beginning and 174.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 311.82ms. Allocated memory is still 230.7MB. Free memory was 174.0MB in the beginning and 160.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 597.21ms. Allocated memory was 230.7MB in the beginning and 286.3MB in the end (delta: 55.6MB). Free memory was 160.0MB in the beginning and 229.0MB in the end (delta: -69.1MB). There was no memory consumed. 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 someBinaryFLOATComparisonOperation at line 75, overapproximation of someBinaryArithmeticDOUBLEoperation at line 41, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryArithmeticFLOAToperation at line 45. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 0.6; [L23] unsigned char var_1_2 = 0; [L24] float var_1_3 = 0.0; [L25] float var_1_4 = 2.95; [L26] float var_1_5 = 8.5; [L27] float var_1_6 = 999999999999.4; [L28] double var_1_7 = 10.2; [L29] double var_1_8 = 32.7; [L30] double var_1_9 = 32.75; [L31] double last_1_var_1_8 = 32.7; [L79] isInitial = 1 [L80] FCALL initially() [L81] int k_loop; [L82] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=0, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L82] COND TRUE k_loop < 1 [L83] CALL updateLastVariables() [L72] last_1_var_1_8 = var_1_8 [L83] RET updateLastVariables() [L84] CALL updateVariables() [L59] var_1_2 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L60] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L61] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_3=0, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L62] var_1_3 = __VERIFIER_nondet_float() [L63] CALL assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L63] RET assume_abort_if_not((var_1_3 >= 4611686.018427382800e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_4=59/20, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L64] var_1_4 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L65] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_5=17/2, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L66] var_1_5 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L67] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_6=4999999999997/5, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L68] var_1_6 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L69] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_1=3/5, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L84] RET updateVariables() [L85] CALL step() [L35] COND TRUE \read(var_1_2) [L36] var_1_1 = ((var_1_3 - var_1_4) - var_1_5) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_7=51/5, var_1_8=327/10, var_1_9=131/4] [L40] COND TRUE \read(var_1_2) [L41] var_1_7 = ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L43] COND TRUE \read(var_1_2) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_8=327/10, var_1_9=131/4] [L44] COND TRUE var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6))) [L45] var_1_8 = (var_1_5 - var_1_3) VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_9=131/4] [L54] COND TRUE var_1_4 != (var_1_3 - var_1_5) [L55] var_1_9 = var_1_6 VAL [isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L85] RET step() [L86] CALL, EXPR property() [L75-L76] return (((var_1_2 ? (var_1_1 == ((float) ((var_1_3 - var_1_4) - var_1_5))) : (var_1_1 == ((float) (var_1_4 + var_1_6)))) && (var_1_2 ? (var_1_7 == ((double) ((((((var_1_3 - 255.719)) < (var_1_5)) ? ((var_1_3 - 255.719)) : (var_1_5))) - 2.3))) : 1)) && (var_1_2 ? ((var_1_7 >= ((((last_1_var_1_8) > (var_1_6)) ? (last_1_var_1_8) : (var_1_6)))) ? (var_1_8 == ((double) (var_1_5 - var_1_3))) : (var_1_8 == ((double) var_1_4))) : ((var_1_7 <= var_1_5) ? (var_1_8 == ((double) var_1_6)) : 1))) && ((var_1_4 != (var_1_3 - var_1_5)) ? (var_1_9 == ((double) var_1_6)) : 1) ; [L86] RET, EXPR property() [L86] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_8=327/10, var_1_2=1, var_1_6=1000000000004, var_1_9=1000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 95 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21 IncrementalHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 69 mSDtfsCounter, 21 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 88 ConstructedInterpolants, 0 QuantifiedInterpolants, 102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 120/120 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-20 22:53:14,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...