/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-acceleration/diamond_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 22:22:19,394 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 22:22:19,437 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 22:22:19,441 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 22:22:19,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 22:22:19,466 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 22:22:19,466 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 22:22:19,466 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 22:22:19,467 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 22:22:19,467 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 22:22:19,467 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 22:22:19,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 22:22:19,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 22:22:19,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 22:22:19,475 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 22:22:19,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 22:22:19,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 22:22:19,476 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 22:22:19,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 22:22:19,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 22:22:19,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 22:22:19,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 22:22:19,478 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 22:22:19,478 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 22:22:19,478 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 22:22:19,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 22:22:19,479 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 22:22:19,479 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 22:22:19,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 22:22:19,479 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 22:22:19,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 22:22:19,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 22:22:19,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 22:22:19,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 22:22:19,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:22:19,481 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 22:22:19,481 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 22:22:19,481 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 22:22:19,481 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 22:22:19,481 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 22:22:19,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 22:22:19,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 22:22:19,482 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 22:22:19,482 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 22:22:19,482 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 22:22:19,482 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 22:22:19,482 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 22:22:19,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 22:22:19,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 22:22:19,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 22:22:19,700 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 22:22:19,701 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 22:22:19,702 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2023-12-24 22:22:20,784 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 22:22:20,932 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 22:22:20,932 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-1.c [2023-12-24 22:22:20,938 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea95084b3/04d88c876701408b988cc1fbd57fdc8a/FLAG3b0d23c41 [2023-12-24 22:22:20,953 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea95084b3/04d88c876701408b988cc1fbd57fdc8a [2023-12-24 22:22:20,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 22:22:20,957 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 22:22:20,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 22:22:20,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 22:22:20,962 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 22:22:20,963 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:22:20" (1/1) ... [2023-12-24 22:22:20,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb71453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:20, skipping insertion in model container [2023-12-24 22:22:20,964 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 10:22:20" (1/1) ... [2023-12-24 22:22:20,978 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 22:22:21,094 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-acceleration/diamond_1-1.c[373,386] [2023-12-24 22:22:21,104 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:22:21,114 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 22:22:21,123 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-acceleration/diamond_1-1.c[373,386] [2023-12-24 22:22:21,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 22:22:21,137 INFO L206 MainTranslator]: Completed translation [2023-12-24 22:22:21,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21 WrapperNode [2023-12-24 22:22:21,137 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 22:22:21,138 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 22:22:21,138 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 22:22:21,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 22:22:21,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,148 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,158 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 29 [2023-12-24 22:22:21,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 22:22:21,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 22:22:21,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 22:22:21,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 22:22:21,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,168 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,174 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 22:22:21,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,184 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,188 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 22:22:21,189 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 22:22:21,189 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 22:22:21,189 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 22:22:21,189 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (1/1) ... [2023-12-24 22:22:21,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 22:22:21,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 22:22:21,225 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 22:22:21,241 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 22:22:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 22:22:21,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 22:22:21,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 22:22:21,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 22:22:21,290 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 22:22:21,293 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 22:22:21,412 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 22:22:21,426 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 22:22:21,427 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 22:22:21,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:22:21 BoogieIcfgContainer [2023-12-24 22:22:21,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 22:22:21,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 22:22:21,433 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 22:22:21,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 22:22:21,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 10:22:20" (1/3) ... [2023-12-24 22:22:21,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e15848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:22:21, skipping insertion in model container [2023-12-24 22:22:21,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 10:22:21" (2/3) ... [2023-12-24 22:22:21,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e15848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 10:22:21, skipping insertion in model container [2023-12-24 22:22:21,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 10:22:21" (3/3) ... [2023-12-24 22:22:21,437 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond_1-1.c [2023-12-24 22:22:21,448 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 22:22:21,448 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 22:22:21,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 22:22:21,486 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;@798c018a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 22:22:21,486 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 22:22:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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 22:22:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-24 22:22:21,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:21,495 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-24 22:22:21,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:21,500 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash 63386408, now seen corresponding path program 1 times [2023-12-24 22:22:21,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:21,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579445301] [2023-12-24 22:22:21,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:22:21,509 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 22:22:21,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:21,511 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 22:22:21,528 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 22:22:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:22:21,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 22:22:21,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:21,608 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 22:22:21,609 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:22:21,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:21,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579445301] [2023-12-24 22:22:21,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579445301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:22:21,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:22:21,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 22:22:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829053711] [2023-12-24 22:22:21,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:22:21,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 22:22:21,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 22:22:21,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 22:22:21,644 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 22:22:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:21,667 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2023-12-24 22:22:21,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 22:22:21,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-24 22:22:21,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:21,678 INFO L225 Difference]: With dead ends: 15 [2023-12-24 22:22:21,678 INFO L226 Difference]: Without dead ends: 7 [2023-12-24 22:22:21,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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 22:22:21,682 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:21,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:22:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-12-24 22:22:21,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-12-24 22:22:21,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 22:22:21,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2023-12-24 22:22:21,705 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2023-12-24 22:22:21,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:21,705 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2023-12-24 22:22:21,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 22:22:21,705 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2023-12-24 22:22:21,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-24 22:22:21,705 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:21,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-24 22:22:21,723 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 22:22:21,909 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 22:22:21,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:21,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:21,910 INFO L85 PathProgramCache]: Analyzing trace with hash 63088498, now seen corresponding path program 1 times [2023-12-24 22:22:21,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:21,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175944857] [2023-12-24 22:22:21,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:22:21,910 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 22:22:21,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:21,911 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 22:22:21,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 22:22:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:22:21,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 22:22:21,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:21,973 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 22:22:21,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:22:21,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175944857] [2023-12-24 22:22:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175944857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:22:21,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:22:21,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 22:22:21,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635653298] [2023-12-24 22:22:21,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:22:21,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 22:22:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:21,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 22:22:21,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:22:21,976 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 22:22:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:21,996 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2023-12-24 22:22:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 22:22:21,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-12-24 22:22:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:21,999 INFO L225 Difference]: With dead ends: 13 [2023-12-24 22:22:21,999 INFO L226 Difference]: Without dead ends: 9 [2023-12-24 22:22:21,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:22:22,000 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:22,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:22:22,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2023-12-24 22:22:22,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2023-12-24 22:22:22,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 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 22:22:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2023-12-24 22:22:22,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2023-12-24 22:22:22,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:22,003 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2023-12-24 22:22:22,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 22:22:22,003 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2023-12-24 22:22:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 22:22:22,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:22,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 22:22:22,012 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 22:22:22,208 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 22:22:22,210 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:22,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:22,213 INFO L85 PathProgramCache]: Analyzing trace with hash 550694231, now seen corresponding path program 1 times [2023-12-24 22:22:22,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:22,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896263593] [2023-12-24 22:22:22,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:22:22,214 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 22:22:22,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:22,216 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 22:22:22,219 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 22:22:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:22:22,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 22:22:22,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:22,268 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 22:22:22,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:22:22,284 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 22:22:22,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:22,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896263593] [2023-12-24 22:22:22,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896263593] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:22:22,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:22:22,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 22:22:22,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992038604] [2023-12-24 22:22:22,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:22:22,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 22:22:22,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:22,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 22:22:22,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 22:22:22,286 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 22:22:22,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:22,338 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2023-12-24 22:22:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 22:22:22,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-24 22:22:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:22,339 INFO L225 Difference]: With dead ends: 18 [2023-12-24 22:22:22,339 INFO L226 Difference]: Without dead ends: 14 [2023-12-24 22:22:22,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:22:22,341 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:22,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 8 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:22:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-24 22:22:22,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-24 22:22:22,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 13 states have internal predecessors, (18), 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 22:22:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2023-12-24 22:22:22,351 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 18 transitions. Word has length 7 [2023-12-24 22:22:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:22,351 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 18 transitions. [2023-12-24 22:22:22,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 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 22:22:22,351 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions. [2023-12-24 22:22:22,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 22:22:22,351 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:22,352 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-12-24 22:22:22,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 22:22:22,556 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 22:22:22,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:22,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:22,557 INFO L85 PathProgramCache]: Analyzing trace with hash -788486024, now seen corresponding path program 1 times [2023-12-24 22:22:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:22,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625648892] [2023-12-24 22:22:22,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:22:22,558 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 22:22:22,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:22,563 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 22:22:22,564 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 22:22:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:22:22,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 22:22:22,593 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:22:22,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:22:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:22:22,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:22,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625648892] [2023-12-24 22:22:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625648892] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:22:22,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:22:22,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 22:22:22,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118379275] [2023-12-24 22:22:22,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:22:22,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 22:22:22,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:22,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 22:22:22,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 22:22:22,661 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:22:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:22,730 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2023-12-24 22:22:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 22:22:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 22:22:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:22,731 INFO L225 Difference]: With dead ends: 28 [2023-12-24 22:22:22,731 INFO L226 Difference]: Without dead ends: 24 [2023-12-24 22:22:22,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-12-24 22:22:22,732 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:22,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:22:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-24 22:22:22,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2023-12-24 22:22:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:22:22,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-12-24 22:22:22,735 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 9 [2023-12-24 22:22:22,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:22,736 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-12-24 22:22:22,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:22:22,736 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-12-24 22:22:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 22:22:22,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:22,736 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2023-12-24 22:22:22,775 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 22:22:22,977 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 22:22:22,978 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:22,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1713004666, now seen corresponding path program 2 times [2023-12-24 22:22:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119542147] [2023-12-24 22:22:22,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:22:22,979 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 22:22:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:22,982 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 22:22:22,989 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 22:22:23,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:22:23,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:22:23,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 22:22:23,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:22:23,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:22:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:22:23,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:23,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119542147] [2023-12-24 22:22:23,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119542147] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:22:23,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:22:23,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-24 22:22:23,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019616915] [2023-12-24 22:22:23,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:22:23,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 22:22:23,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:23,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 22:22:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 22:22:23,180 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 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 22:22:23,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:23,344 INFO L93 Difference]: Finished difference Result 54 states and 78 transitions. [2023-12-24 22:22:23,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 22:22:23,345 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 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 13 [2023-12-24 22:22:23,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:23,346 INFO L225 Difference]: With dead ends: 54 [2023-12-24 22:22:23,346 INFO L226 Difference]: Without dead ends: 50 [2023-12-24 22:22:23,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-24 22:22:23,347 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:23,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:22:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-24 22:22:23,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 26. [2023-12-24 22:22:23,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:22:23,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2023-12-24 22:22:23,356 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 13 [2023-12-24 22:22:23,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:23,357 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2023-12-24 22:22:23,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 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 22:22:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2023-12-24 22:22:23,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 22:22:23,357 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:23,357 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1, 1, 1] [2023-12-24 22:22:23,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 22:22:23,559 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 22:22:23,560 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:23,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash 657589256, now seen corresponding path program 1 times [2023-12-24 22:22:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:23,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865998395] [2023-12-24 22:22:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 22:22:23,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:22:23,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:23,564 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 22:22:23,566 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 22:22:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 22:22:23,591 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 22:22:23,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:23,608 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-24 22:22:23,609 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:22:23,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:23,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865998395] [2023-12-24 22:22:23,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865998395] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:22:23,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:22:23,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 22:22:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429071460] [2023-12-24 22:22:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:22:23,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 22:22:23,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:23,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 22:22:23,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:22:23,610 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 22:22:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:23,623 INFO L93 Difference]: Finished difference Result 60 states and 82 transitions. [2023-12-24 22:22:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 22:22:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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) Word has length 17 [2023-12-24 22:22:23,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:23,625 INFO L225 Difference]: With dead ends: 60 [2023-12-24 22:22:23,625 INFO L226 Difference]: Without dead ends: 41 [2023-12-24 22:22:23,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:22:23,626 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:23,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:22:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-24 22:22:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2023-12-24 22:22:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 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 22:22:23,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2023-12-24 22:22:23,633 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 17 [2023-12-24 22:22:23,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:23,633 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2023-12-24 22:22:23,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 22:22:23,633 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2023-12-24 22:22:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-24 22:22:23,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:23,634 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1] [2023-12-24 22:22:23,637 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 22:22:23,836 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 22:22:23,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:23,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:23,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1259241606, now seen corresponding path program 2 times [2023-12-24 22:22:23,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:23,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [943658728] [2023-12-24 22:22:23,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:22:23,837 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 22:22:23,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:23,838 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 22:22:23,840 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 22:22:23,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:22:23,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:22:23,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 22:22:23,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:23,914 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:22:23,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:22:24,017 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:22:24,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [943658728] [2023-12-24 22:22:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [943658728] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:22:24,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:22:24,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-24 22:22:24,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201214010] [2023-12-24 22:22:24,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:22:24,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 22:22:24,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:24,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 22:22:24,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-12-24 22:22:24,019 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:22:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:24,272 INFO L93 Difference]: Finished difference Result 101 states and 128 transitions. [2023-12-24 22:22:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 22:22:24,272 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-24 22:22:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:24,273 INFO L225 Difference]: With dead ends: 101 [2023-12-24 22:22:24,273 INFO L226 Difference]: Without dead ends: 97 [2023-12-24 22:22:24,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=174, Invalid=288, Unknown=0, NotChecked=0, Total=462 [2023-12-24 22:22:24,274 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 8 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:24,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 18 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 22:22:24,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-24 22:22:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 50. [2023-12-24 22:22:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 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 22:22:24,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2023-12-24 22:22:24,284 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 17 [2023-12-24 22:22:24,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:24,284 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2023-12-24 22:22:24,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 22:22:24,285 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2023-12-24 22:22:24,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 22:22:24,285 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:24,285 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1] [2023-12-24 22:22:24,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 22:22:24,487 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 22:22:24,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:24,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:24,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1550764931, now seen corresponding path program 3 times [2023-12-24 22:22:24,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:24,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1523701408] [2023-12-24 22:22:24,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:22:24,489 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 22:22:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:24,490 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 22:22:24,491 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 22:22:24,511 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 22:22:24,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:22:24,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 22:22:24,513 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-24 22:22:24,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:22:24,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:24,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1523701408] [2023-12-24 22:22:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1523701408] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:22:24,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:22:24,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 22:22:24,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172382104] [2023-12-24 22:22:24,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:22:24,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 22:22:24,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:24,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 22:22:24,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:22:24,547 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 22:22:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:24,565 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2023-12-24 22:22:24,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 22:22:24,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 23 [2023-12-24 22:22:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:24,566 INFO L225 Difference]: With dead ends: 75 [2023-12-24 22:22:24,566 INFO L226 Difference]: Without dead ends: 54 [2023-12-24 22:22:24,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 22:22:24,571 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:24,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:22:24,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-24 22:22:24,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2023-12-24 22:22:24,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 22:22:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2023-12-24 22:22:24,591 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 23 [2023-12-24 22:22:24,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:24,591 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2023-12-24 22:22:24,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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 22:22:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2023-12-24 22:22:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-24 22:22:24,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:24,592 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2023-12-24 22:22:24,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-12-24 22:22:24,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:22:24,795 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:24,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:24,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1684695516, now seen corresponding path program 3 times [2023-12-24 22:22:24,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:24,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108675889] [2023-12-24 22:22:24,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 22:22:24,796 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 22:22:24,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:24,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:22:24,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 22:22:24,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 22:22:24,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:22:24,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 22:22:24,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-24 22:22:24,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 22:22:24,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:24,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108675889] [2023-12-24 22:22:24,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108675889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 22:22:24,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 22:22:24,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 22:22:24,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422143700] [2023-12-24 22:22:24,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 22:22:24,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 22:22:24,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:24,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 22:22:24,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 22:22:24,956 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 22:22:24,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:24,992 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2023-12-24 22:22:24,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 22:22:24,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-12-24 22:22:24,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:24,993 INFO L225 Difference]: With dead ends: 53 [2023-12-24 22:22:24,993 INFO L226 Difference]: Without dead ends: 30 [2023-12-24 22:22:24,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-24 22:22:24,994 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:24,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 15 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 22:22:24,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-24 22:22:24,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-12-24 22:22:24,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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 22:22:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2023-12-24 22:22:24,997 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2023-12-24 22:22:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:24,997 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2023-12-24 22:22:24,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 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 22:22:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2023-12-24 22:22:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-24 22:22:24,998 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 22:22:24,998 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1] [2023-12-24 22:22:25,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-24 22:22:25,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:22:25,200 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 22:22:25,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 22:22:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash 187265174, now seen corresponding path program 2 times [2023-12-24 22:22:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 22:22:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1218780270] [2023-12-24 22:22:25,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 22:22:25,201 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 22:22:25,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 22:22:25,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 22:22:25,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 22:22:25,226 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 22:22:25,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 22:22:25,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 22:22:25,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 22:22:25,396 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 22:22:25,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 22:22:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-24 22:22:25,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 22:22:25,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1218780270] [2023-12-24 22:22:25,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1218780270] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 22:22:25,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 22:22:25,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 4] total 18 [2023-12-24 22:22:25,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282669131] [2023-12-24 22:22:25,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 22:22:25,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 22:22:25,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 22:22:25,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 22:22:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-12-24 22:22:25,637 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 22:22:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 22:22:25,901 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2023-12-24 22:22:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 22:22:25,902 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-24 22:22:25,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 22:22:25,902 INFO L225 Difference]: With dead ends: 35 [2023-12-24 22:22:25,902 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 22:22:25,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 28 SyntacticMatches, 11 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2023-12-24 22:22:25,903 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 4 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 22:22:25,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 0 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 22:22:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 22:22:25,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 22:22:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 22:22:25,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 22:22:25,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2023-12-24 22:22:25,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 22:22:25,904 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 22:22:25,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0) internal successors, (38), 18 states have internal predecessors, (38), 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 22:22:25,904 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 22:22:25,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 22:22:25,906 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 22:22:25,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 22:22:26,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 22:22:26,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 22:22:26,247 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 22:22:26,247 INFO L899 garLoopResultBuilder]: For program point L17-2(lines 17 23) no Hoare annotation was computed. [2023-12-24 22:22:26,247 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 22:22:26,247 INFO L899 garLoopResultBuilder]: For program point L7(lines 7 9) no Hoare annotation was computed. [2023-12-24 22:22:26,247 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2023-12-24 22:22:26,247 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2023-12-24 22:22:26,247 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 22) no Hoare annotation was computed. [2023-12-24 22:22:26,248 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 17 23) the Hoare annotation is: (let ((.cse0 (= (bvurem |ULTIMATE.start_main_~y~0#1| (_ bv2 32)) (_ bv0 32)))) (or (and .cse0 (= (bvurem |ULTIMATE.start_main_~x~0#1| (_ bv2 32)) (_ bv0 32))) (and (bvult (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~x~0#1|) (_ bv99 32)) (not .cse0)) (= |ULTIMATE.start_main_~x~0#1| (_ bv0 32)))) [2023-12-24 22:22:26,248 INFO L899 garLoopResultBuilder]: For program point L8(line 8) no Hoare annotation was computed. [2023-12-24 22:22:26,250 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1] [2023-12-24 22:22:26,251 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 22:22:26,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 10:22:26 BoogieIcfgContainer [2023-12-24 22:22:26,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 22:22:26,270 INFO L158 Benchmark]: Toolchain (without parser) took 5313.23ms. Allocated memory is still 281.0MB. Free memory was 227.2MB in the beginning and 100.4MB in the end (delta: 126.8MB). Peak memory consumption was 127.8MB. Max. memory is 8.0GB. [2023-12-24 22:22:26,270 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 206.6MB. Free memory was 156.5MB in the beginning and 156.5MB in the end (delta: 89.0kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 22:22:26,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.05ms. Allocated memory is still 281.0MB. Free memory was 227.2MB in the beginning and 216.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-24 22:22:26,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.67ms. Allocated memory is still 281.0MB. Free memory was 216.3MB in the beginning and 214.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 22:22:26,270 INFO L158 Benchmark]: Boogie Preprocessor took 29.15ms. Allocated memory is still 281.0MB. Free memory was 214.9MB in the beginning and 213.1MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 22:22:26,271 INFO L158 Benchmark]: RCFGBuilder took 238.37ms. Allocated memory is still 281.0MB. Free memory was 213.1MB in the beginning and 202.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-24 22:22:26,271 INFO L158 Benchmark]: TraceAbstraction took 4836.83ms. Allocated memory is still 281.0MB. Free memory was 202.1MB in the beginning and 100.4MB in the end (delta: 101.6MB). Peak memory consumption was 102.7MB. Max. memory is 8.0GB. [2023-12-24 22:22:26,272 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.43ms. Allocated memory is still 206.6MB. Free memory was 156.5MB in the beginning and 156.5MB in the end (delta: 89.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.05ms. Allocated memory is still 281.0MB. Free memory was 227.2MB in the beginning and 216.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.67ms. Allocated memory is still 281.0MB. Free memory was 216.3MB in the beginning and 214.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.15ms. Allocated memory is still 281.0MB. Free memory was 214.9MB in the beginning and 213.1MB in the end (delta: 1.8MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 238.37ms. Allocated memory is still 281.0MB. Free memory was 213.1MB in the beginning and 202.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4836.83ms. Allocated memory is still 281.0MB. Free memory was 202.1MB in the beginning and 100.4MB in the end (delta: 101.6MB). Peak memory consumption was 102.7MB. 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 - PositiveResult [Line: 8]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 10, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 113 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 61 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 834 IncrementalHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 52 mSDtfsCounter, 834 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=7, InterpolantAutomatonStates: 78, 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, 10 MinimizatonAttempts, 87 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 25 NumberOfFragments, 27 HoareAnnotationTreeSize, 1 FormulaSimplifications, 1221 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FormulaSimplificationsInter, 486 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 150 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 883 SizeOfPredicates, 7 NumberOfNonLiveVariables, 285 ConjunctsInSsa, 52 ConjunctsInUnsatCore, 15 InterpolantComputations, 5 PerfectInterpolantSequences, 289/619 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((y % 2) == 0) && ((x % 2) == 0)) || ((((-1 + x) % 4294967296) < 99) && !(((y % 2) == 0)))) || (x == 0)) RESULT: Ultimate proved your program to be correct! [2023-12-24 22:22:26,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...