/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/array-programs/partial_mod_count_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:59:15,493 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:59:15,563 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 06:59:15,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:59:15,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:59:15,588 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:59:15,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:59:15,589 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:59:15,589 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:59:15,592 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:59:15,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:59:15,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:59:15,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:59:15,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:59:15,594 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:59:15,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:59:15,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:59:15,595 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:59:15,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:59:15,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:59:15,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:59:15,596 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:59:15,596 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:59:15,596 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 06:59:15,596 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 06:59:15,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:59:15,596 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 06:59:15,596 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:59:15,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:59:15,597 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:59:15,597 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:59:15,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:59:15,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:59:15,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:59:15,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:59:15,598 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:59:15,598 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:59:15,598 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:59:15,599 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 06:59:15,599 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 06:59:15,599 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:59:15,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:59:15,599 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:59:15,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:59:15,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:59:15,600 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 06:59:15,600 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 06:59:15,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:59:15,787 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:59:15,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:59:15,789 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:59:15,789 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:59:15,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-programs/partial_mod_count_3.c [2023-12-16 06:59:16,826 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:59:16,985 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:59:16,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-programs/partial_mod_count_3.c [2023-12-16 06:59:16,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823eb7534/d0fbe93793fc401d90eb4c9c43971e47/FLAGd08e8515a [2023-12-16 06:59:17,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/823eb7534/d0fbe93793fc401d90eb4c9c43971e47 [2023-12-16 06:59:17,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:59:17,007 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:59:17,009 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:59:17,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:59:17,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:59:17,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f792c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17, skipping insertion in model container [2023-12-16 06:59:17,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,027 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:59:17,139 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-programs/partial_mod_count_3.c[323,336] [2023-12-16 06:59:17,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:59:17,161 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:59:17,170 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-programs/partial_mod_count_3.c[323,336] [2023-12-16 06:59:17,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:59:17,190 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:59:17,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17 WrapperNode [2023-12-16 06:59:17,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:59:17,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:59:17,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:59:17,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:59:17,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,216 INFO L138 Inliner]: procedures = 15, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 51 [2023-12-16 06:59:17,216 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:59:17,216 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:59:17,217 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:59:17,217 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:59:17,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,244 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2023-12-16 06:59:17,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,253 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:59:17,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:59:17,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:59:17,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:59:17,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (1/1) ... [2023-12-16 06:59:17,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:59:17,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:59:17,306 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 06:59:17,325 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 06:59:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:59:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 06:59:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 06:59:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 06:59:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 06:59:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 06:59:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:59:17,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:59:17,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 06:59:17,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 06:59:17,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 06:59:17,422 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:59:17,424 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:59:17,608 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:59:17,627 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:59:17,628 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 06:59:17,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:59:17 BoogieIcfgContainer [2023-12-16 06:59:17,628 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:59:17,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:59:17,630 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:59:17,632 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:59:17,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:59:17" (1/3) ... [2023-12-16 06:59:17,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262be525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:59:17, skipping insertion in model container [2023-12-16 06:59:17,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:59:17" (2/3) ... [2023-12-16 06:59:17,633 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@262be525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:59:17, skipping insertion in model container [2023-12-16 06:59:17,633 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:59:17" (3/3) ... [2023-12-16 06:59:17,634 INFO L112 eAbstractionObserver]: Analyzing ICFG partial_mod_count_3.c [2023-12-16 06:59:17,645 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:59:17,646 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 06:59:17,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:59:17,678 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;@5ad823ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:59:17,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 06:59:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 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 06:59:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 06:59:17,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:59:17,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:59:17,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:59:17,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:59:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash 802981352, now seen corresponding path program 1 times [2023-12-16 06:59:17,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:59:17,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336513783] [2023-12-16 06:59:17,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:59:17,697 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 06:59:17,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:59:17,728 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 06:59:17,757 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 06:59:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:59:17,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 06:59:17,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:59:17,820 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 06:59:17,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:59:17,821 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:59:17,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336513783] [2023-12-16 06:59:17,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336513783] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:59:17,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:59:17,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:59:17,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152704714] [2023-12-16 06:59:17,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:59:17,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 06:59:17,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:59:17,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 06:59:17,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 06:59:17,843 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 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) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 06:59:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:59:17,859 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2023-12-16 06:59:17,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 06:59:17,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-12-16 06:59:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:59:17,865 INFO L225 Difference]: With dead ends: 24 [2023-12-16 06:59:17,865 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 06:59:17,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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 06:59:17,869 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:59:17,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:59:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 06:59:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-16 06:59:17,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 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 06:59:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2023-12-16 06:59:17,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 8 [2023-12-16 06:59:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:59:17,888 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-12-16 06:59:17,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 06:59:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2023-12-16 06:59:17,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-16 06:59:17,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:59:17,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:59:17,906 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 06:59:18,091 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 06:59:18,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:59:18,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:59:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash -369624547, now seen corresponding path program 1 times [2023-12-16 06:59:18,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:59:18,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1425962195] [2023-12-16 06:59:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:59:18,093 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 06:59:18,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:59:18,097 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 06:59:18,098 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 06:59:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:59:18,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:59:18,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:59:18,207 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 06:59:18,207 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:59:18,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:59:18,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1425962195] [2023-12-16 06:59:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1425962195] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:59:18,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:59:18,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:59:18,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147751471] [2023-12-16 06:59:18,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:59:18,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:59:18,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:59:18,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:59:18,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:59:18,210 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 06:59:18,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:59:18,337 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2023-12-16 06:59:18,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:59:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2023-12-16 06:59:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:59:18,338 INFO L225 Difference]: With dead ends: 26 [2023-12-16 06:59:18,338 INFO L226 Difference]: Without dead ends: 15 [2023-12-16 06:59:18,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 06:59:18,339 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:59:18,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 15 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:59:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-16 06:59:18,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2023-12-16 06:59:18,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 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 06:59:18,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2023-12-16 06:59:18,343 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 17 transitions. Word has length 8 [2023-12-16 06:59:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:59:18,343 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 17 transitions. [2023-12-16 06:59:18,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 06:59:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 17 transitions. [2023-12-16 06:59:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-16 06:59:18,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:59:18,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:59:18,359 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 06:59:18,559 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 06:59:18,559 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:59:18,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:59:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1324979005, now seen corresponding path program 1 times [2023-12-16 06:59:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:59:18,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633353800] [2023-12-16 06:59:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:59:18,561 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 06:59:18,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:59:18,568 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 06:59:18,569 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 06:59:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:59:18,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 06:59:18,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:59:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:59:18,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:59:18,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:59:18,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:59:18,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633353800] [2023-12-16 06:59:18,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633353800] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:59:18,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:59:18,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 06:59:18,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008735131] [2023-12-16 06:59:18,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:59:18,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:59:18,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:59:18,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:59:18,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:59:18,706 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 06:59:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:59:18,951 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-12-16 06:59:18,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:59:18,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11 [2023-12-16 06:59:18,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:59:18,952 INFO L225 Difference]: With dead ends: 33 [2023-12-16 06:59:18,952 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 06:59:18,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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 06:59:18,953 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:59:18,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 23 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:59:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 06:59:18,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-16 06:59:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 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 06:59:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-16 06:59:18,957 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2023-12-16 06:59:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:59:18,957 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-16 06:59:18,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 06:59:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-16 06:59:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 06:59:18,958 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:59:18,958 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:59:18,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 06:59:19,161 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 06:59:19,161 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:59:19,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:59:19,162 INFO L85 PathProgramCache]: Analyzing trace with hash -531198499, now seen corresponding path program 1 times [2023-12-16 06:59:19,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:59:19,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703862122] [2023-12-16 06:59:19,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:59:19,163 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 06:59:19,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:59:19,164 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 06:59:19,168 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 06:59:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:59:19,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 06:59:19,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:59:19,391 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 06:59:19,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:59:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 06:59:20,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:59:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703862122] [2023-12-16 06:59:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703862122] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:59:20,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:59:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-16 06:59:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090737962] [2023-12-16 06:59:20,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:59:20,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 06:59:20,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:59:20,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 06:59:20,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 06:59:20,054 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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 06:59:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:59:20,868 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2023-12-16 06:59:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 06:59:20,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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 20 [2023-12-16 06:59:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:59:20,872 INFO L225 Difference]: With dead ends: 45 [2023-12-16 06:59:20,872 INFO L226 Difference]: Without dead ends: 32 [2023-12-16 06:59:20,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-16 06:59:20,873 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 06:59:20,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 24 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 06:59:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-16 06:59:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2023-12-16 06:59:20,877 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 06:59:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2023-12-16 06:59:20,878 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 20 [2023-12-16 06:59:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:59:20,878 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2023-12-16 06:59:20,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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 06:59:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2023-12-16 06:59:20,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-16 06:59:20,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:59:20,879 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:59:20,885 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 06:59:21,079 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 06:59:21,080 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:59:21,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:59:21,080 INFO L85 PathProgramCache]: Analyzing trace with hash 407025309, now seen corresponding path program 2 times [2023-12-16 06:59:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:59:21,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144060016] [2023-12-16 06:59:21,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:59:21,081 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 06:59:21,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:59:21,083 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 06:59:21,084 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 06:59:21,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-16 06:59:21,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:59:21,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 06:59:21,134 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:59:21,251 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-16 06:59:21,251 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:59:21,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:59:21,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144060016] [2023-12-16 06:59:21,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144060016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:59:21,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:59:21,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 06:59:21,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075250215] [2023-12-16 06:59:21,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:59:21,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 06:59:21,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:59:21,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 06:59:21,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 06:59:21,254 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 06:59:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:59:21,424 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2023-12-16 06:59:21,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:59:21,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 20 [2023-12-16 06:59:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:59:21,425 INFO L225 Difference]: With dead ends: 41 [2023-12-16 06:59:21,425 INFO L226 Difference]: Without dead ends: 39 [2023-12-16 06:59:21,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:59:21,426 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:59:21,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 19 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:59:21,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-16 06:59:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-16 06:59:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 38 states have internal predecessors, (46), 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 06:59:21,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2023-12-16 06:59:21,431 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 20 [2023-12-16 06:59:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:59:21,431 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2023-12-16 06:59:21,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 06:59:21,432 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2023-12-16 06:59:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-16 06:59:21,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:59:21,436 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:59:21,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-16 06:59:21,639 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 06:59:21,639 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:59:21,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:59:21,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2102952292, now seen corresponding path program 1 times [2023-12-16 06:59:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:59:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657351008] [2023-12-16 06:59:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:59:21,640 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 06:59:21,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:59:21,643 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 06:59:21,644 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 06:59:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:59:21,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 06:59:21,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:59:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 06:59:21,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:59:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 06:59:21,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:59:21,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657351008] [2023-12-16 06:59:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657351008] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:59:21,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:59:21,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 06:59:21,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115847297] [2023-12-16 06:59:21,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:59:21,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:59:21,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:59:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:59:21,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:59:21,965 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 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 06:59:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:59:22,596 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2023-12-16 06:59:22,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:59:22,598 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 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) Word has length 25 [2023-12-16 06:59:22,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:59:22,598 INFO L225 Difference]: With dead ends: 68 [2023-12-16 06:59:22,598 INFO L226 Difference]: Without dead ends: 50 [2023-12-16 06:59:22,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:59:22,599 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:59:22,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 28 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 06:59:22,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-16 06:59:22,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2023-12-16 06:59:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.183673469387755) internal successors, (58), 49 states have internal predecessors, (58), 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 06:59:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2023-12-16 06:59:22,604 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 25 [2023-12-16 06:59:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:59:22,604 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2023-12-16 06:59:22,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 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 06:59:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2023-12-16 06:59:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 06:59:22,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:59:22,605 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:59:22,611 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 06:59:22,808 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 06:59:22,809 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:59:22,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:59:22,809 INFO L85 PathProgramCache]: Analyzing trace with hash 514299228, now seen corresponding path program 1 times [2023-12-16 06:59:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:59:22,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140069742] [2023-12-16 06:59:22,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:59:22,810 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 06:59:22,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:59:22,811 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 06:59:22,815 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 06:59:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:59:23,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 06:59:23,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:59:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-16 06:59:23,151 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:59:25,486 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 73 proven. 57 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-16 06:59:25,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:59:25,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140069742] [2023-12-16 06:59:25,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1140069742] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:59:25,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:59:25,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-16 06:59:25,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216131400] [2023-12-16 06:59:25,487 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:59:25,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 06:59:25,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:59:25,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 06:59:25,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:59:25,488 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 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 06:59:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:59:29,402 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2023-12-16 06:59:29,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 06:59:29,406 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 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 43 [2023-12-16 06:59:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:59:29,406 INFO L225 Difference]: With dead ends: 97 [2023-12-16 06:59:29,406 INFO L226 Difference]: Without dead ends: 68 [2023-12-16 06:59:29,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2023-12-16 06:59:29,407 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:59:29,408 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 44 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 06:59:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-16 06:59:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2023-12-16 06:59:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 62 states have internal predecessors, (72), 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 06:59:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 72 transitions. [2023-12-16 06:59:29,415 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 72 transitions. Word has length 43 [2023-12-16 06:59:29,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:59:29,415 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 72 transitions. [2023-12-16 06:59:29,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 15 states have internal predecessors, (54), 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 06:59:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 72 transitions. [2023-12-16 06:59:29,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-16 06:59:29,416 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:59:29,416 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:59:29,424 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 06:59:29,617 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 06:59:29,617 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:59:29,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:59:29,617 INFO L85 PathProgramCache]: Analyzing trace with hash -413285412, now seen corresponding path program 2 times [2023-12-16 06:59:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:59:29,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320804682] [2023-12-16 06:59:29,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:59:29,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:59:29,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:59:29,622 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 06:59:29,636 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 06:59:29,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:59:29,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:59:29,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 06:59:29,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:59:29,947 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 06:59:29,947 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:59:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 06:59:30,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:59:30,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320804682] [2023-12-16 06:59:30,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320804682] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:59:30,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:59:30,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-16 06:59:30,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708155841] [2023-12-16 06:59:30,514 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:59:30,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 06:59:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:59:30,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 06:59:30,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-16 06:59:30,515 INFO L87 Difference]: Start difference. First operand 63 states and 72 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 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 06:59:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:59:33,363 INFO L93 Difference]: Finished difference Result 104 states and 131 transitions. [2023-12-16 06:59:33,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 06:59:33,364 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 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 43 [2023-12-16 06:59:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:59:33,364 INFO L225 Difference]: With dead ends: 104 [2023-12-16 06:59:33,365 INFO L226 Difference]: Without dead ends: 86 [2023-12-16 06:59:33,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 06:59:33,366 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 66 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:59:33,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 63 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 06:59:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-16 06:59:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-16 06:59:33,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1529411764705881) internal successors, (98), 85 states have internal predecessors, (98), 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 06:59:33,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2023-12-16 06:59:33,373 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 43 [2023-12-16 06:59:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:59:33,373 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2023-12-16 06:59:33,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 23 states have internal predecessors, (72), 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 06:59:33,373 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2023-12-16 06:59:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-16 06:59:33,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:59:33,375 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 14, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:59:33,381 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 06:59:33,575 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 06:59:33,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:59:33,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:59:33,576 INFO L85 PathProgramCache]: Analyzing trace with hash 202850652, now seen corresponding path program 2 times [2023-12-16 06:59:33,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:59:33,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175623188] [2023-12-16 06:59:33,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:59:33,576 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 06:59:33,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:59:33,577 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:59:33,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 06:59:33,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:59:33,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:59:33,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-16 06:59:33,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:59:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 337 proven. 301 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-12-16 06:59:34,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:59:42,335 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 337 proven. 301 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-12-16 06:59:42,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:59:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175623188] [2023-12-16 06:59:42,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175623188] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:59:42,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:59:42,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-12-16 06:59:42,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423321929] [2023-12-16 06:59:42,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:59:42,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-16 06:59:42,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:59:42,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-16 06:59:42,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=706, Unknown=0, NotChecked=0, Total=992 [2023-12-16 06:59:42,338 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand has 32 states, 32 states have (on average 3.1875) internal successors, (102), 31 states have internal predecessors, (102), 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 07:00:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:00:03,610 INFO L93 Difference]: Finished difference Result 161 states and 201 transitions. [2023-12-16 07:00:03,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-16 07:00:03,612 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 31 states have internal predecessors, (102), 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 79 [2023-12-16 07:00:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:00:03,613 INFO L225 Difference]: With dead ends: 161 [2023-12-16 07:00:03,613 INFO L226 Difference]: Without dead ends: 120 [2023-12-16 07:00:03,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=734, Invalid=1336, Unknown=0, NotChecked=0, Total=2070 [2023-12-16 07:00:03,614 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 52 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:00:03,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 84 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 07:00:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-16 07:00:03,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2023-12-16 07:00:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.1272727272727272) internal successors, (124), 110 states have internal predecessors, (124), 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 07:00:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2023-12-16 07:00:03,635 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 79 [2023-12-16 07:00:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:00:03,635 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2023-12-16 07:00:03,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 3.1875) internal successors, (102), 31 states have internal predecessors, (102), 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 07:00:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2023-12-16 07:00:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-16 07:00:03,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:00:03,637 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:00:03,666 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 (10)] Forceful destruction successful, exit code 0 [2023-12-16 07:00:03,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:00:03,841 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:00:03,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:00:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash 154263132, now seen corresponding path program 3 times [2023-12-16 07:00:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:00:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82153531] [2023-12-16 07:00:03,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:00:03,842 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 07:00:03,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:00:03,843 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:00:03,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 07:00:03,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 07:00:03,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:00:03,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:00:03,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:00:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2023-12-16 07:00:04,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:00:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2023-12-16 07:00:06,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:00:06,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82153531] [2023-12-16 07:00:06,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82153531] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:00:06,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:00:06,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 07:00:06,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815923113] [2023-12-16 07:00:06,624 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:00:06,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 07:00:06,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:00:06,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 07:00:06,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-16 07:00:06,625 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 07:00:07,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:00:07,841 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2023-12-16 07:00:07,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 07:00:07,844 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 79 [2023-12-16 07:00:07,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:00:07,845 INFO L225 Difference]: With dead ends: 133 [2023-12-16 07:00:07,845 INFO L226 Difference]: Without dead ends: 131 [2023-12-16 07:00:07,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2023-12-16 07:00:07,846 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 53 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 07:00:07,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 41 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 07:00:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-16 07:00:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2023-12-16 07:00:07,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.1384615384615384) internal successors, (148), 130 states have internal predecessors, (148), 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 07:00:07,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2023-12-16 07:00:07,857 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 79 [2023-12-16 07:00:07,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:00:07,857 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2023-12-16 07:00:07,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 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 07:00:07,857 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2023-12-16 07:00:07,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 07:00:07,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:00:07,858 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2023-12-16 07:00:07,870 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 (11)] Forceful destruction successful, exit code 0 [2023-12-16 07:00:08,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:00:08,066 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:00:08,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:00:08,067 INFO L85 PathProgramCache]: Analyzing trace with hash -28958820, now seen corresponding path program 4 times [2023-12-16 07:00:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:00:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936734760] [2023-12-16 07:00:08,067 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 07:00:08,067 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 07:00:08,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:00:08,069 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:00:08,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 07:00:08,178 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 07:00:08,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:00:08,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 07:00:08,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:00:08,666 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-16 07:00:08,666 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:00:10,766 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-16 07:00:10,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:00:10,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936734760] [2023-12-16 07:00:10,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936734760] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:00:10,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:00:10,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-16 07:00:10,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262415349] [2023-12-16 07:00:10,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:00:10,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-16 07:00:10,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:00:10,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-16 07:00:10,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 07:00:10,768 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 48 states, 48 states have (on average 3.0) internal successors, (144), 47 states have internal predecessors, (144), 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 07:00:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:00:26,635 INFO L93 Difference]: Finished difference Result 216 states and 271 transitions. [2023-12-16 07:00:26,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-16 07:00:26,636 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.0) internal successors, (144), 47 states have internal predecessors, (144), 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 99 [2023-12-16 07:00:26,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:00:26,637 INFO L225 Difference]: With dead ends: 216 [2023-12-16 07:00:26,637 INFO L226 Difference]: Without dead ends: 178 [2023-12-16 07:00:26,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-16 07:00:26,639 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 190 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-16 07:00:26,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 118 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-16 07:00:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-12-16 07:00:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2023-12-16 07:00:26,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.1412429378531073) internal successors, (202), 177 states have internal predecessors, (202), 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 07:00:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 202 transitions. [2023-12-16 07:00:26,659 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 202 transitions. Word has length 99 [2023-12-16 07:00:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:00:26,661 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 202 transitions. [2023-12-16 07:00:26,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.0) internal successors, (144), 47 states have internal predecessors, (144), 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 07:00:26,661 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 202 transitions. [2023-12-16 07:00:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-12-16 07:00:26,667 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:00:26,667 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 30, 16, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2023-12-16 07:00:26,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 07:00:26,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:00:26,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:00:26,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:00:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash -807216484, now seen corresponding path program 3 times [2023-12-16 07:00:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:00:26,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224561531] [2023-12-16 07:00:26,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 07:00:26,875 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 07:00:26,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:00:26,876 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:00:26,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 07:00:27,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-16 07:00:27,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 07:00:27,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 07:00:27,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:00:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3221 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 3151 trivial. 0 not checked. [2023-12-16 07:00:27,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 07:00:34,211 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:00:34,216 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 07:00:34,222 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:00:34,227 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 07:00:34,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 07:00:34,417 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 172 with TraceHistMax 46,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. [2023-12-16 07:00:34,421 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1] [2023-12-16 07:00:34,424 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:00:34,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:00:34 BoogieIcfgContainer [2023-12-16 07:00:34,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:00:34,428 INFO L158 Benchmark]: Toolchain (without parser) took 77420.17ms. Allocated memory is still 255.9MB. Free memory was 203.3MB in the beginning and 208.0MB in the end (delta: -4.7MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:00:34,430 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:00:34,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.95ms. Allocated memory is still 255.9MB. Free memory was 203.3MB in the beginning and 192.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 07:00:34,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.75ms. Allocated memory is still 255.9MB. Free memory was 192.0MB in the beginning and 190.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 07:00:34,432 INFO L158 Benchmark]: Boogie Preprocessor took 50.62ms. Allocated memory is still 255.9MB. Free memory was 190.5MB in the beginning and 188.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 07:00:34,432 INFO L158 Benchmark]: RCFGBuilder took 360.41ms. Allocated memory is still 255.9MB. Free memory was 188.4MB in the beginning and 175.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 07:00:34,432 INFO L158 Benchmark]: TraceAbstraction took 76797.49ms. Allocated memory is still 255.9MB. Free memory was 175.0MB in the beginning and 208.0MB in the end (delta: -33.0MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:00:34,434 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.12ms. Allocated memory is still 194.0MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.95ms. Allocated memory is still 255.9MB. Free memory was 203.3MB in the beginning and 192.0MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.75ms. Allocated memory is still 255.9MB. Free memory was 192.0MB in the beginning and 190.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.62ms. Allocated memory is still 255.9MB. Free memory was 190.5MB in the beginning and 188.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 360.41ms. Allocated memory is still 255.9MB. Free memory was 188.4MB in the beginning and 175.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 76797.49ms. Allocated memory is still 255.9MB. Free memory was 175.0MB in the beginning and 208.0MB in the end (delta: -33.0MB). There was no memory consumed. 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 - TimeoutResultAtElement [Line: 4]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4). Cancelled while NwaCegarLoop was analyzing trace of length 172 with TraceHistMax 46,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.8s, OverallIterations: 12, TraceHistogramMax: 46, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 47.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 448 SdHoareTripleChecker+Valid, 9.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 448 mSDsluCounter, 473 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 377 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3731 IncrementalHoareTripleChecker+Invalid, 3759 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 96 mSDtfsCounter, 3731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 884 GetRequests, 671 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 50.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=11, InterpolantAutomatonStates: 172, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 435 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 815 ConstructedInterpolants, 0 QuantifiedInterpolants, 4058 SizeOfPredicates, 9 NumberOfNonLiveVariables, 961 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 2658/5162 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown