/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_amount50_file-45.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 13:28:13,592 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 13:28:13,638 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 13:28:13,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 13:28:13,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 13:28:13,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 13:28:13,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 13:28:13,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 13:28:13,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 13:28:13,663 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 13:28:13,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 13:28:13,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 13:28:13,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 13:28:13,664 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 13:28:13,664 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 13:28:13,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 13:28:13,665 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 13:28:13,665 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 13:28:13,665 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 13:28:13,665 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 13:28:13,665 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 13:28:13,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 13:28:13,669 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 13:28:13,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 13:28:13,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 13:28:13,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 13:28:13,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 13:28:13,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 13:28:13,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 13:28:13,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 13:28:13,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 13:28:13,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 13:28:13,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 13:28:13,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 13:28:13,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 13:28:13,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 13:28:13,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 13:28:13,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 13:28:13,671 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 13:28:13,671 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 13:28:13,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 13:28:13,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 13:28:13,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 13:28:13,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 13:28:13,672 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 13:28:13,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 13:28:13,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 13:28:13,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 13:28:13,859 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 13:28:13,860 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 13:28:13,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-45.i [2024-11-03 13:28:15,069 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 13:28:15,194 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 13:28:15,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount50_file-45.i [2024-11-03 13:28:15,202 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188cb7f17/21618a8dec5340f388e707c6eafde96c/FLAGa38e6c859 [2024-11-03 13:28:15,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/188cb7f17/21618a8dec5340f388e707c6eafde96c [2024-11-03 13:28:15,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 13:28:15,216 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 13:28:15,217 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 13:28:15,217 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 13:28:15,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 13:28:15,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a9e1eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15, skipping insertion in model container [2024-11-03 13:28:15,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 13:28:15,363 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_amount50_file-45.i[915,928] [2024-11-03 13:28:15,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 13:28:15,422 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 13:28:15,430 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_amount50_file-45.i[915,928] [2024-11-03 13:28:15,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 13:28:15,464 INFO L204 MainTranslator]: Completed translation [2024-11-03 13:28:15,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15 WrapperNode [2024-11-03 13:28:15,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 13:28:15,466 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 13:28:15,466 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 13:28:15,466 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 13:28:15,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,476 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,492 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-03 13:28:15,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 13:28:15,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 13:28:15,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 13:28:15,493 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 13:28:15,501 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,513 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 13:28:15,513 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,513 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,523 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,526 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 13:28:15,535 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 13:28:15,535 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 13:28:15,535 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 13:28:15,536 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (1/1) ... [2024-11-03 13:28:15,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 13:28:15,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 13:28:15,564 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 13:28:15,566 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 13:28:15,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 13:28:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 13:28:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-03 13:28:15,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-03 13:28:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 13:28:15,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 13:28:15,648 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 13:28:15,650 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 13:28:15,858 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-03 13:28:15,858 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 13:28:15,866 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 13:28:15,866 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-03 13:28:15,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:28:15 BoogieIcfgContainer [2024-11-03 13:28:15,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 13:28:15,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 13:28:15,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 13:28:15,870 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 13:28:15,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:28:15" (1/3) ... [2024-11-03 13:28:15,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41374c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:28:15, skipping insertion in model container [2024-11-03 13:28:15,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:28:15" (2/3) ... [2024-11-03 13:28:15,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41374c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:28:15, skipping insertion in model container [2024-11-03 13:28:15,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:28:15" (3/3) ... [2024-11-03 13:28:15,872 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-45.i [2024-11-03 13:28:15,883 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 13:28:15,884 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 13:28:15,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 13:28:15,924 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;@63e5c802, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 13:28:15,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 13:28:15,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-03 13:28:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-03 13:28:15,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:28:15,934 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:15,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:28:15,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:28:15,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2077275396, now seen corresponding path program 1 times [2024-11-03 13:28:15,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:28:15,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496738821] [2024-11-03 13:28:15,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:28:15,945 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:28:15,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:28:15,946 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 13:28:15,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-03 13:28:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:28:16,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 13:28:16,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:28:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-03 13:28:16,076 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:28:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-03 13:28:16,152 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:28:16,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496738821] [2024-11-03 13:28:16,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [496738821] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 13:28:16,153 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 13:28:16,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 13:28:16,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068827852] [2024-11-03 13:28:16,155 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 13:28:16,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 13:28:16,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:28:16,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 13:28:16,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 13:28:16,173 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-03 13:28:16,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:28:16,189 INFO L93 Difference]: Finished difference Result 107 states and 180 transitions. [2024-11-03 13:28:16,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 13:28:16,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2024-11-03 13:28:16,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:28:16,194 INFO L225 Difference]: With dead ends: 107 [2024-11-03 13:28:16,195 INFO L226 Difference]: Without dead ends: 53 [2024-11-03 13:28:16,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 212 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 13:28:16,202 INFO L432 NwaCegarLoop]: 78 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, 78 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 13:28:16,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 13:28:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-03 13:28:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-03 13:28:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-03 13:28:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 78 transitions. [2024-11-03 13:28:16,228 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 78 transitions. Word has length 107 [2024-11-03 13:28:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:28:16,228 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 78 transitions. [2024-11-03 13:28:16,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-03 13:28:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 78 transitions. [2024-11-03 13:28:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-03 13:28:16,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:28:16,230 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:16,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Forceful destruction successful, exit code 0 [2024-11-03 13:28:16,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:28:16,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:28:16,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:28:16,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1761225468, now seen corresponding path program 1 times [2024-11-03 13:28:16,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:28:16,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [986832813] [2024-11-03 13:28:16,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:28:16,433 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:28:16,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:28:16,435 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 13:28:16,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-03 13:28:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:28:16,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-03 13:28:16,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:28:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-03 13:28:16,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:28:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-03 13:28:16,876 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:28:16,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [986832813] [2024-11-03 13:28:16,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [986832813] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 13:28:16,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 13:28:16,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 12 [2024-11-03 13:28:16,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615703133] [2024-11-03 13:28:16,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 13:28:16,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 13:28:16,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:28:16,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 13:28:16,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-03 13:28:16,880 INFO L87 Difference]: Start difference. First operand 53 states and 78 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-03 13:28:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:28:17,192 INFO L93 Difference]: Finished difference Result 112 states and 159 transitions. [2024-11-03 13:28:17,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-03 13:28:17,194 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2024-11-03 13:28:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:28:17,196 INFO L225 Difference]: With dead ends: 112 [2024-11-03 13:28:17,196 INFO L226 Difference]: Without dead ends: 62 [2024-11-03 13:28:17,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-11-03 13:28:17,198 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 79 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 13:28:17,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 155 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 13:28:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-03 13:28:17,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-03 13:28:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-03 13:28:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2024-11-03 13:28:17,217 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 107 [2024-11-03 13:28:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:28:17,218 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2024-11-03 13:28:17,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-03 13:28:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2024-11-03 13:28:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-03 13:28:17,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:28:17,221 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:28:17,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Ended with exit code 0 [2024-11-03 13:28:17,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:28:17,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:28:17,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:28:17,425 INFO L85 PathProgramCache]: Analyzing trace with hash 831097206, now seen corresponding path program 1 times [2024-11-03 13:28:17,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:28:17,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [291842700] [2024-11-03 13:28:17,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:28:17,426 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:28:17,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:28:17,427 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 13:28:17,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-03 13:28:17,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:28:17,486 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-03 13:28:17,490 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 13:28:28,131 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse3 ((_ sign_extend 24) ~var_1_12~0))) (let ((.cse0 ((_ sign_extend 24) ~var_1_13~0)) (.cse2 (bvneg .cse3)) (.cse1 ((_ sign_extend 24) ~var_1_11~0))) (and (not (bvsgt .cse0 .cse1)) (not (bvslt .cse0 .cse2)) (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse2))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse1)) (bvslt .cse3 (_ bv0 32)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse5 ((_ sign_extend 24) ~var_1_12~0)) (.cse4 ((_ sign_extend 24) ~var_1_13~0)) (.cse6 ((_ sign_extend 24) ~var_1_11~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse4))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (not (bvslt .cse5 (_ bv0 32))) (bvslt .cse4 (bvneg .cse5)) (bvsgt .cse4 .cse6) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse6)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse7 ((_ sign_extend 24) ~var_1_13~0)) (.cse8 ((_ sign_extend 24) ~var_1_11~0))) (and (not (bvsgt .cse7 .cse8)) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse8)))) (not (bvslt .cse7 ((_ sign_extend 24) ~var_1_12~0))) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse8))) (bvslt .cse8 (_ bv0 32))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse12 ((_ sign_extend 24) ~var_1_12~0))) (let ((.cse9 ((_ sign_extend 24) ~var_1_11~0)) (.cse11 ((_ sign_extend 24) ~var_1_13~0)) (.cse10 (bvneg .cse12))) (and (not (bvslt .cse9 .cse10)) (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse10))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse9)) (not (bvslt .cse11 .cse12)) (bvslt .cse11 .cse10))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse13 ((_ sign_extend 24) ~var_1_12~0)) (.cse14 ((_ sign_extend 24) ~var_1_11~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse13))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (not (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse13)) (not (bvslt .cse13 (_ bv0 32))) (bvslt .cse14 (bvneg .cse13)) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse14)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse15 ((_ sign_extend 24) ~var_1_11~0)) (.cse16 ((_ sign_extend 24) ~var_1_12~0))) (and (not (bvsgt ((_ sign_extend 24) ~var_1_13~0) .cse15)) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse15)))) (bvslt .cse15 (bvneg .cse16)) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse15))) (bvslt .cse15 .cse16)))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse19 ((_ sign_extend 24) ~var_1_11~0)) (.cse18 ((_ sign_extend 24) ~var_1_13~0)) (.cse17 ((_ sign_extend 24) ~var_1_12~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse17))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (not (bvsgt .cse18 .cse19)) (= c_~var_1_10~0 ((_ extract 7 0) .cse19)) (not (bvslt .cse18 .cse17)) (not (bvslt .cse17 (_ bv0 32)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse20 ((_ sign_extend 24) ~var_1_12~0)) (.cse21 ((_ sign_extend 24) ~var_1_11~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse20))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse21)) (not (bvslt .cse20 (_ bv0 32))) (not (bvslt .cse21 .cse20)) (bvsgt ((_ sign_extend 24) ~var_1_13~0) .cse21)))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse23 ((_ sign_extend 24) ~var_1_11~0)) (.cse22 (bvneg ((_ sign_extend 24) ~var_1_12~0)))) (and (not (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse22)) (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse22))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse23)) (not (bvslt .cse23 (_ bv0 32))) (bvslt .cse23 .cse22)))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse25 ((_ sign_extend 24) ~var_1_11~0))) (let ((.cse24 ((_ extract 7 0) .cse25)) (.cse26 ((_ sign_extend 24) ~var_1_12~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (bvnot ((_ sign_extend 24) .cse24))) (= c_~var_1_10~0 .cse24) (not (bvslt .cse25 (_ bv0 32))) (bvslt ((_ sign_extend 24) ~var_1_13~0) (bvneg .cse26)) (bvslt .cse25 .cse26))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse28 ((_ sign_extend 24) ~var_1_12~0)) (.cse27 ((_ sign_extend 24) ~var_1_13~0)) (.cse29 ((_ sign_extend 24) ~var_1_11~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse27))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (bvslt .cse27 (bvneg .cse28)) (not (bvslt .cse29 .cse28)) (bvsgt .cse27 .cse29) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse29))) (bvslt .cse29 (_ bv0 32))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse30 ((_ sign_extend 24) ~var_1_13~0)) (.cse31 ((_ sign_extend 24) ~var_1_11~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse30))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse31)) (not (bvslt .cse31 (_ bv0 32))) (bvslt .cse30 (bvneg ((_ sign_extend 24) ~var_1_12~0))) (bvsgt .cse30 .cse31)))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse32 ((_ sign_extend 24) ~var_1_13~0)) (.cse33 ((_ sign_extend 24) ~var_1_11~0))) (and (not (bvsgt .cse32 .cse33)) (not (bvslt .cse32 (bvneg ((_ sign_extend 24) ~var_1_12~0)))) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse33)))) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse33))) (bvslt .cse33 (_ bv0 32))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse36 ((_ sign_extend 24) ~var_1_12~0))) (let ((.cse35 (bvneg .cse36)) (.cse34 ((_ sign_extend 24) ~var_1_11~0))) (and (not (bvslt .cse34 .cse35)) (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse35))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse34)) (bvsgt ((_ sign_extend 24) ~var_1_13~0) .cse34) (bvslt .cse36 (_ bv0 32)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse38 ((_ sign_extend 24) ~var_1_11~0)) (.cse37 ((_ sign_extend 24) ~var_1_12~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse37))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse38)) (not (bvslt .cse37 (_ bv0 32))) (bvslt ((_ sign_extend 24) ~var_1_13~0) (bvneg .cse37)) (not (bvslt .cse38 .cse37))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse40 ((_ sign_extend 24) ~var_1_11~0))) (let ((.cse39 ((_ sign_extend 24) ~var_1_13~0)) (.cse42 ((_ extract 7 0) .cse40)) (.cse41 ((_ sign_extend 24) ~var_1_12~0))) (and (not (bvsgt .cse39 .cse40)) (not (bvslt .cse39 (bvneg .cse41))) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (bvnot ((_ sign_extend 24) .cse42))) (= c_~var_1_10~0 .cse42) (not (bvslt .cse40 (_ bv0 32))) (bvslt .cse40 .cse41))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse45 ((_ sign_extend 24) ~var_1_12~0))) (let ((.cse43 (bvneg .cse45)) (.cse44 ((_ sign_extend 24) ~var_1_11~0))) (and (not (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse43)) (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse43))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse44))) (bvslt .cse44 .cse45) (bvslt .cse45 (_ bv0 32)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse46 ((_ sign_extend 24) ~var_1_13~0)) (.cse47 ((_ sign_extend 24) ~var_1_11~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse46))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse47)) (not (bvslt .cse47 (_ bv0 32))) (bvslt .cse46 ((_ sign_extend 24) ~var_1_12~0)) (bvsgt .cse46 .cse47)))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse48 ((_ sign_extend 24) ~var_1_13~0)) (.cse50 ((_ sign_extend 24) ~var_1_11~0)) (.cse49 ((_ sign_extend 24) ~var_1_12~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse48))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (not (bvslt .cse48 .cse49)) (bvslt .cse48 (bvneg .cse49)) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse50))) (bvslt .cse50 .cse49)))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse52 ((_ sign_extend 24) ~var_1_11~0)) (.cse51 ((_ sign_extend 24) ~var_1_12~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse51))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse52)) (not (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse51)) (not (bvslt .cse52 (_ bv0 32))) (bvslt .cse52 .cse51)))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse55 ((_ sign_extend 24) ~var_1_12~0))) (let ((.cse54 (bvneg .cse55)) (.cse53 ((_ sign_extend 24) ~var_1_11~0))) (and (not (bvslt .cse53 .cse54)) (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse54))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (= c_~var_1_10~0 ((_ extract 7 0) .cse53)) (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse55) (bvslt .cse55 (_ bv0 32)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse58 ((_ sign_extend 24) ~var_1_12~0))) (let ((.cse56 (bvneg .cse58)) (.cse57 ((_ sign_extend 24) ~var_1_11~0))) (and (not (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse56)) (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse56))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (not (bvslt .cse57 .cse58)) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse57))) (bvslt .cse57 (_ bv0 32)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse60 ((_ sign_extend 24) ~var_1_12~0)) (.cse61 ((_ sign_extend 24) ~var_1_13~0)) (.cse59 ((_ sign_extend 24) ~var_1_11~0))) (and (not (bvslt .cse59 (bvneg .cse60))) (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse61))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (bvslt .cse61 .cse60) (bvsgt .cse61 .cse59) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse59))) (bvslt .cse59 (_ bv0 32))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse62 ((_ sign_extend 24) ~var_1_13~0)) (.cse64 ((_ sign_extend 24) ~var_1_11~0)) (.cse63 ((_ sign_extend 24) ~var_1_12~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse62))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (bvslt .cse62 .cse63) (bvsgt .cse62 .cse64) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse64))) (bvslt .cse63 (_ bv0 32))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse66 ((_ sign_extend 24) ~var_1_12~0)) (.cse65 ((_ sign_extend 24) ~var_1_11~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse65)))) (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse66) (not (bvslt .cse65 .cse66)) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse65))) (bvslt .cse65 (_ bv0 32))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse68 ((_ sign_extend 24) ~var_1_11~0))) (let ((.cse67 ((_ extract 7 0) .cse68)) (.cse69 ((_ sign_extend 24) ~var_1_12~0))) (and (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (bvnot ((_ sign_extend 24) .cse67))) (= c_~var_1_10~0 .cse67) (not (bvslt .cse68 (_ bv0 32))) (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse69) (bvslt .cse68 (bvneg .cse69)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse72 ((_ sign_extend 24) ~var_1_12~0))) (let ((.cse70 ((_ sign_extend 24) ~var_1_13~0)) (.cse71 (bvneg .cse72)) (.cse73 ((_ sign_extend 24) ~var_1_11~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse70))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (not (bvslt .cse70 .cse71)) (bvslt .cse70 .cse72) (bvslt .cse73 .cse71) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse73))))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse75 ((_ sign_extend 24) ~var_1_11~0))) (let ((.cse76 ((_ extract 7 0) .cse75)) (.cse74 ((_ sign_extend 24) ~var_1_13~0)) (.cse77 ((_ sign_extend 24) ~var_1_12~0))) (and (not (bvsgt .cse74 .cse75)) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (bvnot ((_ sign_extend 24) .cse76))) (= c_~var_1_10~0 .cse76) (not (bvslt .cse74 .cse77)) (not (bvslt .cse75 (_ bv0 32))) (bvslt .cse75 (bvneg .cse77)))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse79 ((_ sign_extend 24) ~var_1_13~0)) (.cse80 ((_ sign_extend 24) ~var_1_11~0)) (.cse78 ((_ sign_extend 24) ~var_1_12~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse78))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (not (bvslt .cse79 (bvneg .cse78))) (= c_~var_1_10~0 ((_ extract 7 0) .cse80)) (bvslt .cse79 .cse78) (not (bvslt .cse80 .cse78))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse82 (bvneg ((_ sign_extend 24) ~var_1_12~0))) (.cse81 ((_ sign_extend 24) ~var_1_11~0))) (and (not (bvslt .cse81 .cse82)) (= |c_ULTIMATE.start_step_~stepLocal_0~0#1| (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse81)))) (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse82) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse81))) (bvslt .cse81 (_ bv0 32))))) (exists ((~var_1_13~0 (_ BitVec 8)) (~var_1_12~0 (_ BitVec 8)) (~var_1_11~0 (_ BitVec 8))) (let ((.cse83 ((_ sign_extend 24) ~var_1_12~0)) (.cse84 ((_ sign_extend 24) ~var_1_11~0))) (and (= (bvnot ((_ sign_extend 24) ((_ extract 7 0) .cse83))) |c_ULTIMATE.start_step_~stepLocal_0~0#1|) (not (bvslt .cse84 (bvneg .cse83))) (not (bvslt ((_ sign_extend 24) ~var_1_13~0) .cse83)) (= c_~var_1_10~0 ((_ extract 7 0) (bvneg .cse84))) (bvslt .cse84 (_ bv0 32)))))) is different from true [2024-11-03 13:28:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-03 13:28:28,894 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 13:28:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-03 13:28:29,021 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 13:28:29,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [291842700] [2024-11-03 13:28:29,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [291842700] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 13:28:29,021 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 13:28:29,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 3] imperfect sequences [] total 6 [2024-11-03 13:28:29,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157406807] [2024-11-03 13:28:29,022 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 13:28:29,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 13:28:29,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 13:28:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 13:28:29,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-03 13:28:29,023 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-03 13:28:56,763 WARN L286 SmtUtils]: Spent 21.24s on a formula simplification. DAG size of input: 256 DAG size of output: 732 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-03 13:28:59,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:00,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:02,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:03,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:06,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:07,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:09,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:10,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:14,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.64s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:18,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:20,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:22,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:24,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:25,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:27,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-03 13:29:30,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 13:29:30,572 INFO L93 Difference]: Finished difference Result 206 states and 270 transitions. [2024-11-03 13:29:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 13:29:30,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2024-11-03 13:29:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 13:29:30,581 INFO L225 Difference]: With dead ends: 206 [2024-11-03 13:29:30,581 INFO L226 Difference]: Without dead ends: 149 [2024-11-03 13:29:30,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=23, Invalid=35, Unknown=2, NotChecked=12, Total=72 [2024-11-03 13:29:30,582 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 101 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2024-11-03 13:29:30,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 306 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 125 Invalid, 1 Unknown, 177 Unchecked, 34.9s Time] [2024-11-03 13:29:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-03 13:29:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2024-11-03 13:29:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 86 states have (on average 1.1395348837209303) internal successors, (98), 88 states have internal predecessors, (98), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-03 13:29:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2024-11-03 13:29:30,629 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 108 [2024-11-03 13:29:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 13:29:30,630 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2024-11-03 13:29:30,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-03 13:29:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2024-11-03 13:29:30,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-03 13:29:30,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 13:29:30,632 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:29:30,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Forceful destruction successful, exit code 0 [2024-11-03 13:29:30,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:29:30,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 13:29:30,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 13:29:30,835 INFO L85 PathProgramCache]: Analyzing trace with hash -242274181, now seen corresponding path program 1 times [2024-11-03 13:29:30,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 13:29:30,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031867250] [2024-11-03 13:29:30,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 13:29:30,835 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-03 13:29:30,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-03 13:29:30,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-03 13:29:30,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-03 13:29:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 13:29:30,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-03 13:29:30,891 INFO L278 TraceCheckSpWp]: Computing forward predicates...