/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 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 09:19:12,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 09:19:12,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 09:19:12,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 09:19:12,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 09:19:12,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 09:19:12,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 09:19:12,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 09:19:12,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 09:19:12,639 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 09:19:12,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 09:19:12,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 09:19:12,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 09:19:12,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 09:19:12,641 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 09:19:12,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 09:19:12,642 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 09:19:12,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 09:19:12,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 09:19:12,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 09:19:12,643 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 09:19:12,646 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 09:19:12,647 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 09:19:12,647 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 09:19:12,647 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 09:19:12,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 09:19:12,648 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 09:19:12,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 09:19:12,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 09:19:12,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 09:19:12,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 09:19:12,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 09:19:12,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 09:19:12,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 09:19:12,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 09:19:12,650 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 09:19:12,650 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 09:19:12,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 09:19:12,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 09:19:12,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 09:19:12,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 09:19:12,654 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 -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:19:12,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 09:19:12,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 09:19:12,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 09:19:12,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 09:19:12,947 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 09:19:12,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c [2024-11-05 09:19:14,410 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 09:19:14,717 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 09:19:14,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c [2024-11-05 09:19:14,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4edf9859f/88d312a2af1d405e84b5d1dd8b82753b/FLAGd4298cbfb [2024-11-05 09:19:14,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4edf9859f/88d312a2af1d405e84b5d1dd8b82753b [2024-11-05 09:19:14,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 09:19:14,756 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 09:19:14,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 09:19:14,758 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 09:19:14,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 09:19:14,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:19:14" (1/1) ... [2024-11-05 09:19:14,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@147da717 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:14, skipping insertion in model container [2024-11-05 09:19:14,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 09:19:14" (1/1) ... [2024-11-05 09:19:14,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 09:19:15,011 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c[1280,1293] [2024-11-05 09:19:15,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 09:19:15,199 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 09:19:15,211 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c[1280,1293] [2024-11-05 09:19:15,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 09:19:15,361 INFO L204 MainTranslator]: Completed translation [2024-11-05 09:19:15,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15 WrapperNode [2024-11-05 09:19:15,362 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 09:19:15,362 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 09:19:15,363 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 09:19:15,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 09:19:15,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,445 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 913 [2024-11-05 09:19:15,446 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 09:19:15,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 09:19:15,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 09:19:15,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 09:19:15,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,499 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-05 09:19:15,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,540 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,548 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 09:19:15,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 09:19:15,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 09:19:15,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 09:19:15,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (1/1) ... [2024-11-05 09:19:15,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 09:19:15,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 09:19:15,605 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-05 09:19:15,611 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-05 09:19:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 09:19:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 09:19:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 09:19:15,635 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 09:19:15,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 09:19:15,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 09:19:15,876 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 09:19:15,878 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 09:19:16,671 INFO L? ?]: Removed 271 outVars from TransFormulas that were not future-live. [2024-11-05 09:19:16,672 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 09:19:16,683 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 09:19:16,684 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 09:19:16,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:19:16 BoogieIcfgContainer [2024-11-05 09:19:16,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 09:19:16,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 09:19:16,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 09:19:16,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 09:19:16,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 09:19:14" (1/3) ... [2024-11-05 09:19:16,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a944bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:19:16, skipping insertion in model container [2024-11-05 09:19:16,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 09:19:15" (2/3) ... [2024-11-05 09:19:16,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a944bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 09:19:16, skipping insertion in model container [2024-11-05 09:19:16,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 09:19:16" (3/3) ... [2024-11-05 09:19:16,694 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d16_e0.c [2024-11-05 09:19:16,712 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 09:19:16,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 09:19:16,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 09:19:16,774 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;@6bdce00b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 09:19:16,774 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 09:19:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-05 09:19:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-05 09:19:16,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:19:16,786 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 09:19:16,787 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:19:16,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:19:16,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1944675641, now seen corresponding path program 1 times [2024-11-05 09:19:16,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:19:16,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [782083464] [2024-11-05 09:19:16,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:19:16,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:19:16,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:19:16,806 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:19:16,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 09:19:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:19:17,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 09:19:17,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:19:17,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-05 09:19:17,282 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:19:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-05 09:19:17,315 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:19:17,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [782083464] [2024-11-05 09:19:17,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [782083464] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 09:19:17,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 09:19:17,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 09:19:17,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721329822] [2024-11-05 09:19:17,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 09:19:17,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 09:19:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:19:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 09:19:17,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 09:19:17,362 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 09:19:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:19:17,380 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2024-11-05 09:19:17,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 09:19:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-11-05 09:19:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:19:17,389 INFO L225 Difference]: With dead ends: 35 [2024-11-05 09:19:17,389 INFO L226 Difference]: Without dead ends: 17 [2024-11-05 09:19:17,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-05 09:19:17,396 INFO L432 NwaCegarLoop]: 19 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, 19 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-05 09:19:17,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 09:19:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-05 09:19:17,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-05 09:19:17,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-05 09:19:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-05 09:19:17,427 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 23 [2024-11-05 09:19:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:19:17,427 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-05 09:19:17,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 09:19:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-05 09:19:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-05 09:19:17,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:19:17,429 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 09:19:17,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 09:19:17,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:19:17,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:19:17,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:19:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash 265954675, now seen corresponding path program 1 times [2024-11-05 09:19:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:19:17,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [798993224] [2024-11-05 09:19:17,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:19:17,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:19:17,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:19:17,638 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:19:17,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 09:19:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:19:18,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-05 09:19:18,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:19:18,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 09:19:18,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:19:18,519 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 09:19:18,520 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:19:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [798993224] [2024-11-05 09:19:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [798993224] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 09:19:18,520 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 09:19:18,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-05 09:19:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574701168] [2024-11-05 09:19:18,521 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 09:19:18,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 09:19:18,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:19:18,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 09:19:18,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 09:19:18,524 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-05 09:19:18,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:19:18,723 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-05 09:19:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 09:19:18,724 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 23 [2024-11-05 09:19:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:19:18,726 INFO L225 Difference]: With dead ends: 27 [2024-11-05 09:19:18,726 INFO L226 Difference]: Without dead ends: 25 [2024-11-05 09:19:18,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 09:19:18,727 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 09:19:18,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 09:19:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-05 09:19:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-05 09:19:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-05 09:19:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-05 09:19:18,737 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-11-05 09:19:18,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:19:18,739 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-05 09:19:18,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-05 09:19:18,740 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-05 09:19:18,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-05 09:19:18,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:19:18,741 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-05 09:19:18,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 09:19:18,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:19:18,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:19:18,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:19:18,945 INFO L85 PathProgramCache]: Analyzing trace with hash 416519459, now seen corresponding path program 1 times [2024-11-05 09:19:18,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:19:18,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454807225] [2024-11-05 09:19:18,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:19:18,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:19:18,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:19:18,952 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:19:18,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 09:19:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:19:19,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-05 09:19:19,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:19:21,158 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-05 09:19:21,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:19:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-05 09:19:45,288 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 09:19:45,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454807225] [2024-11-05 09:19:45,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1454807225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 09:19:45,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 09:19:45,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2024-11-05 09:19:45,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105601100] [2024-11-05 09:19:45,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 09:19:45,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 09:19:45,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 09:19:45,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 09:19:45,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-05 09:19:45,292 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-05 09:19:45,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 09:19:45,887 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-05 09:19:45,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 09:19:45,888 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) Word has length 44 [2024-11-05 09:19:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 09:19:45,889 INFO L225 Difference]: With dead ends: 36 [2024-11-05 09:19:45,889 INFO L226 Difference]: Without dead ends: 34 [2024-11-05 09:19:45,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2024-11-05 09:19:45,891 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 09:19:45,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 65 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 09:19:45,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-05 09:19:45,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-05 09:19:45,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-05 09:19:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-05 09:19:45,898 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 44 [2024-11-05 09:19:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 09:19:45,899 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-05 09:19:45,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 15 states have internal predecessors, (34), 6 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-05 09:19:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-05 09:19:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-05 09:19:45,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 09:19:45,901 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-05 09:19:45,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-05 09:19:46,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:19:46,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 09:19:46,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 09:19:46,102 INFO L85 PathProgramCache]: Analyzing trace with hash 223728499, now seen corresponding path program 2 times [2024-11-05 09:19:46,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 09:19:46,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1574532867] [2024-11-05 09:19:46,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 09:19:46,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 09:19:46,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 09:19:46,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 09:19:46,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 09:19:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 09:19:47,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-05 09:19:47,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 09:19:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-05 09:19:50,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 09:19:56,503 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse15 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_132~0#1|))) (let ((.cse6 (= |c_ULTIMATE.start_main_~state_128~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |c_ULTIMATE.start_main_~state_96~0#1|))) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_109~0#1|)) (.cse13 (not .cse15)) (.cse14 (or (forall ((|v_ULTIMATE.start_main_~var_155_arg_0~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_151_arg_1~0#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_155_arg_0~0#1_18|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_151_arg_1~0#1_17|))))))))))) (_ bv0 8))) .cse15))) (let ((.cse9 (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_13~0#1|) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_12~0#1|)))))))) (.cse7 (forall ((|v_ULTIMATE.start_main_~var_99_arg_2~0#1_17| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_128~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~var_99_arg_2~0#1_17|)))) (.cse5 (and (or (forall ((|v_ULTIMATE.start_main_~var_112_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_126_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_155_arg_0~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_115_arg_1~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_115_arg_1~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_112_arg_1~0#1_16|) .cse12)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_126_arg_1~0#1_16|))))))) (_ bv0 32))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_155_arg_0~0#1_18|)))) .cse8)))) .cse13) .cse14)) (.cse0 (and (or (forall ((|v_ULTIMATE.start_main_~var_112_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_126_arg_1~0#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_155_arg_0~0#1_18| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_115_arg_1~0#1_16| (_ BitVec 8))) (= ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_115_arg_1~0#1_16|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_112_arg_1~0#1_16|) .cse12)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_126_arg_1~0#1_16|))))))) (_ bv1 32))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_155_arg_0~0#1_18|)))))) (_ bv0 8))) .cse13) .cse14)) (.cse2 (forall ((|v_ULTIMATE.start_main_~var_99_arg_2~0#1_17| (_ BitVec 64))) (not (= |c_ULTIMATE.start_main_~state_128~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~var_99_arg_2~0#1_17|))))) (.cse4 (not .cse6))) (and (or (let ((.cse3 (= ((_ extract 7 0) (bvand .cse8 (_ bv254 32))) (_ bv0 8)))) (let ((.cse1 (not .cse3))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse3 .cse4))) (or .cse5 (and (or .cse6 .cse3) (or .cse1 .cse7)))))) .cse9) (or (not .cse9) (let ((.cse11 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 (_ bv255 32)))))) (let ((.cse10 (not .cse11))) (and (or (and (or .cse7 .cse10) (or .cse6 .cse11)) .cse5) (or .cse0 (and (or .cse10 .cse2) (or .cse11 .cse4))))))))))) is different from false [2024-11-05 09:20:34,511 WARN L286 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 366 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)