/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/eca-rers2012/Problem15_label38.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-22 13:28:49,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-22 13:28:49,136 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-22 13:28:49,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-22 13:28:49,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-22 13:28:49,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-22 13:28:49,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-22 13:28:49,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-22 13:28:49,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-22 13:28:49,164 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-22 13:28:49,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-22 13:28:49,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-22 13:28:49,165 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-22 13:28:49,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-22 13:28:49,168 INFO L153 SettingsManager]: * Use SBE=true [2023-12-22 13:28:49,169 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-22 13:28:49,169 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-22 13:28:49,169 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-22 13:28:49,169 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-22 13:28:49,169 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-22 13:28:49,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-22 13:28:49,171 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-22 13:28:49,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-22 13:28:49,171 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-22 13:28:49,171 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-22 13:28:49,171 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-22 13:28:49,171 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-22 13:28:49,171 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-22 13:28:49,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-22 13:28:49,172 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-22 13:28:49,173 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-22 13:28:49,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-22 13:28:49,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-22 13:28:49,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-22 13:28:49,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 13:28:49,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-22 13:28:49,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-22 13:28:49,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-22 13:28:49,173 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-22 13:28:49,174 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-22 13:28:49,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-22 13:28:49,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-22 13:28:49,174 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-22 13:28:49,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-22 13:28:49,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-22 13:28:49,174 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-22 13:28:49,174 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-22 13:28:49,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-22 13:28:49,370 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-22 13:28:49,371 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-22 13:28:49,372 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-22 13:28:49,372 INFO L274 PluginConnector]: CDTParser initialized [2023-12-22 13:28:49,374 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem15_label38.c [2023-12-22 13:28:50,344 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-22 13:28:50,604 INFO L384 CDTParser]: Found 1 translation units. [2023-12-22 13:28:50,604 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label38.c [2023-12-22 13:28:50,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ff1dc3e/e535a0bb9b884079a314bdca2ae905a8/FLAGdce90106a [2023-12-22 13:28:50,632 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24ff1dc3e/e535a0bb9b884079a314bdca2ae905a8 [2023-12-22 13:28:50,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-22 13:28:50,635 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-22 13:28:50,636 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-22 13:28:50,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-22 13:28:50,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-22 13:28:50,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:28:50" (1/1) ... [2023-12-22 13:28:50,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b37333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:50, skipping insertion in model container [2023-12-22 13:28:50,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:28:50" (1/1) ... [2023-12-22 13:28:50,692 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-22 13:28:50,827 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label38.c[3800,3813] [2023-12-22 13:28:51,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 13:28:51,200 INFO L202 MainTranslator]: Completed pre-run [2023-12-22 13:28:51,221 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem15_label38.c[3800,3813] [2023-12-22 13:28:51,453 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-22 13:28:51,464 INFO L206 MainTranslator]: Completed translation [2023-12-22 13:28:51,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51 WrapperNode [2023-12-22 13:28:51,465 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-22 13:28:51,465 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-22 13:28:51,465 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-22 13:28:51,465 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-22 13:28:51,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,548 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2023-12-22 13:28:51,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-22 13:28:51,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-22 13:28:51,549 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-22 13:28:51,549 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-22 13:28:51,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,604 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-22 13:28:51,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,649 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,682 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-22 13:28:51,717 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-22 13:28:51,717 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-22 13:28:51,717 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-22 13:28:51,718 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (1/1) ... [2023-12-22 13:28:51,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-22 13:28:51,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-22 13:28:51,762 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-22 13:28:51,805 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-22 13:28:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-22 13:28:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-22 13:28:51,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-22 13:28:51,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-22 13:28:51,882 INFO L241 CfgBuilder]: Building ICFG [2023-12-22 13:28:51,885 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-22 13:29:08,994 INFO L282 CfgBuilder]: Performing block encoding [2023-12-22 13:29:09,037 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-22 13:29:09,037 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-22 13:29:09,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:29:09 BoogieIcfgContainer [2023-12-22 13:29:09,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-22 13:29:09,039 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-22 13:29:09,039 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-22 13:29:09,041 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-22 13:29:09,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:28:50" (1/3) ... [2023-12-22 13:29:09,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb394ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:29:09, skipping insertion in model container [2023-12-22 13:29:09,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:28:51" (2/3) ... [2023-12-22 13:29:09,042 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb394ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:29:09, skipping insertion in model container [2023-12-22 13:29:09,042 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:29:09" (3/3) ... [2023-12-22 13:29:09,043 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label38.c [2023-12-22 13:29:09,078 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-22 13:29:09,078 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-22 13:29:09,125 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-22 13:29:09,129 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;@6825cfbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-22 13:29:09,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-22 13:29:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 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-22 13:29:09,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-22 13:29:09,146 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 13:29:09,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:29:09,147 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 13:29:09,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 13:29:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash 607558009, now seen corresponding path program 1 times [2023-12-22 13:29:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 13:29:09,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938413746] [2023-12-22 13:29:09,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 13:29:09,160 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-22 13:29:09,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 13:29:09,163 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-22 13:29:09,178 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-22 13:29:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 13:29:09,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-22 13:29:09,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 13:29:09,264 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-22 13:29:09,264 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 13:29:09,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 13:29:09,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938413746] [2023-12-22 13:29:09,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938413746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 13:29:09,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 13:29:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 13:29:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580833126] [2023-12-22 13:29:09,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 13:29:09,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-22 13:29:09,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 13:29:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-22 13:29:09,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-22 13:29:09,320 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 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 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 13:29:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 13:29:09,372 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2023-12-22 13:29:09,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-22 13:29:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-22 13:29:09,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 13:29:09,385 INFO L225 Difference]: With dead ends: 723 [2023-12-22 13:29:09,385 INFO L226 Difference]: Without dead ends: 360 [2023-12-22 13:29:09,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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-22 13:29:09,390 INFO L413 NwaCegarLoop]: 623 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, 623 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-22 13:29:09,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-22 13:29:09,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-12-22 13:29:09,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2023-12-22 13:29:09,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 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-22 13:29:09,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2023-12-22 13:29:09,427 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 29 [2023-12-22 13:29:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 13:29:09,428 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2023-12-22 13:29:09,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 13:29:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2023-12-22 13:29:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-22 13:29:09,428 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 13:29:09,429 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:29:09,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-22 13:29:09,631 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-22 13:29:09,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 13:29:09,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 13:29:09,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1401167343, now seen corresponding path program 1 times [2023-12-22 13:29:09,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 13:29:09,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024111821] [2023-12-22 13:29:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 13:29:09,633 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-22 13:29:09,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 13:29:09,635 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-22 13:29:09,656 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-22 13:29:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 13:29:09,676 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 13:29:09,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 13:29:09,948 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-22 13:29:09,948 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 13:29:09,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 13:29:09,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024111821] [2023-12-22 13:29:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024111821] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 13:29:09,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 13:29:09,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 13:29:09,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958275812] [2023-12-22 13:29:09,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 13:29:09,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 13:29:09,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 13:29:09,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 13:29:09,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 13:29:09,954 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 13:29:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 13:29:33,969 INFO L93 Difference]: Finished difference Result 1034 states and 1810 transitions. [2023-12-22 13:29:33,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 13:29:33,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-22 13:29:33,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 13:29:33,972 INFO L225 Difference]: With dead ends: 1034 [2023-12-22 13:29:33,972 INFO L226 Difference]: Without dead ends: 675 [2023-12-22 13:29:33,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-22 13:29:33,974 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 291 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.9s IncrementalHoareTripleChecker+Time [2023-12-22 13:29:33,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 224 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 23.9s Time] [2023-12-22 13:29:33,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2023-12-22 13:29:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 667. [2023-12-22 13:29:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 666 states have (on average 1.578078078078078) internal successors, (1051), 666 states have internal predecessors, (1051), 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-22 13:29:34,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1051 transitions. [2023-12-22 13:29:34,005 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1051 transitions. Word has length 29 [2023-12-22 13:29:34,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 13:29:34,006 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 1051 transitions. [2023-12-22 13:29:34,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-22 13:29:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1051 transitions. [2023-12-22 13:29:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-22 13:29:34,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 13:29:34,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:29:34,020 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-22 13:29:34,220 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-22 13:29:34,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 13:29:34,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 13:29:34,221 INFO L85 PathProgramCache]: Analyzing trace with hash 323754947, now seen corresponding path program 1 times [2023-12-22 13:29:34,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 13:29:34,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109439549] [2023-12-22 13:29:34,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 13:29:34,223 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-22 13:29:34,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 13:29:34,224 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-22 13:29:34,240 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-22 13:29:34,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 13:29:34,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 13:29:34,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 13:29:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 13:29:34,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 13:29:34,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 13:29:34,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109439549] [2023-12-22 13:29:34,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109439549] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 13:29:34,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 13:29:34,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 13:29:34,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680889857] [2023-12-22 13:29:34,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 13:29:34,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 13:29:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 13:29:34,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 13:29:34,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 13:29:34,835 INFO L87 Difference]: Start difference. First operand 667 states and 1051 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-22 13:30:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 13:30:03,441 INFO L93 Difference]: Finished difference Result 1629 states and 2634 transitions. [2023-12-22 13:30:03,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 13:30:03,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2023-12-22 13:30:03,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 13:30:03,465 INFO L225 Difference]: With dead ends: 1629 [2023-12-22 13:30:03,465 INFO L226 Difference]: Without dead ends: 963 [2023-12-22 13:30:03,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 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-22 13:30:03,466 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 248 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2023-12-22 13:30:03,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 345 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 28.5s Time] [2023-12-22 13:30:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-12-22 13:30:03,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 961. [2023-12-22 13:30:03,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 960 states have (on average 1.3635416666666667) internal successors, (1309), 960 states have internal predecessors, (1309), 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-22 13:30:03,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1309 transitions. [2023-12-22 13:30:03,494 INFO L78 Accepts]: Start accepts. Automaton has 961 states and 1309 transitions. Word has length 95 [2023-12-22 13:30:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 13:30:03,495 INFO L495 AbstractCegarLoop]: Abstraction has 961 states and 1309 transitions. [2023-12-22 13:30:03,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-22 13:30:03,495 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1309 transitions. [2023-12-22 13:30:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-22 13:30:03,497 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 13:30:03,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:30:03,501 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-22 13:30:03,700 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-22 13:30:03,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 13:30:03,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 13:30:03,705 INFO L85 PathProgramCache]: Analyzing trace with hash -683661255, now seen corresponding path program 1 times [2023-12-22 13:30:03,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 13:30:03,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94793559] [2023-12-22 13:30:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 13:30:03,706 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-22 13:30:03,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 13:30:03,707 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-22 13:30:03,715 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-22 13:30:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 13:30:03,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 13:30:03,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 13:30:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 13:30:04,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 13:30:04,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 13:30:04,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94793559] [2023-12-22 13:30:04,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94793559] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 13:30:04,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 13:30:04,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-22 13:30:04,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304230199] [2023-12-22 13:30:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 13:30:04,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 13:30:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 13:30:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 13:30:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 13:30:04,329 INFO L87 Difference]: Start difference. First operand 961 states and 1309 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-22 13:30:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 13:30:29,079 INFO L93 Difference]: Finished difference Result 1927 states and 2830 transitions. [2023-12-22 13:30:29,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 13:30:29,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2023-12-22 13:30:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 13:30:29,083 INFO L225 Difference]: With dead ends: 1927 [2023-12-22 13:30:29,083 INFO L226 Difference]: Without dead ends: 1266 [2023-12-22 13:30:29,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 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-22 13:30:29,085 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 256 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2023-12-22 13:30:29,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 316 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 24.7s Time] [2023-12-22 13:30:29,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2023-12-22 13:30:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1264. [2023-12-22 13:30:29,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 1263 states have (on average 1.3048297703879652) internal successors, (1648), 1263 states have internal predecessors, (1648), 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-22 13:30:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1648 transitions. [2023-12-22 13:30:29,105 INFO L78 Accepts]: Start accepts. Automaton has 1264 states and 1648 transitions. Word has length 99 [2023-12-22 13:30:29,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 13:30:29,106 INFO L495 AbstractCegarLoop]: Abstraction has 1264 states and 1648 transitions. [2023-12-22 13:30:29,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-22 13:30:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1264 states and 1648 transitions. [2023-12-22 13:30:29,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2023-12-22 13:30:29,113 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 13:30:29,113 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:30:29,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-22 13:30:29,318 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-22 13:30:29,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 13:30:29,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 13:30:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1455098654, now seen corresponding path program 1 times [2023-12-22 13:30:29,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 13:30:29,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267010204] [2023-12-22 13:30:29,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 13:30:29,321 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-22 13:30:29,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 13:30:29,322 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-22 13:30:29,351 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-22 13:30:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 13:30:29,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-22 13:30:29,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 13:30:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 13:30:33,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 13:30:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 97 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 13:30:37,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 13:30:37,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267010204] [2023-12-22 13:30:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267010204] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 13:30:37,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 13:30:37,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-22 13:30:37,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667770692] [2023-12-22 13:30:37,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 13:30:37,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 13:30:37,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 13:30:37,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 13:30:37,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-22 13:30:37,201 INFO L87 Difference]: Start difference. First operand 1264 states and 1648 transitions. Second operand has 6 states, 6 states have (on average 53.166666666666664) internal successors, (319), 5 states have internal predecessors, (319), 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-22 13:31:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 13:31:28,381 INFO L93 Difference]: Finished difference Result 2627 states and 3437 transitions. [2023-12-22 13:31:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 13:31:28,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 53.166666666666664) internal successors, (319), 5 states have internal predecessors, (319), 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 195 [2023-12-22 13:31:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 13:31:28,410 INFO L225 Difference]: With dead ends: 2627 [2023-12-22 13:31:28,410 INFO L226 Difference]: Without dead ends: 1563 [2023-12-22 13:31:28,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-22 13:31:28,412 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 632 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 2588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.9s IncrementalHoareTripleChecker+Time [2023-12-22 13:31:28,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 441 Invalid, 2588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 50.9s Time] [2023-12-22 13:31:28,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2023-12-22 13:31:28,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2023-12-22 13:31:28,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1562 states have (on average 1.1939820742637643) internal successors, (1865), 1562 states have internal predecessors, (1865), 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-22 13:31:28,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1865 transitions. [2023-12-22 13:31:28,431 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1865 transitions. Word has length 195 [2023-12-22 13:31:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 13:31:28,432 INFO L495 AbstractCegarLoop]: Abstraction has 1563 states and 1865 transitions. [2023-12-22 13:31:28,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.166666666666664) internal successors, (319), 5 states have internal predecessors, (319), 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-22 13:31:28,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1865 transitions. [2023-12-22 13:31:28,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2023-12-22 13:31:28,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 13:31:28,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:31:28,442 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-22 13:31:28,642 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-22 13:31:28,643 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 13:31:28,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 13:31:28,643 INFO L85 PathProgramCache]: Analyzing trace with hash 429450476, now seen corresponding path program 1 times [2023-12-22 13:31:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 13:31:28,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779103323] [2023-12-22 13:31:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 13:31:28,645 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-22 13:31:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 13:31:28,646 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-22 13:31:28,647 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-22 13:31:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 13:31:28,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-22 13:31:28,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 13:31:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 13:31:29,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-22 13:31:29,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 13:31:29,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779103323] [2023-12-22 13:31:29,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779103323] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-22 13:31:29,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-22 13:31:29,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-22 13:31:29,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408135125] [2023-12-22 13:31:29,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 13:31:29,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 13:31:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 13:31:29,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 13:31:29,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-22 13:31:29,394 INFO L87 Difference]: Start difference. First operand 1563 states and 1865 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-22 13:31:53,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 13:31:53,632 INFO L93 Difference]: Finished difference Result 3439 states and 4278 transitions. [2023-12-22 13:31:53,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 13:31:53,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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 375 [2023-12-22 13:31:53,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 13:31:53,659 INFO L225 Difference]: With dead ends: 3439 [2023-12-22 13:31:53,659 INFO L226 Difference]: Without dead ends: 2176 [2023-12-22 13:31:53,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 373 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-22 13:31:53,661 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 242 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2023-12-22 13:31:53,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 617 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 24.2s Time] [2023-12-22 13:31:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2023-12-22 13:31:53,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2173. [2023-12-22 13:31:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 2172 states have (on average 1.166206261510129) internal successors, (2533), 2172 states have internal predecessors, (2533), 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-22 13:31:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 2533 transitions. [2023-12-22 13:31:53,684 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 2533 transitions. Word has length 375 [2023-12-22 13:31:53,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 13:31:53,685 INFO L495 AbstractCegarLoop]: Abstraction has 2173 states and 2533 transitions. [2023-12-22 13:31:53,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 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-22 13:31:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 2533 transitions. [2023-12-22 13:31:53,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2023-12-22 13:31:53,688 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 13:31:53,689 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:31:53,704 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-22 13:31:53,904 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-22 13:31:53,905 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 13:31:53,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 13:31:53,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1533004960, now seen corresponding path program 1 times [2023-12-22 13:31:53,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 13:31:53,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845118884] [2023-12-22 13:31:53,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 13:31:53,907 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-22 13:31:53,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 13:31:53,917 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-22 13:31:53,940 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-22 13:31:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 13:31:54,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-22 13:31:54,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 13:31:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 55 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 13:31:58,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 13:32:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 55 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 13:32:12,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 13:32:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845118884] [2023-12-22 13:32:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845118884] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 13:32:12,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 13:32:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-22 13:32:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566057501] [2023-12-22 13:32:12,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 13:32:12,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-22 13:32:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 13:32:12,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-22 13:32:12,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-22 13:32:12,994 INFO L87 Difference]: Start difference. First operand 2173 states and 2533 transitions. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 5 states have internal predecessors, (783), 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-22 13:32:27,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:32:33,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:32:37,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:32:40,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:32:42,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:32:46,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:32:48,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:33:01,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:33:06,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:33:11,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:33:40,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:33:44,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:33:46,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:34:05,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:34:36,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:34:42,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:35:24,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:35:27,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:35:34,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:35:45,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:35:49,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:35:57,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:35:58,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:35:59,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:10,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:11,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:13,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:19,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:21,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:24,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:30,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:33,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:46,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:47,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:50,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:52,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:36:56,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:00,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:01,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:11,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:20,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:25,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:33,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:36,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:38,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:44,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:37:55,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:38:02,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:38:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 13:38:12,266 INFO L93 Difference]: Finished difference Result 7379 states and 8930 transitions. [2023-12-22 13:38:12,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-22 13:38:12,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 5 states have internal predecessors, (783), 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 406 [2023-12-22 13:38:12,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 13:38:12,308 INFO L225 Difference]: With dead ends: 7379 [2023-12-22 13:38:12,308 INFO L226 Difference]: Without dead ends: 5506 [2023-12-22 13:38:12,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 811 GetRequests, 806 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-22 13:38:12,311 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 845 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 1220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 342.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 3889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1220 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 358.7s IncrementalHoareTripleChecker+Time [2023-12-22 13:38:12,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 172 Invalid, 3889 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1220 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 358.7s Time] [2023-12-22 13:38:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5506 states. [2023-12-22 13:38:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5506 to 4578. [2023-12-22 13:38:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4578 states, 4577 states have (on average 1.228970941664846) internal successors, (5625), 4577 states have internal predecessors, (5625), 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-22 13:38:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4578 states to 4578 states and 5625 transitions. [2023-12-22 13:38:12,375 INFO L78 Accepts]: Start accepts. Automaton has 4578 states and 5625 transitions. Word has length 406 [2023-12-22 13:38:12,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 13:38:12,376 INFO L495 AbstractCegarLoop]: Abstraction has 4578 states and 5625 transitions. [2023-12-22 13:38:12,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 5 states have internal predecessors, (783), 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-22 13:38:12,376 INFO L276 IsEmpty]: Start isEmpty. Operand 4578 states and 5625 transitions. [2023-12-22 13:38:12,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2023-12-22 13:38:12,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 13:38:12,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:38:12,389 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-22 13:38:12,587 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-22 13:38:12,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 13:38:12,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 13:38:12,588 INFO L85 PathProgramCache]: Analyzing trace with hash -385922018, now seen corresponding path program 1 times [2023-12-22 13:38:12,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 13:38:12,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1114976505] [2023-12-22 13:38:12,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 13:38:12,590 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-22 13:38:12,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 13:38:12,591 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-22 13:38:12,616 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-22 13:38:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 13:38:12,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-22 13:38:12,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 13:38:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-22 13:38:16,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 13:38:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-22 13:38:16,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 13:38:16,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1114976505] [2023-12-22 13:38:16,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1114976505] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-22 13:38:16,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-22 13:38:16,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-22 13:38:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748680540] [2023-12-22 13:38:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-22 13:38:16,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-22 13:38:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 13:38:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-22 13:38:16,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 13:38:16,648 INFO L87 Difference]: Start difference. First operand 4578 states and 5625 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-22 13:38:37,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:38:46,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:38:46,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-22 13:38:46,078 INFO L93 Difference]: Finished difference Result 10946 states and 13969 transitions. [2023-12-22 13:38:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-22 13:38:46,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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 418 [2023-12-22 13:38:46,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-22 13:38:46,120 INFO L225 Difference]: With dead ends: 10946 [2023-12-22 13:38:46,120 INFO L226 Difference]: Without dead ends: 7567 [2023-12-22 13:38:46,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 834 GetRequests, 831 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-22 13:38:46,126 INFO L413 NwaCegarLoop]: 438 mSDtfsCounter, 374 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2023-12-22 13:38:46,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 457 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 29.3s Time] [2023-12-22 13:38:46,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2023-12-22 13:38:46,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 7567. [2023-12-22 13:38:46,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7567 states, 7566 states have (on average 1.2443827650013217) internal successors, (9415), 7566 states have internal predecessors, (9415), 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-22 13:38:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7567 states to 7567 states and 9415 transitions. [2023-12-22 13:38:46,222 INFO L78 Accepts]: Start accepts. Automaton has 7567 states and 9415 transitions. Word has length 418 [2023-12-22 13:38:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-22 13:38:46,222 INFO L495 AbstractCegarLoop]: Abstraction has 7567 states and 9415 transitions. [2023-12-22 13:38:46,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 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-22 13:38:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7567 states and 9415 transitions. [2023-12-22 13:38:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2023-12-22 13:38:46,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-22 13:38:46,225 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:38:46,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-22 13:38:46,431 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-22 13:38:46,432 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-22 13:38:46,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-22 13:38:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash -281307127, now seen corresponding path program 1 times [2023-12-22 13:38:46,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-22 13:38:46,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276233024] [2023-12-22 13:38:46,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-22 13:38:46,435 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-22 13:38:46,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-22 13:38:46,436 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-22 13:38:46,437 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-22 13:38:46,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-22 13:38:46,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-22 13:38:46,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-22 13:38:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 83 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 13:38:57,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-22 13:40:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 212 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-22 13:40:27,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-22 13:40:27,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276233024] [2023-12-22 13:40:27,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276233024] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-22 13:40:27,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-22 13:40:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-12-22 13:40:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612516232] [2023-12-22 13:40:27,122 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-22 13:40:27,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-22 13:40:27,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-22 13:40:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-22 13:40:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-22 13:40:27,124 INFO L87 Difference]: Start difference. First operand 7567 states and 9415 transitions. Second operand has 9 states, 9 states have (on average 92.77777777777777) internal successors, (835), 8 states have internal predecessors, (835), 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-22 13:41:01,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:03,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:07,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:18,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:21,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:22,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:27,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:34,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:37,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:44,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:45,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:53,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:41:58,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:00,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:03,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:10,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:14,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:19,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:21,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:31,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:37,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:38,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:42,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:43,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:45,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:49,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:53,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:42:59,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:43:01,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:43:10,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:43:13,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:43:21,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:43:24,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-12-22 13:43:29,134 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 13:43:29,178 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-22 13:43:29,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.04s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-22 13:43:30,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-22 13:43:30,335 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-22 13:43:30,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 901 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-12-22 13:43:30,374 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1860 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5277 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 166.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1860 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 5638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 5277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 181.8s IncrementalHoareTripleChecker+Time [2023-12-22 13:43:30,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1860 Valid, 174 Invalid, 5638 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [360 Valid, 5277 Invalid, 0 Unknown, 0 Unchecked, 181.8s Time] [2023-12-22 13:43:30,375 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-22 13:43:30,376 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-22 13:43:30,379 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-22 13:43:30,381 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-22 13:43:30,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:43:30 BoogieIcfgContainer [2023-12-22 13:43:30,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-22 13:43:30,383 INFO L158 Benchmark]: Toolchain (without parser) took 879747.37ms. Allocated memory was 204.5MB in the beginning and 436.2MB in the end (delta: 231.7MB). Free memory was 136.5MB in the beginning and 306.7MB in the end (delta: -170.2MB). Peak memory consumption was 256.9MB. Max. memory is 8.0GB. [2023-12-22 13:43:30,383 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 204.5MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-22 13:43:30,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 828.39ms. Allocated memory was 204.5MB in the beginning and 282.1MB in the end (delta: 77.6MB). Free memory was 136.3MB in the beginning and 230.3MB in the end (delta: -94.0MB). Peak memory consumption was 53.1MB. Max. memory is 8.0GB. [2023-12-22 13:43:30,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.23ms. Allocated memory is still 282.1MB. Free memory was 230.3MB in the beginning and 215.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-22 13:43:30,383 INFO L158 Benchmark]: Boogie Preprocessor took 167.23ms. Allocated memory is still 282.1MB. Free memory was 215.3MB in the beginning and 197.8MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-22 13:43:30,384 INFO L158 Benchmark]: RCFGBuilder took 17320.47ms. Allocated memory is still 282.1MB. Free memory was 197.8MB in the beginning and 117.8MB in the end (delta: 80.1MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. [2023-12-22 13:43:30,385 INFO L158 Benchmark]: TraceAbstraction took 861343.69ms. Allocated memory was 282.1MB in the beginning and 436.2MB in the end (delta: 154.1MB). Free memory was 117.2MB in the beginning and 306.7MB in the end (delta: -189.5MB). Peak memory consumption was 158.7MB. Max. memory is 8.0GB. [2023-12-22 13:43:30,393 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-12-22 13:43:30,393 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 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 204.5MB. Free memory is still 154.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 828.39ms. Allocated memory was 204.5MB in the beginning and 282.1MB in the end (delta: 77.6MB). Free memory was 136.3MB in the beginning and 230.3MB in the end (delta: -94.0MB). Peak memory consumption was 53.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 83.23ms. Allocated memory is still 282.1MB. Free memory was 230.3MB in the beginning and 215.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 167.23ms. Allocated memory is still 282.1MB. Free memory was 215.3MB in the beginning and 197.8MB in the end (delta: 17.4MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * RCFGBuilder took 17320.47ms. Allocated memory is still 282.1MB. Free memory was 197.8MB in the beginning and 117.8MB in the end (delta: 80.1MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. * TraceAbstraction took 861343.69ms. Allocated memory was 282.1MB in the beginning and 436.2MB in the end (delta: 154.1MB). Free memory was 117.2MB in the beginning and 306.7MB in the end (delta: -189.5MB). Peak memory consumption was 158.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 - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 107). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 861.3s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 725.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4748 SdHoareTripleChecker+Valid, 722.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4748 mSDsluCounter, 3369 SdHoareTripleChecker+Invalid, 662.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 522 mSDsCounter, 2624 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14999 IncrementalHoareTripleChecker+Invalid, 17624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2624 mSolverCounterUnsat, 2847 mSDtfsCounter, 14999 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3568 GetRequests, 3540 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7567occurred in iteration=8, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 943 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 133.1s InterpolantComputationTime, 2101 NumberOfCodeBlocks, 2101 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 3562 ConstructedInterpolants, 0 QuantifiedInterpolants, 28351 SizeOfPredicates, 4 NumberOfNonLiveVariables, 2483 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 13 InterpolantComputations, 6 PerfectInterpolantSequences, 1050/1666 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown