/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/loops/string-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:25:32,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:25:32,601 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:25:32,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:25:32,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:25:32,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:25:32,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:25:32,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:25:32,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:25:32,629 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:25:32,630 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:25:32,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:25:32,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:25:32,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:25:32,631 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:25:32,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:25:32,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:25:32,632 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:25:32,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:25:32,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:25:32,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:25:32,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:25:32,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:25:32,633 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:25:32,633 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:25:32,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:25:32,634 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:25:32,634 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:25:32,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:25:32,634 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:25:32,635 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:25:32,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:25:32,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:25:32,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:25:32,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:25:32,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:25:32,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:25:32,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:25:32,636 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:25:32,636 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:25:32,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:25:32,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:25:32,636 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:25:32,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:25:32,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:25:32,637 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:25:32,637 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 [2023-12-16 16:25:32,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:25:32,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:25:32,809 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:25:32,810 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:25:32,810 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:25:32,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/string-2.i [2023-12-16 16:25:33,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:25:33,988 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:25:33,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i [2023-12-16 16:25:33,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e6bf3cf/f37e692bacd34905ade2887677dbb542/FLAG83cd70437 [2023-12-16 16:25:34,007 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e6bf3cf/f37e692bacd34905ade2887677dbb542 [2023-12-16 16:25:34,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:25:34,010 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:25:34,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:25:34,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:25:34,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:25:34,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63e43c52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34, skipping insertion in model container [2023-12-16 16:25:34,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,037 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:25:34,140 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i[896,909] [2023-12-16 16:25:34,158 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:25:34,165 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:25:34,173 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/string-2.i[896,909] [2023-12-16 16:25:34,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:25:34,188 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:25:34,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34 WrapperNode [2023-12-16 16:25:34,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:25:34,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:25:34,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:25:34,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:25:34,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,200 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,212 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 121 [2023-12-16 16:25:34,212 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:25:34,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:25:34,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:25:34,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:25:34,219 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,236 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-12-16 16:25:34,236 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,243 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:25:34,248 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:25:34,248 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:25:34,248 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:25:34,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (1/1) ... [2023-12-16 16:25:34,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:25:34,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:25:34,269 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) [2023-12-16 16:25:34,280 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 [2023-12-16 16:25:34,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:25:34,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 16:25:34,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 16:25:34,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 16:25:34,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:25:34,346 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:25:34,347 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:25:34,503 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:25:34,539 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:25:34,539 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-16 16:25:34,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:25:34 BoogieIcfgContainer [2023-12-16 16:25:34,540 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:25:34,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:25:34,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:25:34,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:25:34,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:25:34" (1/3) ... [2023-12-16 16:25:34,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132e4693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:25:34, skipping insertion in model container [2023-12-16 16:25:34,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:25:34" (2/3) ... [2023-12-16 16:25:34,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@132e4693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:25:34, skipping insertion in model container [2023-12-16 16:25:34,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:25:34" (3/3) ... [2023-12-16 16:25:34,545 INFO L112 eAbstractionObserver]: Analyzing ICFG string-2.i [2023-12-16 16:25:34,568 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:25:34,568 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:25:34,596 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:25:34,610 INFO L357 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, mHoare=true, 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;@5fa43907, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:25:34,610 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:25:34,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:25:34,622 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:34,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:34,623 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:34,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:34,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2109911089, now seen corresponding path program 1 times [2023-12-16 16:25:34,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:34,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876402910] [2023-12-16 16:25:34,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:34,634 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 [2023-12-16 16:25:34,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:34,635 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) [2023-12-16 16:25:34,637 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 [2023-12-16 16:25:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:34,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:25:34,701 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:25:34,713 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:25:34,714 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:34,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876402910] [2023-12-16 16:25:34,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876402910] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:25:34,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:25:34,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:25:34,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601304787] [2023-12-16 16:25:34,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:25:34,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:25:34,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:34,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:25:34,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:25:34,761 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:34,793 INFO L93 Difference]: Finished difference Result 42 states and 68 transitions. [2023-12-16 16:25:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:25:34,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:25:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:34,801 INFO L225 Difference]: With dead ends: 42 [2023-12-16 16:25:34,801 INFO L226 Difference]: Without dead ends: 19 [2023-12-16 16:25:34,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:25:34,805 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:34,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:25:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-16 16:25:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-16 16:25:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2023-12-16 16:25:34,825 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 15 [2023-12-16 16:25:34,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:34,825 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2023-12-16 16:25:34,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:34,826 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2023-12-16 16:25:34,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 16:25:34,826 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:34,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:34,841 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 (2)] Forceful destruction successful, exit code 0 [2023-12-16 16:25:35,041 WARN L477 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 [2023-12-16 16:25:35,042 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:35,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1813328509, now seen corresponding path program 1 times [2023-12-16 16:25:35,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:35,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650800804] [2023-12-16 16:25:35,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:35,043 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 [2023-12-16 16:25:35,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:35,044 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) [2023-12-16 16:25:35,055 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 [2023-12-16 16:25:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:35,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 16:25:35,083 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:25:35,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:25:35,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:35,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650800804] [2023-12-16 16:25:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650800804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:25:35,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:25:35,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:25:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941661883] [2023-12-16 16:25:35,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:25:35,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 16:25:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:35,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 16:25:35,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:25:35,108 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:35,148 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2023-12-16 16:25:35,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 16:25:35,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-16 16:25:35,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:35,150 INFO L225 Difference]: With dead ends: 44 [2023-12-16 16:25:35,150 INFO L226 Difference]: Without dead ends: 27 [2023-12-16 16:25:35,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 16:25:35,151 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 5 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:35,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 28 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:25:35,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-16 16:25:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2023-12-16 16:25:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:35,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2023-12-16 16:25:35,155 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 17 [2023-12-16 16:25:35,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:35,155 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2023-12-16 16:25:35,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:35,156 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2023-12-16 16:25:35,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 16:25:35,156 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:35,156 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:35,160 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 [2023-12-16 16:25:35,358 WARN L477 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 [2023-12-16 16:25:35,359 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:35,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:35,359 INFO L85 PathProgramCache]: Analyzing trace with hash 707271104, now seen corresponding path program 1 times [2023-12-16 16:25:35,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:35,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910970436] [2023-12-16 16:25:35,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:35,360 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 [2023-12-16 16:25:35,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:35,361 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) [2023-12-16 16:25:35,366 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 [2023-12-16 16:25:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:35,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 16:25:35,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:25:35,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:25:35,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:25:35,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:35,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910970436] [2023-12-16 16:25:35,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910970436] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:25:35,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:25:35,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 16:25:35,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020303787] [2023-12-16 16:25:35,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:25:35,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 16:25:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:35,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 16:25:35,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:25:35,472 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:35,589 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2023-12-16 16:25:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 16:25:35,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-16 16:25:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:35,591 INFO L225 Difference]: With dead ends: 69 [2023-12-16 16:25:35,591 INFO L226 Difference]: Without dead ends: 51 [2023-12-16 16:25:35,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:25:35,592 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 25 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:35,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:25:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-16 16:25:35,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 27. [2023-12-16 16:25:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:35,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2023-12-16 16:25:35,596 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2023-12-16 16:25:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:35,596 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2023-12-16 16:25:35,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2023-12-16 16:25:35,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 16:25:35,597 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:35,597 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:35,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:25:35,815 WARN L477 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 [2023-12-16 16:25:35,816 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:35,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash 99608125, now seen corresponding path program 2 times [2023-12-16 16:25:35,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:35,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889814329] [2023-12-16 16:25:35,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:25:35,817 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 [2023-12-16 16:25:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:35,818 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) [2023-12-16 16:25:35,820 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 [2023-12-16 16:25:35,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 16:25:35,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:25:35,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 16:25:35,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-16 16:25:35,917 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:25:35,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:35,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889814329] [2023-12-16 16:25:35,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889814329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:25:35,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:25:35,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 16:25:35,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848807805] [2023-12-16 16:25:35,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:25:35,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:25:35,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:35,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:25:35,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:25:35,919 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:35,961 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2023-12-16 16:25:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:25:35,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-16 16:25:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:35,962 INFO L225 Difference]: With dead ends: 39 [2023-12-16 16:25:35,962 INFO L226 Difference]: Without dead ends: 29 [2023-12-16 16:25:35,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 16:25:35,963 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:35,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 46 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:25:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-16 16:25:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-16 16:25:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-16 16:25:35,966 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 25 [2023-12-16 16:25:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:35,967 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-16 16:25:35,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-16 16:25:35,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 16:25:35,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:35,967 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:35,971 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 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:25:36,169 WARN L477 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 [2023-12-16 16:25:36,170 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:36,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:36,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1267443896, now seen corresponding path program 1 times [2023-12-16 16:25:36,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:36,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330750692] [2023-12-16 16:25:36,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:36,171 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 [2023-12-16 16:25:36,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:36,172 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) [2023-12-16 16:25:36,174 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 [2023-12-16 16:25:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:36,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:25:36,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:36,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 16:25:36,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:25:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 16:25:36,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:36,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330750692] [2023-12-16 16:25:36,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330750692] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:25:36,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:25:36,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 16:25:36,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235080954] [2023-12-16 16:25:36,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:25:36,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 16:25:36,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:36,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 16:25:36,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:25:36,338 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:36,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:36,586 INFO L93 Difference]: Finished difference Result 84 states and 100 transitions. [2023-12-16 16:25:36,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:25:36,586 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-16 16:25:36,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:36,587 INFO L225 Difference]: With dead ends: 84 [2023-12-16 16:25:36,587 INFO L226 Difference]: Without dead ends: 61 [2023-12-16 16:25:36,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-12-16 16:25:36,588 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 35 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:36,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 168 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:25:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-16 16:25:36,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 31. [2023-12-16 16:25:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2023-12-16 16:25:36,592 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 27 [2023-12-16 16:25:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:36,592 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2023-12-16 16:25:36,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:36,592 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2023-12-16 16:25:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-16 16:25:36,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:36,593 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:36,598 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 [2023-12-16 16:25:36,795 WARN L477 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 [2023-12-16 16:25:36,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:36,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash -925404741, now seen corresponding path program 2 times [2023-12-16 16:25:36,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:36,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289963879] [2023-12-16 16:25:36,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:25:36,797 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 [2023-12-16 16:25:36,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:36,798 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) [2023-12-16 16:25:36,798 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 [2023-12-16 16:25:36,844 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 16:25:36,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:25:36,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:25:36,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:36,915 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 16:25:36,915 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:25:36,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:36,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289963879] [2023-12-16 16:25:36,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289963879] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:25:36,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:25:36,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:25:36,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964785276] [2023-12-16 16:25:36,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:25:36,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:25:36,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:36,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:25:36,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:25:36,916 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:36,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:36,960 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-12-16 16:25:36,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:25:36,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-16 16:25:36,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:36,962 INFO L225 Difference]: With dead ends: 37 [2023-12-16 16:25:36,962 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 16:25:36,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:25:36,965 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 2 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:36,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:25:36,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 16:25:36,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-12-16 16:25:36,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:36,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2023-12-16 16:25:36,977 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 29 [2023-12-16 16:25:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:36,977 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2023-12-16 16:25:36,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2023-12-16 16:25:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 16:25:36,979 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:36,979 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:36,984 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 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:25:37,182 WARN L477 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 [2023-12-16 16:25:37,184 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:37,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:37,184 INFO L85 PathProgramCache]: Analyzing trace with hash -205380834, now seen corresponding path program 1 times [2023-12-16 16:25:37,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:37,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220815279] [2023-12-16 16:25:37,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:37,185 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 [2023-12-16 16:25:37,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:37,185 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) [2023-12-16 16:25:37,202 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 [2023-12-16 16:25:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:25:37,265 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 16:25:37,266 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:25:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-12-16 16:25:37,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:25:37,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:25:37,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220815279] [2023-12-16 16:25:37,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220815279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:25:37,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:25:37,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:25:37,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203809732] [2023-12-16 16:25:37,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:25:37,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 16:25:37,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:25:37,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 16:25:37,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:25:37,287 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:25:37,321 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2023-12-16 16:25:37,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 16:25:37,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-16 16:25:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:25:37,322 INFO L225 Difference]: With dead ends: 47 [2023-12-16 16:25:37,322 INFO L226 Difference]: Without dead ends: 34 [2023-12-16 16:25:37,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 16:25:37,322 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:37,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:25:37,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-16 16:25:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-16 16:25:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:37,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-12-16 16:25:37,326 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 31 [2023-12-16 16:25:37,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:25:37,326 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-12-16 16:25:37,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:25:37,326 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-12-16 16:25:37,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-16 16:25:37,326 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:25:37,326 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:25:37,331 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 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:25:37,529 WARN L477 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 [2023-12-16 16:25:37,529 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:25:37,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:25:37,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1974938627, now seen corresponding path program 1 times [2023-12-16 16:25:37,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:25:37,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820305766] [2023-12-16 16:25:37,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:25:37,530 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 [2023-12-16 16:25:37,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:25:37,531 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) [2023-12-16 16:25:37,533 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 [2023-12-16 16:25:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:25:37,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 16:25:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:25:37,750 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 16:25:37,750 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 16:25:37,751 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:25:37,758 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 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:25:37,952 WARN L477 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 [2023-12-16 16:25:37,955 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-12-16 16:25:37,957 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:25:37,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:25:37 BoogieIcfgContainer [2023-12-16 16:25:37,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:25:37,993 INFO L158 Benchmark]: Toolchain (without parser) took 3983.46ms. Allocated memory is still 240.1MB. Free memory was 188.3MB in the beginning and 104.2MB in the end (delta: 84.1MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. [2023-12-16 16:25:37,993 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:25:37,993 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.71ms. Allocated memory is still 240.1MB. Free memory was 188.3MB in the beginning and 176.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 16:25:37,994 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.16ms. Allocated memory is still 240.1MB. Free memory was 176.3MB in the beginning and 174.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:25:37,994 INFO L158 Benchmark]: Boogie Preprocessor took 34.49ms. Allocated memory is still 240.1MB. Free memory was 174.2MB in the beginning and 172.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:25:37,994 INFO L158 Benchmark]: RCFGBuilder took 291.98ms. Allocated memory is still 240.1MB. Free memory was 172.1MB in the beginning and 155.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 16:25:37,994 INFO L158 Benchmark]: TraceAbstraction took 3451.87ms. Allocated memory is still 240.1MB. Free memory was 155.3MB in the beginning and 104.2MB in the end (delta: 51.1MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2023-12-16 16:25:37,995 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 198.2MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 177.71ms. Allocated memory is still 240.1MB. Free memory was 188.3MB in the beginning and 176.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 23.16ms. Allocated memory is still 240.1MB. Free memory was 176.3MB in the beginning and 174.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.49ms. Allocated memory is still 240.1MB. Free memory was 174.2MB in the beginning and 172.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 291.98ms. Allocated memory is still 240.1MB. Free memory was 172.1MB in the beginning and 155.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3451.87ms. Allocated memory is still 240.1MB. Free memory was 155.3MB in the beginning and 104.2MB in the end (delta: 51.1MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=1, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=2, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=3, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=4, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=5, string_A={7:0}, string_B={3:0}] [L35] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={3:0}] [L37] EXPR string_A[5 -1] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [found=0, i=0, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=1, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=2, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=3, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=4, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=5, string_A={7:0}, string_B={3:0}] [L39] COND FALSE !(i<5) VAL [found=0, i=5, string_A={7:0}, string_B={3:0}] [L41] EXPR string_B[5 -1] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={7:0}, string_B={3:0}] [L44] EXPR string_A[nc_A] [L44] COND TRUE string_A[nc_A]!='\0' [L45] nc_A++ VAL [found=0, i=5, nc_A=1, string_A={7:0}, string_B={3:0}] [L44] EXPR string_A[nc_A] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [found=0, i=5, nc_A=1, nc_B=0, string_A={7:0}, string_B={3:0}] [L48] EXPR string_B[nc_B] [L48] COND TRUE string_B[nc_B]!='\0' [L49] nc_B++ VAL [found=0, i=5, nc_A=1, nc_B=1, string_A={7:0}, string_B={3:0}] [L48] EXPR string_B[nc_B] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 VAL [found=0, i=0, j=0, nc_A=1, nc_B=1, string_A={7:0}, string_B={3:0}] [L55] COND TRUE (inc_B-1)<