/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-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 01:53:03,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 01:53:03,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-06 01:53:03,444 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 01:53:03,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 01:53:03,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 01:53:03,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 01:53:03,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 01:53:03,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 01:53:03,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 01:53:03,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 01:53:03,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 01:53:03,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 01:53:03,482 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 01:53:03,482 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 01:53:03,483 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 01:53:03,483 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 01:53:03,483 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 01:53:03,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 01:53:03,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 01:53:03,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 01:53:03,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 01:53:03,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 01:53:03,485 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 01:53:03,485 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 01:53:03,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 01:53:03,486 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 01:53:03,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 01:53:03,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 01:53:03,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 01:53:03,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 01:53:03,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 01:53:03,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 01:53:03,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 01:53:03,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:53:03,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 01:53:03,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 01:53:03,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 01:53:03,488 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 01:53:03,489 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 01:53:03,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 01:53:03,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 01:53:03,489 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 01:53:03,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 01:53:03,490 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 01:53:03,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 01:53:03,749 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 01:53:03,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 01:53:03,752 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 01:53:03,753 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 01:53:03,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c [2024-11-06 01:53:05,164 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 01:53:05,314 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 01:53:05,315 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c [2024-11-06 01:53:05,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704f46768/bc2704de96164a61a51c3f9fdb6be0e0/FLAGf2e57c9f5 [2024-11-06 01:53:05,331 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/704f46768/bc2704de96164a61a51c3f9fdb6be0e0 [2024-11-06 01:53:05,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 01:53:05,334 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 01:53:05,335 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 01:53:05,335 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 01:53:05,339 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 01:53:05,340 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,341 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32adbbb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05, skipping insertion in model container [2024-11-06 01:53:05,341 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 01:53:05,505 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c[613,626] [2024-11-06 01:53:05,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:53:05,533 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 01:53:05,543 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/floats-nonlinear/color-magicseries2.c[613,626] [2024-11-06 01:53:05,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 01:53:05,568 INFO L204 MainTranslator]: Completed translation [2024-11-06 01:53:05,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05 WrapperNode [2024-11-06 01:53:05,568 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 01:53:05,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 01:53:05,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 01:53:05,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 01:53:05,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,582 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,601 INFO L138 Inliner]: procedures = 20, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2024-11-06 01:53:05,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 01:53:05,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 01:53:05,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 01:53:05,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 01:53:05,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,622 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2024-11-06 01:53:05,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,622 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,628 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 01:53:05,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 01:53:05,641 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 01:53:05,641 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 01:53:05,642 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (1/1) ... [2024-11-06 01:53:05,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 01:53:05,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 01:53:05,669 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 01:53:05,672 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 01:53:05,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 01:53:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 01:53:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 01:53:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-06 01:53:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-06 01:53:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 01:53:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-06 01:53:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-06 01:53:05,691 INFO L130 BoogieDeclarations]: Found specification of procedure check_domain [2024-11-06 01:53:05,691 INFO L138 BoogieDeclarations]: Found implementation of procedure check_domain [2024-11-06 01:53:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 01:53:05,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 01:53:05,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 01:53:05,757 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 01:53:05,759 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 01:53:05,984 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-06 01:53:05,985 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 01:53:05,997 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 01:53:05,997 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 01:53:05,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:53:05 BoogieIcfgContainer [2024-11-06 01:53:05,998 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 01:53:06,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 01:53:06,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 01:53:06,006 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 01:53:06,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 01:53:05" (1/3) ... [2024-11-06 01:53:06,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fcbe9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:53:06, skipping insertion in model container [2024-11-06 01:53:06,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 01:53:05" (2/3) ... [2024-11-06 01:53:06,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fcbe9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 01:53:06, skipping insertion in model container [2024-11-06 01:53:06,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 01:53:05" (3/3) ... [2024-11-06 01:53:06,009 INFO L112 eAbstractionObserver]: Analyzing ICFG color-magicseries2.c [2024-11-06 01:53:06,023 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 01:53:06,023 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 01:53:06,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 01:53:06,071 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;@5ce2a89b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 01:53:06,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 01:53:06,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-06 01:53:06,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 01:53:06,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:06,079 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:06,080 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:06,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1909413201, now seen corresponding path program 1 times [2024-11-06 01:53:06,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:06,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1560632707] [2024-11-06 01:53:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:06,098 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 01:53:06,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:06,102 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 01:53:06,106 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 01:53:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:06,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:53:06,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:06,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 01:53:06,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:06,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:06,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1560632707] [2024-11-06 01:53:06,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1560632707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:06,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 01:53:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689953321] [2024-11-06 01:53:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:06,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 01:53:06,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:06,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 01:53:06,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 01:53:06,362 INFO L87 Difference]: Start difference. First operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 33 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 01:53:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:06,431 INFO L93 Difference]: Finished difference Result 75 states and 108 transitions. [2024-11-06 01:53:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 01:53:06,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-06 01:53:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:06,441 INFO L225 Difference]: With dead ends: 75 [2024-11-06 01:53:06,441 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 01:53:06,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 01:53:06,447 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:06,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:06,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 01:53:06,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 01:53:06,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 01:53:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-11-06 01:53:06,488 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 17 [2024-11-06 01:53:06,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:06,488 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-11-06 01:53:06,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 01:53:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-11-06 01:53:06,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-06 01:53:06,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:06,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:06,494 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 01:53:06,691 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 01:53:06,692 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:06,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash 2092151088, now seen corresponding path program 1 times [2024-11-06 01:53:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033402020] [2024-11-06 01:53:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:06,694 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 01:53:06,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:06,695 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 01:53:06,698 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 01:53:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:06,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 01:53:06,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 01:53:06,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:06,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:06,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033402020] [2024-11-06 01:53:06,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033402020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:06,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:06,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 01:53:06,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982282316] [2024-11-06 01:53:06,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:06,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 01:53:06,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:06,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 01:53:06,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 01:53:06,792 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 01:53:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:06,810 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2024-11-06 01:53:06,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 01:53:06,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-06 01:53:06,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:06,813 INFO L225 Difference]: With dead ends: 43 [2024-11-06 01:53:06,814 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 01:53:06,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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 01:53:06,815 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:06,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 01:53:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 01:53:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 01:53:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2024-11-06 01:53:06,828 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 17 [2024-11-06 01:53:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:06,828 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2024-11-06 01:53:06,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 01:53:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2024-11-06 01:53:06,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-06 01:53:06,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:06,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:06,833 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 01:53:07,032 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 01:53:07,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:07,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:07,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1014348991, now seen corresponding path program 1 times [2024-11-06 01:53:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544327197] [2024-11-06 01:53:07,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:07,034 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 01:53:07,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:07,036 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 01:53:07,038 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 01:53:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:07,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 01:53:07,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 01:53:07,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:07,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:07,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544327197] [2024-11-06 01:53:07,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544327197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:07,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:07,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 01:53:07,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694741367] [2024-11-06 01:53:07,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:07,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 01:53:07,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:07,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 01:53:07,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 01:53:07,175 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 01:53:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:07,260 INFO L93 Difference]: Finished difference Result 76 states and 103 transitions. [2024-11-06 01:53:07,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 01:53:07,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-06 01:53:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:07,264 INFO L225 Difference]: With dead ends: 76 [2024-11-06 01:53:07,264 INFO L226 Difference]: Without dead ends: 37 [2024-11-06 01:53:07,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 01:53:07,266 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:07,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 252 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 01:53:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-06 01:53:07,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-06 01:53:07,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 01:53:07,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2024-11-06 01:53:07,277 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 19 [2024-11-06 01:53:07,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:07,277 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2024-11-06 01:53:07,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-06 01:53:07,278 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2024-11-06 01:53:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-06 01:53:07,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:07,282 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:07,286 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 (4)] Ended with exit code 0 [2024-11-06 01:53:07,482 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-06 01:53:07,483 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:07,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:07,484 INFO L85 PathProgramCache]: Analyzing trace with hash 683802393, now seen corresponding path program 1 times [2024-11-06 01:53:07,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:07,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [490031480] [2024-11-06 01:53:07,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:07,485 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 01:53:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:07,486 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-06 01:53:07,487 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-06 01:53:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:07,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 01:53:07,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 01:53:07,552 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:07,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:07,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [490031480] [2024-11-06 01:53:07,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [490031480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:07,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:07,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 01:53:07,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457370651] [2024-11-06 01:53:07,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:07,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 01:53:07,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:07,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 01:53:07,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:53:07,554 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:07,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:07,579 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2024-11-06 01:53:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 01:53:07,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 37 [2024-11-06 01:53:07,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:07,582 INFO L225 Difference]: With dead ends: 42 [2024-11-06 01:53:07,582 INFO L226 Difference]: Without dead ends: 37 [2024-11-06 01:53:07,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:53:07,583 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:07,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-06 01:53:07,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-06 01:53:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 01:53:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-11-06 01:53:07,596 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 37 [2024-11-06 01:53:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:07,596 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-06 01:53:07,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-06 01:53:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-06 01:53:07,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:07,598 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:07,603 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 (5)] Ended with exit code 0 [2024-11-06 01:53:07,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 01:53:07,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:07,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:07,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1611689165, now seen corresponding path program 1 times [2024-11-06 01:53:07,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:07,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032720182] [2024-11-06 01:53:07,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:07,801 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 01:53:07,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:07,805 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 01:53:07,807 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 01:53:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:07,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 01:53:07,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 01:53:07,903 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:07,903 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:07,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032720182] [2024-11-06 01:53:07,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032720182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:07,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:07,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 01:53:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301840954] [2024-11-06 01:53:07,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:07,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 01:53:07,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:07,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 01:53:07,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:53:07,907 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:07,938 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2024-11-06 01:53:07,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 01:53:07,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-11-06 01:53:07,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:07,940 INFO L225 Difference]: With dead ends: 52 [2024-11-06 01:53:07,940 INFO L226 Difference]: Without dead ends: 45 [2024-11-06 01:53:07,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:53:07,942 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:07,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 70 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:07,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-06 01:53:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-11-06 01:53:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 32 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 01:53:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2024-11-06 01:53:07,952 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 40 [2024-11-06 01:53:07,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:07,953 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2024-11-06 01:53:07,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:07,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2024-11-06 01:53:07,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 01:53:07,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:07,954 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:07,959 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 (6)] Forceful destruction successful, exit code 0 [2024-11-06 01:53:08,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 01:53:08,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:08,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash 35157834, now seen corresponding path program 1 times [2024-11-06 01:53:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:08,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997365487] [2024-11-06 01:53:08,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:08,157 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 01:53:08,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:08,158 INFO L229 MonitoredProcess]: Starting monitored process 7 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 01:53:08,160 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 (7)] Waiting until timeout for monitored process [2024-11-06 01:53:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:08,234 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 01:53:08,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:08,253 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 01:53:08,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:08,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:08,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997365487] [2024-11-06 01:53:08,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997365487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:08,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:08,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 01:53:08,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522180909] [2024-11-06 01:53:08,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:08,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 01:53:08,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:08,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 01:53:08,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:53:08,256 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:08,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:08,282 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2024-11-06 01:53:08,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 01:53:08,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-06 01:53:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:08,286 INFO L225 Difference]: With dead ends: 55 [2024-11-06 01:53:08,286 INFO L226 Difference]: Without dead ends: 41 [2024-11-06 01:53:08,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 01:53:08,287 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:08,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-06 01:53:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-11-06 01:53:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.15625) internal successors, (37), 33 states have internal predecessors, (37), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 01:53:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2024-11-06 01:53:08,297 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 42 [2024-11-06 01:53:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:08,298 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2024-11-06 01:53:08,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2024-11-06 01:53:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-06 01:53:08,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:08,299 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:08,305 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 (7)] Ended with exit code 0 [2024-11-06 01:53:08,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 01:53:08,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:08,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:08,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1234560462, now seen corresponding path program 1 times [2024-11-06 01:53:08,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:08,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612268990] [2024-11-06 01:53:08,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:08,505 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 01:53:08,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:08,507 INFO L229 MonitoredProcess]: Starting monitored process 8 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 01:53:08,508 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 (8)] Waiting until timeout for monitored process [2024-11-06 01:53:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:08,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 01:53:08,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 01:53:08,609 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:08,654 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 01:53:08,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:08,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612268990] [2024-11-06 01:53:08,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612268990] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:08,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:08,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 01:53:08,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696909028] [2024-11-06 01:53:08,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:08,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 01:53:08,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:08,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 01:53:08,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 01:53:08,657 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:08,705 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2024-11-06 01:53:08,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 01:53:08,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 45 [2024-11-06 01:53:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:08,706 INFO L225 Difference]: With dead ends: 63 [2024-11-06 01:53:08,707 INFO L226 Difference]: Without dead ends: 48 [2024-11-06 01:53:08,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 01:53:08,708 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:08,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 114 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:08,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-06 01:53:08,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-06 01:53:08,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 01:53:08,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-06 01:53:08,714 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 45 [2024-11-06 01:53:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:08,715 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-06 01:53:08,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:08,715 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-06 01:53:08,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-06 01:53:08,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:08,716 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:08,721 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 (8)] Ended with exit code 0 [2024-11-06 01:53:08,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 01:53:08,921 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:08,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:08,921 INFO L85 PathProgramCache]: Analyzing trace with hash 657433930, now seen corresponding path program 2 times [2024-11-06 01:53:08,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:08,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728585087] [2024-11-06 01:53:08,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:53:08,922 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 01:53:08,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:08,925 INFO L229 MonitoredProcess]: Starting monitored process 9 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 01:53:08,927 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 (9)] Waiting until timeout for monitored process [2024-11-06 01:53:08,993 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 01:53:08,994 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:08,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-06 01:53:09,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 01:53:09,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 01:53:09,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:09,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728585087] [2024-11-06 01:53:09,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728585087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 01:53:09,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 01:53:09,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 01:53:09,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084830290] [2024-11-06 01:53:09,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 01:53:09,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 01:53:09,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:09,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 01:53:09,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 01:53:09,030 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:09,058 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-11-06 01:53:09,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 01:53:09,059 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2024-11-06 01:53:09,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:09,060 INFO L225 Difference]: With dead ends: 54 [2024-11-06 01:53:09,060 INFO L226 Difference]: Without dead ends: 48 [2024-11-06 01:53:09,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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 01:53:09,061 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:09,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-06 01:53:09,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-06 01:53:09,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 41 states have (on average 1.170731707317073) internal successors, (48), 42 states have internal predecessors, (48), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 01:53:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2024-11-06 01:53:09,070 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 54 [2024-11-06 01:53:09,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:09,071 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2024-11-06 01:53:09,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:09,071 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2024-11-06 01:53:09,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 01:53:09,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:09,072 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:09,076 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 (9)] Ended with exit code 0 [2024-11-06 01:53:09,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 01:53:09,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:09,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:09,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2116133056, now seen corresponding path program 1 times [2024-11-06 01:53:09,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:09,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973575072] [2024-11-06 01:53:09,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:09,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 01:53:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:09,275 INFO L229 MonitoredProcess]: Starting monitored process 10 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 01:53:09,276 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 (10)] Waiting until timeout for monitored process [2024-11-06 01:53:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:09,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 01:53:09,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:09,746 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 01:53:09,746 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:09,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 01:53:09,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2024-11-06 01:53:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 01:53:10,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:10,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973575072] [2024-11-06 01:53:10,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973575072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:10,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:10,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-06 01:53:10,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280538263] [2024-11-06 01:53:10,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:10,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-06 01:53:10,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-06 01:53:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-06 01:53:10,095 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:46,642 INFO L93 Difference]: Finished difference Result 152 states and 194 transitions. [2024-11-06 01:53:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-06 01:53:46,643 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2024-11-06 01:53:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:46,644 INFO L225 Difference]: With dead ends: 152 [2024-11-06 01:53:46,644 INFO L226 Difference]: Without dead ends: 110 [2024-11-06 01:53:46,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=308, Invalid=874, Unknown=8, NotChecked=0, Total=1190 [2024-11-06 01:53:46,646 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 102 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:46,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 388 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 01:53:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-06 01:53:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2024-11-06 01:53:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 74 states have internal predecessors, (91), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 01:53:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2024-11-06 01:53:46,660 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 57 [2024-11-06 01:53:46,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:46,660 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2024-11-06 01:53:46,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.1666666666666665) internal successors, (57), 18 states have internal predecessors, (57), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:46,661 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2024-11-06 01:53:46,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 01:53:46,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:46,662 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:46,670 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 (10)] Ended with exit code 0 [2024-11-06 01:53:46,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 01:53:46,869 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:46,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:46,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1959979522, now seen corresponding path program 1 times [2024-11-06 01:53:46,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:46,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039401820] [2024-11-06 01:53:46,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 01:53:46,870 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 01:53:46,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:46,873 INFO L229 MonitoredProcess]: Starting monitored process 11 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 01:53:46,875 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 (11)] Waiting until timeout for monitored process [2024-11-06 01:53:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 01:53:46,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 01:53:46,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 01:53:47,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 01:53:47,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:47,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039401820] [2024-11-06 01:53:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039401820] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:47,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 01:53:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244993109] [2024-11-06 01:53:47,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:47,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 01:53:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:47,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 01:53:47,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 01:53:47,080 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:47,140 INFO L93 Difference]: Finished difference Result 133 states and 170 transitions. [2024-11-06 01:53:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 01:53:47,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2024-11-06 01:53:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:47,142 INFO L225 Difference]: With dead ends: 133 [2024-11-06 01:53:47,143 INFO L226 Difference]: Without dead ends: 126 [2024-11-06 01:53:47,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 01:53:47,143 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 32 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:47,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 108 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 01:53:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-06 01:53:47,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-06 01:53:47,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 120 states have internal predecessors, (150), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 01:53:47,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 161 transitions. [2024-11-06 01:53:47,160 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 161 transitions. Word has length 57 [2024-11-06 01:53:47,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:47,160 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 161 transitions. [2024-11-06 01:53:47,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:47,161 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 161 transitions. [2024-11-06 01:53:47,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 01:53:47,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:47,164 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 15, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:47,173 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 (11)] Ended with exit code 0 [2024-11-06 01:53:47,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 01:53:47,365 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:47,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:47,365 INFO L85 PathProgramCache]: Analyzing trace with hash 111071349, now seen corresponding path program 2 times [2024-11-06 01:53:47,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:47,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805912592] [2024-11-06 01:53:47,366 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 01:53:47,366 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 01:53:47,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:47,367 INFO L229 MonitoredProcess]: Starting monitored process 12 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 01:53:47,368 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 (12)] Waiting until timeout for monitored process [2024-11-06 01:53:47,498 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 01:53:47,498 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:47,504 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 01:53:47,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:47,711 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 202 proven. 30 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-06 01:53:47,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:47,829 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 01:53:47,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2024-11-06 01:53:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 202 proven. 30 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-06 01:53:48,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:48,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805912592] [2024-11-06 01:53:48,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805912592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 01:53:48,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 01:53:48,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2024-11-06 01:53:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89662103] [2024-11-06 01:53:48,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 01:53:48,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-06 01:53:48,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 01:53:48,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-06 01:53:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2024-11-06 01:53:48,040 INFO L87 Difference]: Start difference. First operand 126 states and 161 transitions. Second operand has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 01:53:48,709 INFO L93 Difference]: Finished difference Result 275 states and 354 transitions. [2024-11-06 01:53:48,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-06 01:53:48,709 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 108 [2024-11-06 01:53:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 01:53:48,711 INFO L225 Difference]: With dead ends: 275 [2024-11-06 01:53:48,712 INFO L226 Difference]: Without dead ends: 219 [2024-11-06 01:53:48,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=234, Invalid=956, Unknown=0, NotChecked=0, Total=1190 [2024-11-06 01:53:48,713 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 01:53:48,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 503 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 01:53:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-06 01:53:48,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 181. [2024-11-06 01:53:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 174 states have (on average 1.2873563218390804) internal successors, (224), 175 states have internal predecessors, (224), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-06 01:53:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 235 transitions. [2024-11-06 01:53:48,758 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 235 transitions. Word has length 108 [2024-11-06 01:53:48,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 01:53:48,758 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 235 transitions. [2024-11-06 01:53:48,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.1818181818181817) internal successors, (70), 22 states have internal predecessors, (70), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-06 01:53:48,758 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 235 transitions. [2024-11-06 01:53:48,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-06 01:53:48,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 01:53:48,760 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 13, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 01:53:48,770 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 (12)] Forceful destruction successful, exit code 0 [2024-11-06 01:53:48,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 01:53:48,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 01:53:48,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 01:53:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1693621067, now seen corresponding path program 3 times [2024-11-06 01:53:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 01:53:48,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613102370] [2024-11-06 01:53:48,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 01:53:48,962 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 01:53:48,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 01:53:48,965 INFO L229 MonitoredProcess]: Starting monitored process 13 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 01:53:48,966 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 (13)] Waiting until timeout for monitored process [2024-11-06 01:53:49,087 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-06 01:53:49,087 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:49,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 01:53:49,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:53:51,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 01:53:51,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2024-11-06 01:53:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-11-06 01:53:52,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:53:52,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 01:53:52,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 01:53:52,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2024-11-06 01:53:53,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 01:53:53,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613102370] [2024-11-06 01:53:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613102370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 01:53:53,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1337665846] [2024-11-06 01:53:53,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 01:53:53,319 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 01:53:53,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 01:53:53,320 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 01:53:53,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2024-11-06 01:53:53,558 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-06 01:53:53,559 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 01:53:53,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-06 01:53:53,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 01:54:01,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 01:54:01,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 123 treesize of output 93 [2024-11-06 01:54:06,478 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-11-06 01:54:06,478 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 01:54:32,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 01:54:32,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 01:54:32,447 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 01:54:32,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 53 treesize of output 29