/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-23.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 12:41:27,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 12:41:27,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 12:41:27,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 12:41:27,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 12:41:27,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 12:41:27,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 12:41:27,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 12:41:27,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 12:41:27,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 12:41:27,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 12:41:27,664 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 12:41:27,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 12:41:27,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 12:41:27,666 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 12:41:27,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 12:41:27,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 12:41:27,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 12:41:27,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 12:41:27,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 12:41:27,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 12:41:27,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 12:41:27,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 12:41:27,672 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 12:41:27,672 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 12:41:27,673 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 12:41:27,673 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 12:41:27,673 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 12:41:27,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 12:41:27,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 12:41:27,674 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 12:41:27,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 12:41:27,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 12:41:27,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 12:41:27,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 12:41:27,677 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 12:41:27,678 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 12:41:27,678 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 12:41:27,678 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 12:41:27,679 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 12:41:27,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 12:41:27,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 12:41:27,679 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 12:41:27,679 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 12:41:27,680 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> bitwuzla [2024-11-03 12:41:27,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 12:41:27,978 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 12:41:27,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 12:41:27,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 12:41:27,983 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 12:41:27,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2024-11-03 12:41:29,450 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 12:41:29,664 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 12:41:29,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-23.i [2024-11-03 12:41:29,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac6b42710/4670c2ad0a75436eb3b99585dc5a4c6e/FLAG435ffb273 [2024-11-03 12:41:30,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac6b42710/4670c2ad0a75436eb3b99585dc5a4c6e [2024-11-03 12:41:30,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 12:41:30,023 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 12:41:30,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 12:41:30,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 12:41:30,032 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 12:41:30,033 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,034 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9faee23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30, skipping insertion in model container [2024-11-03 12:41:30,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,055 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 12:41:30,236 WARN L250 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_amount10_file-23.i[915,928] [2024-11-03 12:41:30,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 12:41:30,285 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 12:41:30,298 WARN L250 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_amount10_file-23.i[915,928] [2024-11-03 12:41:30,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 12:41:30,329 INFO L204 MainTranslator]: Completed translation [2024-11-03 12:41:30,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30 WrapperNode [2024-11-03 12:41:30,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 12:41:30,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 12:41:30,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 12:41:30,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 12:41:30,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,369 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 84 [2024-11-03 12:41:30,370 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 12:41:30,371 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 12:41:30,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 12:41:30,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 12:41:30,381 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,382 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,385 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,398 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-03 12:41:30,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,420 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 12:41:30,421 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 12:41:30,421 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 12:41:30,421 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 12:41:30,422 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (1/1) ... [2024-11-03 12:41:30,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 12:41:30,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 12:41:30,462 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-03 12:41:30,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-03 12:41:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 12:41:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 12:41:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 12:41:30,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 12:41:30,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 12:41:30,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 12:41:30,570 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 12:41:30,572 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 12:41:30,784 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-03 12:41:30,784 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 12:41:30,796 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 12:41:30,797 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 12:41:30,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:41:30 BoogieIcfgContainer [2024-11-03 12:41:30,797 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 12:41:30,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 12:41:30,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 12:41:30,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 12:41:30,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 12:41:30" (1/3) ... [2024-11-03 12:41:30,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec95466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:41:30, skipping insertion in model container [2024-11-03 12:41:30,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 12:41:30" (2/3) ... [2024-11-03 12:41:30,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ec95466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 12:41:30, skipping insertion in model container [2024-11-03 12:41:30,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 12:41:30" (3/3) ... [2024-11-03 12:41:30,807 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-23.i [2024-11-03 12:41:30,841 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 12:41:30,842 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 12:41:30,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 12:41:30,898 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4f05dd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 12:41:30,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 12:41:30,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-03 12:41:30,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-03 12:41:30,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 12:41:30,911 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 12:41:30,912 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 12:41:30,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 12:41:30,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1325427547, now seen corresponding path program 1 times [2024-11-03 12:41:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 12:41:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [593118188] [2024-11-03 12:41:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 12:41:30,930 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 12:41:30,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 12:41:30,933 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 12:41:30,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-03 12:41:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 12:41:31,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 12:41:31,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 12:41:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-03 12:41:31,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 12:41:31,231 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-03 12:41:31,232 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 12:41:31,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [593118188] [2024-11-03 12:41:31,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [593118188] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 12:41:31,233 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 12:41:31,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 12:41:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233353518] [2024-11-03 12:41:31,235 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 12:41:31,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 12:41:31,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 12:41:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 12:41:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 12:41:31,267 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-03 12:41:31,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 12:41:31,292 INFO L93 Difference]: Finished difference Result 79 states and 132 transitions. [2024-11-03 12:41:31,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 12:41:31,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2024-11-03 12:41:31,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 12:41:31,302 INFO L225 Difference]: With dead ends: 79 [2024-11-03 12:41:31,302 INFO L226 Difference]: Without dead ends: 39 [2024-11-03 12:41:31,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 12:41:31,311 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 12:41:31,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 12:41:31,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-03 12:41:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-03 12:41:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-03 12:41:31,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-11-03 12:41:31,357 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 87 [2024-11-03 12:41:31,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 12:41:31,358 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-03 12:41:31,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-03 12:41:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-11-03 12:41:31,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-03 12:41:31,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 12:41:31,363 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 12:41:31,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Forceful destruction successful, exit code 0 [2024-11-03 12:41:31,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 12:41:31,566 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 12:41:31,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 12:41:31,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1209082395, now seen corresponding path program 1 times [2024-11-03 12:41:31,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 12:41:31,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [831967373] [2024-11-03 12:41:31,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 12:41:31,567 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 12:41:31,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 12:41:31,569 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 12:41:31,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-03 12:41:31,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 12:41:31,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-03 12:41:31,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 12:41:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-03 12:41:38,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 12:41:55,052 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-03 12:41:55,052 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 12:41:55,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [831967373] [2024-11-03 12:41:55,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [831967373] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 12:41:55,053 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 12:41:55,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2024-11-03 12:41:55,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036904960] [2024-11-03 12:41:55,053 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 12:41:55,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-03 12:41:55,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 12:41:55,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-03 12:41:55,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=38, Unknown=2, NotChecked=0, Total=56 [2024-11-03 12:41:55,056 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-03 12:41:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 12:41:55,739 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2024-11-03 12:41:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-03 12:41:55,745 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2024-11-03 12:41:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 12:41:55,746 INFO L225 Difference]: With dead ends: 47 [2024-11-03 12:41:55,746 INFO L226 Difference]: Without dead ends: 45 [2024-11-03 12:41:55,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=28, Invalid=60, Unknown=2, NotChecked=0, Total=90 [2024-11-03 12:41:55,748 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 5 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-03 12:41:55,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 288 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-03 12:41:55,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-03 12:41:55,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2024-11-03 12:41:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-03 12:41:55,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2024-11-03 12:41:55,762 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 87 [2024-11-03 12:41:55,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 12:41:55,768 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2024-11-03 12:41:55,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-03 12:41:55,768 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2024-11-03 12:41:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-03 12:41:55,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 12:41:55,772 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 12:41:55,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-03 12:41:55,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 12:41:55,974 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 12:41:55,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 12:41:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash 767663236, now seen corresponding path program 1 times [2024-11-03 12:41:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 12:41:55,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409437683] [2024-11-03 12:41:55,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 12:41:55,975 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 12:41:55,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 12:41:55,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 12:41:55,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-03 12:41:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 12:41:56,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-03 12:41:56,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 12:41:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-03 12:41:58,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 12:42:07,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 ((_ sign_extend 24) c_~var_1_2~0)) (.cse7 ((_ sign_extend 24) c_~var_1_3~0))) (let ((.cse58 ((_ zero_extend 24) c_~var_1_1~0)) (.cse13 (bvsgt .cse10 .cse7))) (let ((.cse22 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse98 ((_ sign_extend 24) ~var_1_4~0)) (.cse99 ((_ sign_extend 24) ~var_1_6~0))) (let ((.cse97 (bvand .cse99 ((_ sign_extend 24) ~var_1_5~0))) (.cse96 (bvadd .cse10 .cse98))) (or (not (bvsgt .cse96 .cse97)) (= .cse7 .cse97) (not (bvslt .cse98 .cse99)) (= .cse96 .cse7)))))) (.cse21 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse94 ((_ sign_extend 24) ~var_1_6~0)) (.cse93 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse95 (bvadd .cse10 .cse93)) (.cse92 (bvand .cse94 ((_ sign_extend 24) ~var_1_5~0)))) (or (= .cse7 .cse92) (not (bvslt .cse93 .cse94)) (= .cse95 .cse7) (bvsgt .cse95 .cse92)))))) (.cse23 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse91 ((_ sign_extend 24) ~var_1_6~0))) (let ((.cse89 ((_ sign_extend 24) ~var_1_4~0)) (.cse90 (bvand .cse91 ((_ sign_extend 24) ~var_1_5~0)))) (or (not (bvsgt (bvadd .cse10 .cse89) .cse90)) (not (bvslt .cse89 .cse91)) (not (= .cse7 .cse90))))))) (.cse2 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse88 ((_ sign_extend 24) ~var_1_6~0)) (.cse87 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse86 (bvadd .cse10 .cse87)) (.cse85 (bvand .cse88 ((_ sign_extend 24) ~var_1_5~0)))) (or (= .cse7 .cse85) (not (= .cse86 .cse7)) (not (bvslt .cse87 .cse88)) (bvsgt .cse86 .cse85)))))) (.cse5 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse83 ((_ sign_extend 24) ~var_1_4~0)) (.cse84 ((_ sign_extend 24) ~var_1_6~0))) (or (not (= (bvadd .cse10 .cse83) .cse7)) (bvslt .cse83 .cse84) (not (= .cse7 (bvand .cse84 ((_ sign_extend 24) ~var_1_5~0)))))))) (.cse6 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse82 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse80 (bvadd .cse10 .cse82)) (.cse81 ((_ sign_extend 24) ~var_1_6~0))) (or (not (bvsgt .cse80 (bvand .cse81 ((_ sign_extend 24) ~var_1_5~0)))) (not (= .cse80 .cse7)) (bvslt .cse82 .cse81)))))) (.cse4 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse79 ((_ sign_extend 24) ~var_1_6~0)) (.cse78 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse77 (bvadd .cse10 .cse78)) (.cse76 (bvand .cse79 ((_ sign_extend 24) ~var_1_5~0)))) (or (= .cse7 .cse76) (not (= .cse77 .cse7)) (bvslt .cse78 .cse79) (bvsgt .cse77 .cse76)))))) (.cse18 (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse74 ((_ sign_extend 24) ~var_1_4~0))) (or (not (= (bvadd .cse10 .cse74) .cse7)) (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse75 ((_ sign_extend 24) ~var_1_6~0))) (or (forall ((~var_1_5~0 (_ BitVec 8))) (not (= .cse7 (bvand .cse75 ((_ sign_extend 24) ~var_1_5~0))))) (not (bvslt .cse74 .cse75))))))))) (.cse3 (not .cse13)) (.cse26 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse73 ((_ sign_extend 24) ~var_1_6~0))) (let ((.cse71 ((_ sign_extend 24) ~var_1_4~0)) (.cse72 (bvand .cse73 ((_ sign_extend 24) ~var_1_5~0)))) (or (not (bvsgt (bvadd .cse10 .cse71) .cse72)) (bvslt .cse71 .cse73) (not (= .cse7 .cse72))))))) (.cse25 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse69 ((_ sign_extend 24) ~var_1_4~0)) (.cse70 ((_ sign_extend 24) ~var_1_6~0))) (let ((.cse68 (bvand .cse70 ((_ sign_extend 24) ~var_1_5~0))) (.cse67 (bvadd .cse10 .cse69))) (or (not (bvsgt .cse67 .cse68)) (= .cse7 .cse68) (bvslt .cse69 .cse70) (= .cse67 .cse7)))))) (.cse27 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse65 ((_ sign_extend 24) ~var_1_6~0)) (.cse64 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse66 (bvadd .cse10 .cse64)) (.cse63 (bvand .cse65 ((_ sign_extend 24) ~var_1_5~0)))) (or (= .cse7 .cse63) (bvslt .cse64 .cse65) (= .cse66 .cse7) (bvsgt .cse66 .cse63)))))) (.cse24 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse60 ((_ sign_extend 24) ~var_1_6~0)) (.cse59 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse61 (bvadd .cse10 .cse59)) (.cse62 (bvand .cse60 ((_ sign_extend 24) ~var_1_5~0)))) (or (bvslt .cse59 .cse60) (= .cse61 .cse7) (bvsgt .cse61 .cse62) (not (= .cse7 .cse62))))))) (.cse32 ((_ zero_extend 24) c_~var_1_7~0)) (.cse0 (= (_ bv0 32) .cse58))) (and (or (not .cse0) (let ((.cse1 (= (_ bv0 32) .cse32))) (and (or .cse1 .cse2 .cse3) (or (and (or .cse1 .cse4) (or .cse1 .cse5) (or .cse1 .cse6)) .cse3) (or (and (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse9 ((_ sign_extend 24) ~var_1_4~0))) (or (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse8 ((_ sign_extend 24) ~var_1_6~0))) (or (forall ((~var_1_5~0 (_ BitVec 8))) (= .cse7 (bvand .cse8 ((_ sign_extend 24) ~var_1_5~0)))) (not (bvslt .cse9 .cse8))))) (= (bvadd .cse10 .cse9) .cse7)))) (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse11 ((_ sign_extend 24) ~var_1_4~0))) (or (= (bvadd .cse10 .cse11) .cse7) (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse12 ((_ sign_extend 24) ~var_1_6~0))) (or (forall ((~var_1_5~0 (_ BitVec 8))) (not (= .cse7 (bvand .cse12 ((_ sign_extend 24) ~var_1_5~0))))) (not (bvslt .cse11 .cse12))))))))) .cse13) (or (and (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse14 ((_ sign_extend 24) ~var_1_4~0))) (or (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse15 ((_ sign_extend 24) ~var_1_6~0))) (or (bvslt .cse14 .cse15) (forall ((~var_1_5~0 (_ BitVec 8))) (= .cse7 (bvand .cse15 ((_ sign_extend 24) ~var_1_5~0))))))) (= (bvadd .cse10 .cse14) .cse7)))) (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse17 ((_ sign_extend 24) ~var_1_4~0))) (or (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse16 ((_ sign_extend 24) ~var_1_6~0))) (or (forall ((~var_1_5~0 (_ BitVec 8))) (not (= .cse7 (bvand .cse16 ((_ sign_extend 24) ~var_1_5~0))))) (bvslt .cse17 .cse16)))) (= (bvadd .cse10 .cse17) .cse7))))) .cse13) (or .cse13 (and .cse18 (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse20 ((_ sign_extend 24) ~var_1_4~0))) (or (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse19 ((_ sign_extend 24) ~var_1_6~0))) (or (forall ((~var_1_5~0 (_ BitVec 8))) (= .cse7 (bvand .cse19 ((_ sign_extend 24) ~var_1_5~0)))) (not (bvslt .cse20 .cse19))))) (not (= (bvadd .cse10 .cse20) .cse7))))))) (or .cse3 (and (or .cse1 .cse21) (or .cse1 .cse22) (or .cse1 .cse23))) (or .cse3 (and (or .cse1 .cse24) (or .cse25 .cse1) (or .cse1 .cse26) (or .cse1 .cse27))) (or .cse13 (and (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse29 ((_ sign_extend 24) ~var_1_4~0))) (or (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse28 ((_ sign_extend 24) ~var_1_6~0))) (or (forall ((~var_1_5~0 (_ BitVec 8))) (not (= .cse7 (bvand .cse28 ((_ sign_extend 24) ~var_1_5~0))))) (bvslt .cse29 .cse28)))) (not (= (bvadd .cse10 .cse29) .cse7))))) (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse30 ((_ sign_extend 24) ~var_1_4~0))) (or (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse31 ((_ sign_extend 24) ~var_1_6~0))) (or (bvslt .cse30 .cse31) (forall ((~var_1_5~0 (_ BitVec 8))) (= .cse7 (bvand .cse31 ((_ sign_extend 24) ~var_1_5~0))))))) (not (= (bvadd .cse10 .cse30) .cse7)))))))))) (or (let ((.cse41 (forall ((~var_1_8~0 (_ BitVec 8))) (not (= ((_ zero_extend 24) ~var_1_8~0) .cse58)))) (.cse40 (= .cse58 .cse32)) (.cse33 (forall ((~var_1_8~0 (_ BitVec 8))) (= ((_ zero_extend 24) ~var_1_8~0) .cse58)))) (let ((.cse34 (and (or .cse41 .cse40) (or .cse40 .cse33)))) (and (or .cse13 (and (or .cse4 .cse33) (or .cse33 .cse5) (or .cse6 .cse33))) (or (let ((.cse39 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse42 ((_ sign_extend 24) ~var_1_4~0)) (.cse43 ((_ sign_extend 24) ~var_1_6~0))) (or (not (bvslt .cse42 .cse43)) (= (bvadd .cse10 .cse42) .cse7) (not (= .cse7 (bvand .cse43 ((_ sign_extend 24) ~var_1_5~0))))))))) (and (or .cse34 .cse21) (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse36 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse35 (bvadd .cse10 .cse36))) (or (= .cse35 .cse7) (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse37 ((_ sign_extend 24) ~var_1_6~0))) (or (not (bvslt .cse36 .cse37)) (forall ((~var_1_5~0 (_ BitVec 8))) (let ((.cse38 (bvand .cse37 ((_ sign_extend 24) ~var_1_5~0)))) (or (bvsgt .cse35 .cse38) (not (= .cse7 .cse38)))))))))))) (or .cse34 .cse22) (or .cse39 .cse40 .cse33) (or .cse39 .cse41 .cse40))) .cse3) (or (and (or .cse33 .cse22) (or .cse33 .cse21) (or (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse45 ((_ sign_extend 24) ~var_1_6~0)) (.cse44 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse46 (bvadd .cse10 .cse44)) (.cse47 (bvand .cse45 ((_ sign_extend 24) ~var_1_5~0)))) (or (not (bvslt .cse44 .cse45)) (= .cse46 .cse7) (bvsgt .cse46 .cse47) (not (= .cse7 .cse47)))))) .cse33) (or .cse33 .cse23)) .cse13) (or (and (or (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse50 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse48 (bvadd .cse10 .cse50)) (.cse49 ((_ sign_extend 24) ~var_1_6~0))) (or (not (bvsgt .cse48 (bvand .cse49 ((_ sign_extend 24) ~var_1_5~0)))) (not (= .cse48 .cse7)) (not (bvslt .cse50 .cse49)))))) .cse33) (or .cse33 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8)) (~var_1_5~0 (_ BitVec 8))) (let ((.cse51 ((_ sign_extend 24) ~var_1_4~0)) (.cse52 ((_ sign_extend 24) ~var_1_6~0))) (or (not (= (bvadd .cse10 .cse51) .cse7)) (not (bvslt .cse51 .cse52)) (not (= .cse7 (bvand .cse52 ((_ sign_extend 24) ~var_1_5~0)))))))) (or .cse2 .cse33)) .cse13) (or (and (or .cse24 .cse34) (or .cse34 .cse26) (or .cse34 .cse27) (or .cse25 .cse34)) .cse3) (or (and (or .cse34 .cse5) (or .cse6 .cse34) (or .cse4 .cse34)) .cse3) (or (let ((.cse53 (forall ((~var_1_6~0 (_ BitVec 8)) (~var_1_4~0 (_ BitVec 8))) (let ((.cse57 ((_ sign_extend 24) ~var_1_4~0))) (or (not (= (bvadd .cse10 .cse57) .cse7)) (not (bvslt .cse57 ((_ sign_extend 24) ~var_1_6~0)))))))) (and (or .cse53 .cse41 .cse40) (forall ((~var_1_4~0 (_ BitVec 8))) (let ((.cse55 ((_ sign_extend 24) ~var_1_4~0))) (let ((.cse54 (bvadd .cse10 .cse55))) (or (not (= .cse54 .cse7)) (forall ((~var_1_6~0 (_ BitVec 8))) (let ((.cse56 ((_ sign_extend 24) ~var_1_6~0))) (or (not (bvslt .cse55 .cse56)) (forall ((~var_1_5~0 (_ BitVec 8))) (not (bvsgt .cse54 (bvand .cse56 ((_ sign_extend 24) ~var_1_5~0)))))))))))) (or .cse53 .cse40 .cse33) .cse18)) .cse3) (or .cse13 (and (or .cse33 .cse26) (or .cse25 .cse33) (or .cse27 .cse33) (or .cse24 .cse33)))))) .cse0))))) is different from false [2024-11-03 12:42:43,426 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-03 12:42:43,426 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 12:42:43,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409437683] [2024-11-03 12:42:43,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1409437683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-03 12:42:43,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-03 12:42:43,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-03 12:42:43,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16763433] [2024-11-03 12:42:43,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-03 12:42:43,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-03 12:42:43,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 12:42:43,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-03 12:42:43,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=135, Unknown=7, NotChecked=24, Total=210 [2024-11-03 12:42:43,432 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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) [2024-11-03 12:42:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 12:42:50,072 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-11-03 12:42:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-03 12:42:50,072 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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 88 [2024-11-03 12:42:50,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 12:42:50,073 INFO L225 Difference]: With dead ends: 53 [2024-11-03 12:42:50,073 INFO L226 Difference]: Without dead ends: 0 [2024-11-03 12:42:50,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 160 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 46.8s TimeCoverageRelationStatistics Valid=92, Invalid=284, Unknown=8, NotChecked=36, Total=420 [2024-11-03 12:42:50,075 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 47 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-03 12:42:50,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 190 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 233 Invalid, 0 Unknown, 64 Unchecked, 1.1s Time] [2024-11-03 12:42:50,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-03 12:42:50,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-03 12:42:50,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 12:42:50,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-03 12:42:50,077 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2024-11-03 12:42:50,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 12:42:50,077 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-03 12:42:50,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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) [2024-11-03 12:42:50,078 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-03 12:42:50,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-03 12:42:50,080 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 12:42:50,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Ended with exit code 0 [2024-11-03 12:42:50,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 12:42:50,285 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-03 12:42:50,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-03 12:42:50,354 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 12:42:50,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 12:42:50 BoogieIcfgContainer [2024-11-03 12:42:50,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 12:42:50,378 INFO L158 Benchmark]: Toolchain (without parser) took 80356.03ms. Allocated memory was 312.5MB in the beginning and 670.0MB in the end (delta: 357.6MB). Free memory was 263.6MB in the beginning and 627.3MB in the end (delta: -363.7MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 12:42:50,379 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 219.2MB. Free memory is still 172.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 12:42:50,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.75ms. Allocated memory is still 312.5MB. Free memory was 263.4MB in the beginning and 249.4MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-03 12:42:50,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.38ms. Allocated memory is still 312.5MB. Free memory was 249.4MB in the beginning and 247.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 12:42:50,384 INFO L158 Benchmark]: Boogie Preprocessor took 48.98ms. Allocated memory is still 312.5MB. Free memory was 247.4MB in the beginning and 245.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 12:42:50,384 INFO L158 Benchmark]: RCFGBuilder took 376.90ms. Allocated memory is still 312.5MB. Free memory was 245.3MB in the beginning and 232.2MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-03 12:42:50,384 INFO L158 Benchmark]: TraceAbstraction took 79577.01ms. Allocated memory was 312.5MB in the beginning and 670.0MB in the end (delta: 357.6MB). Free memory was 231.4MB in the beginning and 627.3MB in the end (delta: -395.8MB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 12:42:50,386 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.16ms. Allocated memory is still 219.2MB. Free memory is still 172.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 307.75ms. Allocated memory is still 312.5MB. Free memory was 263.4MB in the beginning and 249.4MB in the end (delta: 14.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.38ms. Allocated memory is still 312.5MB. Free memory was 249.4MB in the beginning and 247.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.98ms. Allocated memory is still 312.5MB. Free memory was 247.4MB in the beginning and 245.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 376.90ms. Allocated memory is still 312.5MB. Free memory was 245.3MB in the beginning and 232.2MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 79577.01ms. Allocated memory was 312.5MB in the beginning and 670.0MB in the end (delta: 357.6MB). Free memory was 231.4MB in the beginning and 627.3MB in the end (delta: -395.8MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 79.4s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 62 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 52 mSDsluCounter, 533 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 64 IncrementalHoareTripleChecker+Unchecked, 390 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 143 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 527 GetRequests, 498 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 59.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=0, InterpolantAutomatonStates: 20, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 71.0s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 518 ConstructedInterpolants, 3 QuantifiedInterpolants, 5834 SizeOfPredicates, 26 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 2172/2184 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (var_1_7 <= 0) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: ((0 != cond) && (((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_2 == \old(var_1_2))) && (var_1_3 == \old(var_1_3))) && (var_1_4 == \old(var_1_4))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8)))) RESULT: Ultimate proved your program to be correct! [2024-11-03 12:42:50,448 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...