/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/loop-new/count_by_k.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 23:09:22,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 23:09:22,691 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-24 23:09:22,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 23:09:22,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 23:09:22,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 23:09:22,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 23:09:22,733 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 23:09:22,733 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 23:09:22,736 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 23:09:22,736 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 23:09:22,736 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 23:09:22,736 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 23:09:22,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 23:09:22,737 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 23:09:22,738 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 23:09:22,738 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 23:09:22,738 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 23:09:22,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 23:09:22,738 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 23:09:22,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 23:09:22,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 23:09:22,739 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 23:09:22,739 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 23:09:22,739 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 23:09:22,739 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 23:09:22,739 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 23:09:22,740 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 23:09:22,740 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 23:09:22,740 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 23:09:22,741 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 23:09:22,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 23:09:22,741 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 23:09:22,741 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 23:09:22,741 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:09:22,741 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 23:09:22,741 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 23:09:22,741 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 23:09:22,741 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 23:09:22,742 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 23:09:22,742 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 23:09:22,742 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 23:09:22,742 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 23:09:22,742 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 23:09:22,742 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 23:09:22,742 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 23:09:22,743 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-24 23:09:22,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 23:09:22,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 23:09:22,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 23:09:22,912 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 23:09:22,912 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 23:09:22,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_k.i [2023-12-24 23:09:23,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 23:09:23,972 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 23:09:23,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_k.i [2023-12-24 23:09:23,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc9df707/1aa68160b3a14b938240d815a1485af5/FLAGf3107d78e [2023-12-24 23:09:23,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cc9df707/1aa68160b3a14b938240d815a1485af5 [2023-12-24 23:09:23,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 23:09:23,991 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 23:09:23,993 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 23:09:23,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 23:09:23,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 23:09:23,997 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:09:23" (1/1) ... [2023-12-24 23:09:23,998 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b943aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:23, skipping insertion in model container [2023-12-24 23:09:23,998 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 11:09:23" (1/1) ... [2023-12-24 23:09:24,013 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 23:09:24,132 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_k.i[891,904] [2023-12-24 23:09:24,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:09:24,157 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 23:09:24,168 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_k.i[891,904] [2023-12-24 23:09:24,170 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 23:09:24,181 INFO L206 MainTranslator]: Completed translation [2023-12-24 23:09:24,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24 WrapperNode [2023-12-24 23:09:24,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 23:09:24,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 23:09:24,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 23:09:24,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 23:09:24,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,205 INFO L138 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2023-12-24 23:09:24,205 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 23:09:24,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 23:09:24,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 23:09:24,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 23:09:24,212 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,222 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-24 23:09:24,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,236 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,245 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 23:09:24,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 23:09:24,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 23:09:24,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 23:09:24,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (1/1) ... [2023-12-24 23:09:24,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 23:09:24,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 23:09:24,272 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-24 23:09:24,289 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-24 23:09:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 23:09:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 23:09:24,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 23:09:24,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 23:09:24,340 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 23:09:24,342 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 23:09:24,409 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 23:09:24,426 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 23:09:24,426 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 23:09:24,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:09:24 BoogieIcfgContainer [2023-12-24 23:09:24,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 23:09:24,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 23:09:24,428 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 23:09:24,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 23:09:24,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 11:09:23" (1/3) ... [2023-12-24 23:09:24,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74300c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:09:24, skipping insertion in model container [2023-12-24 23:09:24,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 11:09:24" (2/3) ... [2023-12-24 23:09:24,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74300c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 11:09:24, skipping insertion in model container [2023-12-24 23:09:24,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 11:09:24" (3/3) ... [2023-12-24 23:09:24,431 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_k.i [2023-12-24 23:09:24,442 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 23:09:24,443 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 23:09:24,468 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 23:09:24,472 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;@7a5ef451, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 23:09:24,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 23:09:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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-24 23:09:24,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 23:09:24,479 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:09:24,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 23:09:24,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:09:24,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:09:24,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1953833895, now seen corresponding path program 1 times [2023-12-24 23:09:24,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:09:24,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442466638] [2023-12-24 23:09:24,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:09:24,492 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-24 23:09:24,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:09:24,494 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-24 23:09:24,498 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-24 23:09:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:09:24,535 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 23:09:24,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:09:24,547 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-24 23:09:24,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 23:09:24,548 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:09:24,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442466638] [2023-12-24 23:09:24,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442466638] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 23:09:24,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 23:09:24,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 23:09:24,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249078846] [2023-12-24 23:09:24,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 23:09:24,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 23:09:24,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:09:24,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 23:09:24,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 23:09:24,570 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.625) internal successors, (13), 9 states have internal predecessors, (13), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-24 23:09:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:09:24,584 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2023-12-24 23:09:24,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 23:09:24,586 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2023-12-24 23:09:24,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:09:24,590 INFO L225 Difference]: With dead ends: 17 [2023-12-24 23:09:24,591 INFO L226 Difference]: Without dead ends: 7 [2023-12-24 23:09:24,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-24 23:09:24,596 INFO L413 NwaCegarLoop]: 8 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, 8 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-24 23:09:24,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:09:24,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-12-24 23:09:24,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-12-24 23:09:24,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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-24 23:09:24,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2023-12-24 23:09:24,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 6 [2023-12-24 23:09:24,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:09:24,616 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2023-12-24 23:09:24,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-24 23:09:24,616 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2023-12-24 23:09:24,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-24 23:09:24,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:09:24,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-24 23:09:24,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 23:09:24,820 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-24 23:09:24,821 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:09:24,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:09:24,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1953655149, now seen corresponding path program 1 times [2023-12-24 23:09:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:09:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573039834] [2023-12-24 23:09:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:09:24,824 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-24 23:09:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:09:24,824 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-24 23:09:24,826 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-24 23:09:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:09:24,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 23:09:24,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:09:25,021 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-24 23:09:25,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 23:09:25,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:09:25,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573039834] [2023-12-24 23:09:25,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573039834] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 23:09:25,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 23:09:25,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 23:09:25,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165235401] [2023-12-24 23:09:25,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 23:09:25,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 23:09:25,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:09:25,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 23:09:25,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-24 23:09:25,028 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-24 23:09:25,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:09:25,081 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2023-12-24 23:09:25,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 23:09:25,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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 6 [2023-12-24 23:09:25,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:09:25,083 INFO L225 Difference]: With dead ends: 12 [2023-12-24 23:09:25,083 INFO L226 Difference]: Without dead ends: 8 [2023-12-24 23:09:25,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 23:09:25,084 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:09:25,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 7 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:09:25,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2023-12-24 23:09:25,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2023-12-24 23:09:25,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 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-24 23:09:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2023-12-24 23:09:25,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2023-12-24 23:09:25,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:09:25,086 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2023-12-24 23:09:25,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 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-24 23:09:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2023-12-24 23:09:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 23:09:25,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:09:25,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 23:09:25,089 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-24 23:09:25,287 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-24 23:09:25,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:09:25,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:09:25,289 INFO L85 PathProgramCache]: Analyzing trace with hash 454767211, now seen corresponding path program 1 times [2023-12-24 23:09:25,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:09:25,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498562838] [2023-12-24 23:09:25,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 23:09:25,290 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-24 23:09:25,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:09:25,291 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-24 23:09:25,292 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-24 23:09:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 23:09:25,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 23:09:25,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:09:25,381 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-24 23:09:25,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:09:25,446 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-24 23:09:25,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:09:25,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498562838] [2023-12-24 23:09:25,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498562838] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:09:25,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:09:25,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-12-24 23:09:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206059559] [2023-12-24 23:09:25,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:09:25,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 23:09:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:09:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 23:09:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 23:09:25,448 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-24 23:09:25,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:09:25,500 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2023-12-24 23:09:25,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 23:09:25,501 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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 7 [2023-12-24 23:09:25,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:09:25,501 INFO L225 Difference]: With dead ends: 15 [2023-12-24 23:09:25,501 INFO L226 Difference]: Without dead ends: 11 [2023-12-24 23:09:25,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 23:09:25,502 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 23:09:25,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 8 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 23:09:25,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-24 23:09:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-24 23:09:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-24 23:09:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-24 23:09:25,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2023-12-24 23:09:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:09:25,506 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-24 23:09:25,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 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-24 23:09:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-24 23:09:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-24 23:09:25,506 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:09:25,506 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-12-24 23:09:25,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 23:09:25,707 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-24 23:09:25,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:09:25,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:09:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1021032685, now seen corresponding path program 2 times [2023-12-24 23:09:25,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:09:25,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004226396] [2023-12-24 23:09:25,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 23:09:25,708 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-24 23:09:25,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:09:25,709 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-24 23:09:25,711 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-24 23:09:25,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 23:09:25,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:09:25,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 23:09:25,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:09:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:09:25,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:09:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:09:26,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:09:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004226396] [2023-12-24 23:09:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004226396] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:09:26,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:09:26,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2023-12-24 23:09:26,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443267272] [2023-12-24 23:09:26,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:09:26,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 23:09:26,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:09:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 23:09:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-12-24 23:09:26,172 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-24 23:09:26,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:09:26,531 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2023-12-24 23:09:26,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 23:09:26,532 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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 10 [2023-12-24 23:09:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:09:26,533 INFO L225 Difference]: With dead ends: 21 [2023-12-24 23:09:26,533 INFO L226 Difference]: Without dead ends: 17 [2023-12-24 23:09:26,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2023-12-24 23:09:26,534 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 23:09:26,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 16 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 23:09:26,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-24 23:09:26,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-24 23:09:26,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 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-24 23:09:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-12-24 23:09:26,538 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2023-12-24 23:09:26,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:09:26,538 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-12-24 23:09:26,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 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-24 23:09:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-12-24 23:09:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-24 23:09:26,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:09:26,538 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-12-24 23:09:26,541 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-24 23:09:26,741 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-24 23:09:26,741 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:09:26,741 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:09:26,741 INFO L85 PathProgramCache]: Analyzing trace with hash 837724205, now seen corresponding path program 3 times [2023-12-24 23:09:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:09:26,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927864507] [2023-12-24 23:09:26,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 23:09:26,742 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-24 23:09:26,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:09:26,743 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-24 23:09:26,747 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-24 23:09:26,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-24 23:09:26,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:09:26,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 23:09:26,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:09:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:09:27,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:09:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:09:28,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:09:28,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927864507] [2023-12-24 23:09:28,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927864507] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:09:28,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:09:28,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-24 23:09:28,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038774245] [2023-12-24 23:09:28,369 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:09:28,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 23:09:28,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:09:28,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 23:09:28,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2023-12-24 23:09:28,372 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-24 23:09:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:09:31,052 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2023-12-24 23:09:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-12-24 23:09:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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 16 [2023-12-24 23:09:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:09:31,053 INFO L225 Difference]: With dead ends: 33 [2023-12-24 23:09:31,053 INFO L226 Difference]: Without dead ends: 29 [2023-12-24 23:09:31,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2023-12-24 23:09:31,054 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 23:09:31,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 26 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 23:09:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-24 23:09:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-12-24 23:09:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 23:09:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-12-24 23:09:31,064 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2023-12-24 23:09:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:09:31,070 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-12-24 23:09:31,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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-24 23:09:31,070 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-12-24 23:09:31,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-24 23:09:31,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:09:31,071 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1] [2023-12-24 23:09:31,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 23:09:31,273 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-24 23:09:31,273 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:09:31,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:09:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1706608979, now seen corresponding path program 4 times [2023-12-24 23:09:31,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:09:31,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1942855959] [2023-12-24 23:09:31,274 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 23:09:31,275 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-24 23:09:31,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:09:31,275 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-24 23:09:31,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 23:09:31,325 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 23:09:31,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:09:31,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 23:09:31,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:09:32,912 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:09:32,913 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:09:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:09:39,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:09:39,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1942855959] [2023-12-24 23:09:39,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1942855959] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:09:39,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:09:39,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2023-12-24 23:09:39,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411420968] [2023-12-24 23:09:39,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:09:39,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-24 23:09:39,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:09:39,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-24 23:09:39,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=621, Invalid=1635, Unknown=0, NotChecked=0, Total=2256 [2023-12-24 23:09:39,362 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 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-24 23:10:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:10:02,541 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2023-12-24 23:10:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-12-24 23:10:02,543 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 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 28 [2023-12-24 23:10:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:10:02,543 INFO L225 Difference]: With dead ends: 57 [2023-12-24 23:10:02,543 INFO L226 Difference]: Without dead ends: 53 [2023-12-24 23:10:02,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=1683, Invalid=3287, Unknown=0, NotChecked=0, Total=4970 [2023-12-24 23:10:02,545 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 23:10:02,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 23:10:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-12-24 23:10:02,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2023-12-24 23:10:02,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 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-24 23:10:02,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2023-12-24 23:10:02,562 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 28 [2023-12-24 23:10:02,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:10:02,562 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2023-12-24 23:10:02,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 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-24 23:10:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2023-12-24 23:10:02,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-24 23:10:02,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:10:02,564 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1] [2023-12-24 23:10:02,568 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-24 23:10:02,766 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-24 23:10:02,766 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:10:02,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:10:02,767 INFO L85 PathProgramCache]: Analyzing trace with hash -252505171, now seen corresponding path program 5 times [2023-12-24 23:10:02,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:10:02,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527255447] [2023-12-24 23:10:02,767 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-24 23:10:02,767 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-24 23:10:02,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:10:02,768 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-24 23:10:02,769 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-24 23:10:02,885 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2023-12-24 23:10:02,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:10:02,889 WARN L260 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-24 23:10:02,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:10:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:10:09,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:13:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:13:29,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 23:13:29,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527255447] [2023-12-24 23:13:29,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527255447] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 23:13:29,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 23:13:29,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2023-12-24 23:13:29,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819575850] [2023-12-24 23:13:29,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 23:13:29,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-24 23:13:29,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 23:13:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-24 23:13:29,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2397, Invalid=6723, Unknown=0, NotChecked=0, Total=9120 [2023-12-24 23:13:29,350 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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-24 23:13:46,583 WARN L293 SmtUtils]: Spent 9.00s on a formula simplification. DAG size of input: 280 DAG size of output: 188 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:14:01,305 WARN L293 SmtUtils]: Spent 9.49s on a formula simplification. DAG size of input: 274 DAG size of output: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:14:15,362 WARN L293 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 268 DAG size of output: 180 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:14:28,535 WARN L293 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 262 DAG size of output: 176 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:14:39,877 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 256 DAG size of output: 172 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:14:51,803 WARN L293 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 250 DAG size of output: 168 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:15:03,431 WARN L293 SmtUtils]: Spent 6.61s on a formula simplification. DAG size of input: 244 DAG size of output: 164 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:15:14,909 WARN L293 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 238 DAG size of output: 160 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:15:25,694 WARN L293 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 232 DAG size of output: 156 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:15:35,483 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 226 DAG size of output: 152 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:15:45,388 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 220 DAG size of output: 148 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:18:42,208 WARN L293 SmtUtils]: Spent 13.63s on a formula simplification. DAG size of input: 238 DAG size of output: 220 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:18:42,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 23:18:42,659 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2023-12-24 23:18:42,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-12-24 23:18:42,670 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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 52 [2023-12-24 23:18:42,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 23:18:42,671 INFO L225 Difference]: With dead ends: 105 [2023-12-24 23:18:42,671 INFO L226 Difference]: Without dead ends: 101 [2023-12-24 23:18:42,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 468.8s TimeCoverageRelationStatistics Valid=6837, Invalid=13469, Unknown=0, NotChecked=0, Total=20306 [2023-12-24 23:18:42,675 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 60 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-24 23:18:42,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 60 Invalid, 2412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-24 23:18:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-24 23:18:42,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-24 23:18:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 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-24 23:18:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2023-12-24 23:18:42,723 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 52 [2023-12-24 23:18:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 23:18:42,724 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2023-12-24 23:18:42,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 96 states have internal predecessors, (100), 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-24 23:18:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2023-12-24 23:18:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-24 23:18:42,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 23:18:42,726 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1] [2023-12-24 23:18:42,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 23:18:42,928 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-24 23:18:42,928 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 23:18:42,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 23:18:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1739967917, now seen corresponding path program 6 times [2023-12-24 23:18:42,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 23:18:42,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323324281] [2023-12-24 23:18:42,929 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-24 23:18:42,929 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-24 23:18:42,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 23:18:42,930 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-24 23:18:42,931 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-24 23:18:43,297 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2023-12-24 23:18:43,297 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 23:18:43,307 WARN L260 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 168 conjunts are in the unsatisfiable core [2023-12-24 23:18:43,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 23:19:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 23:19:16,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 23:22:43,331 WARN L293 SmtUtils]: Spent 6.69s on a formula simplification that was a NOOP. DAG size: 162 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:23:20,840 WARN L293 SmtUtils]: Spent 5.83s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:23:40,175 WARN L293 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 177 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-24 23:24:04,740 WARN L293 SmtUtils]: Spent 6.74s on a formula simplification that was a NOOP. DAG size: 182 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-24 23:24:06,447 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 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 23:24:06,449 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-24 23:24:07,456 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-24 23:24:07,463 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 23:24:07,463 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 101 with TraceHistMax 94,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-24 23:24:07,474 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2023-12-24 23:24:07,476 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 23:24:07,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 11:24:07 BoogieIcfgContainer [2023-12-24 23:24:07,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 23:24:07,477 INFO L158 Benchmark]: Toolchain (without parser) took 883486.15ms. Allocated memory was 283.1MB in the beginning and 339.7MB in the end (delta: 56.6MB). Free memory was 238.4MB in the beginning and 136.6MB in the end (delta: 101.7MB). Peak memory consumption was 201.8MB. Max. memory is 8.0GB. [2023-12-24 23:24:07,478 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 230.7MB. Free memory is still 178.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 23:24:07,478 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.14ms. Allocated memory is still 283.1MB. Free memory was 238.0MB in the beginning and 226.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-24 23:24:07,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.82ms. Allocated memory is still 283.1MB. Free memory was 226.4MB in the beginning and 225.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 23:24:07,478 INFO L158 Benchmark]: Boogie Preprocessor took 40.21ms. Allocated memory is still 283.1MB. Free memory was 225.1MB in the beginning and 223.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 23:24:07,478 INFO L158 Benchmark]: RCFGBuilder took 180.11ms. Allocated memory is still 283.1MB. Free memory was 223.3MB in the beginning and 213.3MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2023-12-24 23:24:07,479 INFO L158 Benchmark]: TraceAbstraction took 883049.50ms. Allocated memory was 283.1MB in the beginning and 339.7MB in the end (delta: 56.6MB). Free memory was 212.5MB in the beginning and 136.6MB in the end (delta: 75.9MB). Peak memory consumption was 175.6MB. Max. memory is 8.0GB. [2023-12-24 23:24:07,479 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 230.7MB. Free memory is still 178.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.14ms. Allocated memory is still 283.1MB. Free memory was 238.0MB in the beginning and 226.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.82ms. Allocated memory is still 283.1MB. Free memory was 226.4MB in the beginning and 225.1MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.21ms. Allocated memory is still 283.1MB. Free memory was 225.1MB in the beginning and 223.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 180.11ms. Allocated memory is still 283.1MB. Free memory was 223.3MB in the beginning and 213.3MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 883049.50ms. Allocated memory was 283.1MB in the beginning and 339.7MB in the end (delta: 56.6MB). Free memory was 212.5MB in the beginning and 136.6MB in the end (delta: 75.9MB). Peak memory consumption was 175.6MB. 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: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 101 with TraceHistMax 94,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 883.0s, OverallIterations: 8, TraceHistogramMax: 94, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 339.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 77 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 173 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3286 IncrementalHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 31 mSDtfsCounter, 3286 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 502.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=7, InterpolantAutomatonStates: 198, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 216.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 9510 SizeOfPredicates, 18 NumberOfNonLiveVariables, 292 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 0/2800 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