/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -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_d8_e0.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 06:26:20,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 06:26:20,118 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-06 06:26:20,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 06:26:20,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 06:26:20,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 06:26:20,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 06:26:20,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 06:26:20,158 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 06:26:20,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 06:26:20,159 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 06:26:20,159 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 06:26:20,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 06:26:20,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 06:26:20,161 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 06:26:20,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 06:26:20,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 06:26:20,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 06:26:20,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 06:26:20,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 06:26:20,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 06:26:20,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 06:26:20,167 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 06:26:20,168 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 06:26:20,168 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 06:26:20,168 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 06:26:20,168 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 06:26:20,169 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 06:26:20,169 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 06:26:20,169 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 06:26:20,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 06:26:20,170 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:26:20,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 06:26:20,172 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 06:26:20,172 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 06:26:20,173 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 06:26:20,173 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 06:26:20,173 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 06:26:20,173 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 06:26:20,173 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 06:26:20,173 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 06:26:20,174 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 06:26:20,448 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 06:26:20,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 06:26:20,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 06:26:20,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 06:26:20,482 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 06:26:20,483 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_d8_e0.c [2024-11-06 06:26:22,147 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 06:26:22,425 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 06:26:22,425 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2024-11-06 06:26:22,440 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a133ea1f7/0f0d17ec6c974891ac8a784f69057d90/FLAG3365ad658 [2024-11-06 06:26:22,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a133ea1f7/0f0d17ec6c974891ac8a784f69057d90 [2024-11-06 06:26:22,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 06:26:22,459 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 06:26:22,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 06:26:22,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 06:26:22,468 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 06:26:22,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:26:22" (1/1) ... [2024-11-06 06:26:22,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d725664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:22, skipping insertion in model container [2024-11-06 06:26:22,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:26:22" (1/1) ... [2024-11-06 06:26:22,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 06:26:22,772 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_d8_e0.c[1279,1292] [2024-11-06 06:26:22,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:26:22,977 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 06:26:22,997 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_d8_e0.c[1279,1292] [2024-11-06 06:26:23,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 06:26:23,127 INFO L204 MainTranslator]: Completed translation [2024-11-06 06:26:23,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23 WrapperNode [2024-11-06 06:26:23,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 06:26:23,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 06:26:23,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 06:26:23,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 06:26:23,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,213 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 639 [2024-11-06 06:26:23,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 06:26:23,215 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 06:26:23,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 06:26:23,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 06:26:23,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,283 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-06 06:26:23,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,312 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,329 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 06:26:23,347 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 06:26:23,347 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 06:26:23,347 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 06:26:23,348 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (1/1) ... [2024-11-06 06:26:23,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 06:26:23,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 06:26:23,406 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-06 06:26:23,412 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-06 06:26:23,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 06:26:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 06:26:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 06:26:23,445 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 06:26:23,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 06:26:23,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 06:26:23,672 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 06:26:23,674 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 06:26:24,405 INFO L? ?]: Removed 198 outVars from TransFormulas that were not future-live. [2024-11-06 06:26:24,407 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 06:26:24,423 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 06:26:24,423 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 06:26:24,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:26:24 BoogieIcfgContainer [2024-11-06 06:26:24,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 06:26:24,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 06:26:24,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 06:26:24,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 06:26:24,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:26:22" (1/3) ... [2024-11-06 06:26:24,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1071fd72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:26:24, skipping insertion in model container [2024-11-06 06:26:24,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:26:23" (2/3) ... [2024-11-06 06:26:24,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1071fd72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:26:24, skipping insertion in model container [2024-11-06 06:26:24,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:26:24" (3/3) ... [2024-11-06 06:26:24,434 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w64_d8_e0.c [2024-11-06 06:26:24,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 06:26:24,453 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 06:26:24,527 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 06:26:24,536 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;@40dcf92c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 06:26:24,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 06:26:24,577 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-06 06:26:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 06:26:24,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:26:24,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 06:26:24,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:26:24,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:26:24,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1944675641, now seen corresponding path program 1 times [2024-11-06 06:26:24,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:26:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236136750] [2024-11-06 06:26:24,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:26:24,620 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-06 06:26:24,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:26:24,624 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-06 06:26:24,631 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-06 06:26:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:26:25,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 06:26:25,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:25,051 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-06 06:26:25,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 06:26:25,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:26:25,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236136750] [2024-11-06 06:26:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236136750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 06:26:25,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 06:26:25,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 06:26:25,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873202577] [2024-11-06 06:26:25,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 06:26:25,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 06:26:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:26:25,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 06:26:25,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 06:26:25,093 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-06 06:26:25,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:26:25,123 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2024-11-06 06:26:25,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 06:26:25,126 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-06 06:26:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:26:25,133 INFO L225 Difference]: With dead ends: 35 [2024-11-06 06:26:25,133 INFO L226 Difference]: Without dead ends: 17 [2024-11-06 06:26:25,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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-06 06:26:25,142 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-06 06:26:25,144 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-06 06:26:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-06 06:26:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-11-06 06:26:25,180 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-06 06:26:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2024-11-06 06:26:25,183 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 23 [2024-11-06 06:26:25,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:26:25,184 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2024-11-06 06:26:25,184 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-06 06:26:25,184 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2024-11-06 06:26:25,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 06:26:25,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:26:25,186 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 06:26:25,193 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-06 06:26:25,386 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-06 06:26:25,387 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:26:25,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:26:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash 265954675, now seen corresponding path program 1 times [2024-11-06 06:26:25,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:26:25,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653801742] [2024-11-06 06:26:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:26:25,389 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-06 06:26:25,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:26:25,391 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-06 06:26:25,393 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-06 06:26:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:26:25,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 06:26:25,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:25,904 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-06 06:26:25,905 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 06:26:25,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:26:25,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653801742] [2024-11-06 06:26:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653801742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 06:26:25,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 06:26:25,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 06:26:25,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828108752] [2024-11-06 06:26:25,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 06:26:25,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 06:26:25,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:26:25,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 06:26:25,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 06:26:25,910 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 06:26:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:26:26,047 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-06 06:26:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 06:26:26,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2024-11-06 06:26:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:26:26,049 INFO L225 Difference]: With dead ends: 27 [2024-11-06 06:26:26,049 INFO L226 Difference]: Without dead ends: 25 [2024-11-06 06:26:26,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 06:26:26,052 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 06:26:26,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 06:26:26,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-06 06:26:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-06 06:26:26,062 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-06 06:26:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-06 06:26:26,064 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-11-06 06:26:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:26:26,067 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-06 06:26:26,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 06:26:26,068 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-06 06:26:26,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-06 06:26:26,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:26:26,070 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-06 06:26:26,079 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 (3)] Forceful destruction successful, exit code 0 [2024-11-06 06:26:26,270 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-06 06:26:26,271 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:26:26,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:26:26,272 INFO L85 PathProgramCache]: Analyzing trace with hash 416519459, now seen corresponding path program 1 times [2024-11-06 06:26:26,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:26:26,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359490476] [2024-11-06 06:26:26,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:26:26,274 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-06 06:26:26,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:26:26,278 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-06 06:26:26,278 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-06 06:26:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:26:26,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-06 06:26:26,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:27,557 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-06 06:26:27,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:26:27,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:26:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359490476] [2024-11-06 06:26:27,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359490476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:26:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1795919483] [2024-11-06 06:26:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 06:26:27,741 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 06:26:27,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 06:26:27,767 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 06:26:27,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-06 06:26:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 06:26:28,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-06 06:26:28,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:28,943 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-06 06:26:28,943 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:26:29,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1795919483] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:26:29,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 06:26:29,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-06 06:26:29,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703058698] [2024-11-06 06:26:29,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 06:26:29,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 06:26:29,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:26:29,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 06:26:29,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-06 06:26:29,064 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 06:26:29,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 06:26:29,412 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-06 06:26:29,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 06:26:29,413 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2024-11-06 06:26:29,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 06:26:29,414 INFO L225 Difference]: With dead ends: 36 [2024-11-06 06:26:29,414 INFO L226 Difference]: Without dead ends: 34 [2024-11-06 06:26:29,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-06 06:26:29,416 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 06:26:29,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 76 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 06:26:29,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-06 06:26:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-06 06:26:29,424 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-06 06:26:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2024-11-06 06:26:29,426 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 44 [2024-11-06 06:26:29,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 06:26:29,426 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2024-11-06 06:26:29,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-06 06:26:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2024-11-06 06:26:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-06 06:26:29,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 06:26:29,430 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-06 06:26:29,442 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-06 06:26:29,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-06 06:26:29,831 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-06 06:26:29,832 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 06:26:29,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 06:26:29,833 INFO L85 PathProgramCache]: Analyzing trace with hash 223728499, now seen corresponding path program 2 times [2024-11-06 06:26:29,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 06:26:29,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172451125] [2024-11-06 06:26:29,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 06:26:29,834 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-06 06:26:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 06:26:29,838 INFO L229 MonitoredProcess]: Starting monitored process 6 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-06 06:26:29,839 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 (6)] Waiting until timeout for monitored process [2024-11-06 06:26:30,811 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 06:26:30,812 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 06:26:30,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-06 06:26:30,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:26:33,982 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-06 06:26:33,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:27:17,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 06:27:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172451125] [2024-11-06 06:27:17,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172451125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:27:17,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [670775305] [2024-11-06 06:27:17,264 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 06:27:17,264 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 06:27:17,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 06:27:17,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 06:27:17,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-06 06:27:18,245 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 06:27:18,246 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 06:27:18,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-06 06:27:18,310 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 06:27:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 12 proven. 55 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-06 06:27:44,338 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 06:27:53,705 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse1 (forall ((|v_ULTIMATE.start_main_~var_110_arg_1~0#1_21| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_111~0#1|))) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_110_arg_1~0#1_21|)))))))))))))) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_68~0#1|))) (let ((.cse2 (and .cse1 (forall ((|v_ULTIMATE.start_main_~var_74_arg_1~0#1_21| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_112_arg_2~0#1_20| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_71_arg_1~0#1_21| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_85_arg_1~0#1_21| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ 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 (_ bv0 32) ((_ 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_74_arg_1~0#1_21|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_71_arg_1~0#1_21|) .cse6)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_85_arg_1~0#1_21|))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_112_arg_2~0#1_20|))))))))))))) (let ((.cse3 (let ((.cse7 (= |c_ULTIMATE.start_main_~state_87~0#1| (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |c_ULTIMATE.start_main_~state_55~0#1|)))) (and (or (and .cse1 (forall ((|v_ULTIMATE.start_main_~var_74_arg_1~0#1_21| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_112_arg_2~0#1_20| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_71_arg_1~0#1_21| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_85_arg_1~0#1_21| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ 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 (_ bv1 32) ((_ 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_74_arg_1~0#1_21|) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_71_arg_1~0#1_21|) .cse6)))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_85_arg_1~0#1_21|))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_112_arg_2~0#1_20|))))))))))) (not .cse7)) (or .cse2 .cse7)))) (.cse5 (= (_ 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|))))))))) (and (or (let ((.cse0 (= ((_ extract 7 0) (bvand .cse4 (_ bv254 32))) (_ bv0 8)))) (and (or (not .cse0) (and (or .cse1 (forall ((|v_ULTIMATE.start_main_~var_58_arg_2~0#1_19| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~var_58_arg_2~0#1_19|) |c_ULTIMATE.start_main_~state_87~0#1|)))) (or .cse2 (forall ((|v_ULTIMATE.start_main_~var_58_arg_2~0#1_19| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~mask_SORT_3~0#1| |v_ULTIMATE.start_main_~var_58_arg_2~0#1_19|) |c_ULTIMATE.start_main_~state_87~0#1|))))) (or .cse0 .cse3))) .cse5) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 (_ bv255 32)))) .cse3 (not .cse5))))))) is different from false [2024-11-06 06:27:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [670775305] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 06:27:55,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 06:27:55,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2024-11-06 06:27:55,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66813514] [2024-11-06 06:27:55,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 06:27:55,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-06 06:27:55,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 06:27:55,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-06 06:27:55,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=436, Unknown=9, NotChecked=42, Total=552 [2024-11-06 06:27:55,119 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 21 states, 16 states have (on average 2.6875) internal successors, (43), 21 states have internal predecessors, (43), 11 states have call successors, (18), 1 states have call predecessors, (18), 2 states have return successors, (18), 8 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-06 06:27:59,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]