/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/Problem14_label36.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 09:25:51,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 09:25:51,580 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 09:25:51,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 09:25:51,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 09:25:51,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 09:25:51,612 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 09:25:51,612 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 09:25:51,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 09:25:51,616 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 09:25:51,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 09:25:51,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 09:25:51,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 09:25:51,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 09:25:51,619 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 09:25:51,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 09:25:51,620 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 09:25:51,620 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 09:25:51,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 09:25:51,621 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 09:25:51,621 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 09:25:51,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 09:25:51,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 09:25:51,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 09:25:51,622 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 09:25:51,622 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 09:25:51,623 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 09:25:51,623 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 09:25:51,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 09:25:51,623 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 09:25:51,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 09:25:51,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 09:25:51,625 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 09:25:51,625 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 09:25:51,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:25:51,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 09:25:51,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 09:25:51,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 09:25:51,626 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 09:25:51,626 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 09:25:51,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 09:25:51,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 09:25:51,626 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 09:25:51,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 09:25:51,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 09:25:51,627 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 09:25:51,627 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 09:25:51,849 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 09:25:51,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 09:25:51,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 09:25:51,873 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 09:25:51,873 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 09:25:51,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label36.c [2023-12-16 09:25:53,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 09:25:53,302 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 09:25:53,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label36.c [2023-12-16 09:25:53,317 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2665b97b/b5e87d83ed044bc1b673f79c3ea4cb81/FLAG9a0196af2 [2023-12-16 09:25:53,328 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2665b97b/b5e87d83ed044bc1b673f79c3ea4cb81 [2023-12-16 09:25:53,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 09:25:53,331 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 09:25:53,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 09:25:53,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 09:25:53,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 09:25:53,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:53,337 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d826dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53, skipping insertion in model container [2023-12-16 09:25:53,337 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:53,387 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 09:25:53,554 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/Problem14_label36.c[4997,5010] [2023-12-16 09:25:53,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:25:53,770 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 09:25:53,797 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/Problem14_label36.c[4997,5010] [2023-12-16 09:25:53,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:25:53,945 INFO L206 MainTranslator]: Completed translation [2023-12-16 09:25:53,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53 WrapperNode [2023-12-16 09:25:53,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 09:25:53,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 09:25:53,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 09:25:53,947 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 09:25:53,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:53,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,085 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 857 [2023-12-16 09:25:54,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 09:25:54,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 09:25:54,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 09:25:54,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 09:25:54,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,135 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-16 09:25:54,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,183 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 09:25:54,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 09:25:54,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 09:25:54,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 09:25:54,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (1/1) ... [2023-12-16 09:25:54,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:25:54,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 09:25:54,211 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 09:25:54,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 09:25:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 09:25:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 09:25:54,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 09:25:54,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 09:25:54,315 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 09:25:54,317 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 09:25:57,084 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 09:25:57,140 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 09:25:57,141 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 09:25:57,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:25:57 BoogieIcfgContainer [2023-12-16 09:25:57,141 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 09:25:57,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 09:25:57,143 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 09:25:57,146 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 09:25:57,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:25:53" (1/3) ... [2023-12-16 09:25:57,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42eb51e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:25:57, skipping insertion in model container [2023-12-16 09:25:57,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:25:53" (2/3) ... [2023-12-16 09:25:57,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42eb51e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:25:57, skipping insertion in model container [2023-12-16 09:25:57,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:25:57" (3/3) ... [2023-12-16 09:25:57,148 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label36.c [2023-12-16 09:25:57,162 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 09:25:57,163 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 09:25:57,213 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 09:25:57,218 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;@5515421, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 09:25:57,219 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 09:25:57,226 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:25:57,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 09:25:57,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:25:57,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:25:57,238 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:25:57,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:25:57,242 INFO L85 PathProgramCache]: Analyzing trace with hash -457307582, now seen corresponding path program 1 times [2023-12-16 09:25:57,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:25:57,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062477257] [2023-12-16 09:25:57,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:25:57,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:25:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:25:57,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:25:57,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 09:25:57,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:25:57,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 09:25:57,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:25:57,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:25:57,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:25:57,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:25:57,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062477257] [2023-12-16 09:25:57,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062477257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:25:57,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:25:57,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:25:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713715862] [2023-12-16 09:25:57,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:25:57,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 09:25:57,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:25:57,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 09:25:57,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 09:25:57,406 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:25:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:25:57,461 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2023-12-16 09:25:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 09:25:57,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 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 47 [2023-12-16 09:25:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:25:57,478 INFO L225 Difference]: With dead ends: 365 [2023-12-16 09:25:57,478 INFO L226 Difference]: Without dead ends: 181 [2023-12-16 09:25:57,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 09:25:57,485 INFO L413 NwaCegarLoop]: 295 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, 295 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-16 09:25:57,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 09:25:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-16 09:25:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-12-16 09:25:57,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:25:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2023-12-16 09:25:57,533 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 47 [2023-12-16 09:25:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:25:57,533 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2023-12-16 09:25:57,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:25:57,534 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2023-12-16 09:25:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-16 09:25:57,534 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:25:57,534 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:25:57,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 09:25:57,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:25:57,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:25:57,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:25:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 821675975, now seen corresponding path program 1 times [2023-12-16 09:25:57,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:25:57,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636289208] [2023-12-16 09:25:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:25:57,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:25:57,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:25:57,738 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:25:57,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 09:25:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:25:57,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:25:57,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:25:57,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:25:57,905 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:25:57,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:25:57,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636289208] [2023-12-16 09:25:57,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636289208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:25:57,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:25:57,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:25:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233742785] [2023-12-16 09:25:57,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:25:57,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:25:57,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:25:57,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:25:57,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:25:57,913 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:00,542 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2023-12-16 09:26:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:00,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 47 [2023-12-16 09:26:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:00,545 INFO L225 Difference]: With dead ends: 539 [2023-12-16 09:26:00,545 INFO L226 Difference]: Without dead ends: 359 [2023-12-16 09:26:00,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:00,547 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 143 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:00,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 64 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 09:26:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-16 09:26:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2023-12-16 09:26:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.488826815642458) internal successors, (533), 358 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2023-12-16 09:26:00,566 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 47 [2023-12-16 09:26:00,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:00,567 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2023-12-16 09:26:00,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2023-12-16 09:26:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 09:26:00,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:00,570 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, 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] [2023-12-16 09:26:00,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:00,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:00,775 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:00,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:00,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2039813581, now seen corresponding path program 1 times [2023-12-16 09:26:00,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:00,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173464731] [2023-12-16 09:26:00,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:00,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:00,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:00,778 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:00,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 09:26:00,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:00,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:26:00,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:26:00,968 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:00,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:00,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173464731] [2023-12-16 09:26:00,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173464731] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:00,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:00,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:26:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870995769] [2023-12-16 09:26:00,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:00,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:00,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:00,970 INFO L87 Difference]: Start difference. First operand 359 states and 533 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:04,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:04,034 INFO L93 Difference]: Finished difference Result 1073 states and 1596 transitions. [2023-12-16 09:26:04,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:04,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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 112 [2023-12-16 09:26:04,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:04,037 INFO L225 Difference]: With dead ends: 1073 [2023-12-16 09:26:04,037 INFO L226 Difference]: Without dead ends: 715 [2023-12-16 09:26:04,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:04,040 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 115 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:04,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 100 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-16 09:26:04,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-12-16 09:26:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2023-12-16 09:26:04,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.3459383753501402) internal successors, (961), 714 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 961 transitions. [2023-12-16 09:26:04,068 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 961 transitions. Word has length 112 [2023-12-16 09:26:04,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:04,069 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 961 transitions. [2023-12-16 09:26:04,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:04,069 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 961 transitions. [2023-12-16 09:26:04,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-16 09:26:04,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:04,071 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, 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] [2023-12-16 09:26:04,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:04,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:04,275 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:04,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:04,275 INFO L85 PathProgramCache]: Analyzing trace with hash 2044061041, now seen corresponding path program 1 times [2023-12-16 09:26:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:04,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581397622] [2023-12-16 09:26:04,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:04,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:04,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:04,278 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:04,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 09:26:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:04,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:26:04,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:26:04,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:04,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:04,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [581397622] [2023-12-16 09:26:04,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [581397622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:04,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:04,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:26:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658684418] [2023-12-16 09:26:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:04,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:04,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:04,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:04,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:04,485 INFO L87 Difference]: Start difference. First operand 715 states and 961 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:07,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:07,026 INFO L93 Difference]: Finished difference Result 1963 states and 2654 transitions. [2023-12-16 09:26:07,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:07,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 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 115 [2023-12-16 09:26:07,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:07,031 INFO L225 Difference]: With dead ends: 1963 [2023-12-16 09:26:07,031 INFO L226 Difference]: Without dead ends: 1249 [2023-12-16 09:26:07,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:07,033 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:07,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 87 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 09:26:07,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2023-12-16 09:26:07,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2023-12-16 09:26:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.2459935897435896) internal successors, (1555), 1248 states have internal predecessors, (1555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1555 transitions. [2023-12-16 09:26:07,061 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1555 transitions. Word has length 115 [2023-12-16 09:26:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:07,062 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1555 transitions. [2023-12-16 09:26:07,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1555 transitions. [2023-12-16 09:26:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2023-12-16 09:26:07,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:07,072 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:26:07,077 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-16 09:26:07,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:07,275 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:07,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:07,275 INFO L85 PathProgramCache]: Analyzing trace with hash 330192221, now seen corresponding path program 1 times [2023-12-16 09:26:07,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:07,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257950409] [2023-12-16 09:26:07,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:07,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:07,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:07,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:07,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 09:26:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:07,378 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 09:26:07,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 09:26:08,055 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:08,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:08,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257950409] [2023-12-16 09:26:08,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257950409] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:08,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:08,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 09:26:08,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790842175] [2023-12-16 09:26:08,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:08,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 09:26:08,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:08,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 09:26:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 09:26:08,058 INFO L87 Difference]: Start difference. First operand 1249 states and 1555 transitions. Second operand has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:10,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:10,015 INFO L93 Difference]: Finished difference Result 2170 states and 2740 transitions. [2023-12-16 09:26:10,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 09:26:10,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 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 196 [2023-12-16 09:26:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:10,019 INFO L225 Difference]: With dead ends: 2170 [2023-12-16 09:26:10,019 INFO L226 Difference]: Without dead ends: 1071 [2023-12-16 09:26:10,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 09:26:10,021 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:10,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 110 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 09:26:10,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-16 09:26:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-16 09:26:10,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.2392523364485981) internal successors, (1326), 1070 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1326 transitions. [2023-12-16 09:26:10,039 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1326 transitions. Word has length 196 [2023-12-16 09:26:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:10,040 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1326 transitions. [2023-12-16 09:26:10,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1326 transitions. [2023-12-16 09:26:10,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2023-12-16 09:26:10,042 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:10,042 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 09:26:10,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:10,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:10,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:10,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:10,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1423371234, now seen corresponding path program 1 times [2023-12-16 09:26:10,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:10,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1668789528] [2023-12-16 09:26:10,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:10,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:10,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:10,250 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:10,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 09:26:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:10,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:26:10,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-16 09:26:11,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:26:11,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:11,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1668789528] [2023-12-16 09:26:11,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1668789528] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:26:11,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:26:11,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:26:11,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923244847] [2023-12-16 09:26:11,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:11,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:11,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:11,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:11,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:11,053 INFO L87 Difference]: Start difference. First operand 1071 states and 1326 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:12,950 INFO L93 Difference]: Finished difference Result 1785 states and 2286 transitions. [2023-12-16 09:26:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:12,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 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 222 [2023-12-16 09:26:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:12,954 INFO L225 Difference]: With dead ends: 1785 [2023-12-16 09:26:12,954 INFO L226 Difference]: Without dead ends: 1071 [2023-12-16 09:26:12,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:26:12,956 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:12,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 121 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 09:26:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-16 09:26:12,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-16 09:26:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.233644859813084) internal successors, (1320), 1070 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:12,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1320 transitions. [2023-12-16 09:26:12,972 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1320 transitions. Word has length 222 [2023-12-16 09:26:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:12,973 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1320 transitions. [2023-12-16 09:26:12,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1320 transitions. [2023-12-16 09:26:12,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2023-12-16 09:26:12,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:12,977 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, 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, 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] [2023-12-16 09:26:12,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:13,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:13,181 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:13,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:13,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1595238418, now seen corresponding path program 1 times [2023-12-16 09:26:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:13,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772230592] [2023-12-16 09:26:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:13,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:13,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:13,184 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:13,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 09:26:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:13,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:26:13,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 137 proven. 135 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:26:13,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:26:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:26:14,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:14,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772230592] [2023-12-16 09:26:14,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772230592] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:26:14,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:26:14,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:26:14,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139975770] [2023-12-16 09:26:14,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:14,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:14,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:14,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:14,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:26:14,068 INFO L87 Difference]: Start difference. First operand 1071 states and 1320 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:19,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:19,941 INFO L93 Difference]: Finished difference Result 2141 states and 2811 transitions. [2023-12-16 09:26:19,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:19,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 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 326 [2023-12-16 09:26:19,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:19,947 INFO L225 Difference]: With dead ends: 2141 [2023-12-16 09:26:19,947 INFO L226 Difference]: Without dead ends: 1427 [2023-12-16 09:26:19,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 647 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:26:19,949 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:19,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 57 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-12-16 09:26:19,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2023-12-16 09:26:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2023-12-16 09:26:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.238429172510519) internal successors, (1766), 1426 states have internal predecessors, (1766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1766 transitions. [2023-12-16 09:26:19,973 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1766 transitions. Word has length 326 [2023-12-16 09:26:19,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:19,975 INFO L495 AbstractCegarLoop]: Abstraction has 1427 states and 1766 transitions. [2023-12-16 09:26:19,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1766 transitions. [2023-12-16 09:26:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2023-12-16 09:26:19,982 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:19,982 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:26:19,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:20,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:20,183 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:20,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:20,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1252228043, now seen corresponding path program 1 times [2023-12-16 09:26:20,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:20,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960129958] [2023-12-16 09:26:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:20,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:20,187 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:20,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 09:26:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:20,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:26:20,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 414 proven. 159 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-16 09:26:20,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:26:21,596 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2023-12-16 09:26:21,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:21,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960129958] [2023-12-16 09:26:21,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960129958] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:26:21,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:26:21,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:26:21,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283056528] [2023-12-16 09:26:21,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:26:21,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:26:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:26:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:26:21,601 INFO L87 Difference]: Start difference. First operand 1427 states and 1766 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:26:27,356 INFO L93 Difference]: Finished difference Result 3209 states and 4149 transitions. [2023-12-16 09:26:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:26:27,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 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 437 [2023-12-16 09:26:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:26:27,363 INFO L225 Difference]: With dead ends: 3209 [2023-12-16 09:26:27,363 INFO L226 Difference]: Without dead ends: 2139 [2023-12-16 09:26:27,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 869 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:26:27,365 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-16 09:26:27,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 245 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-16 09:26:27,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2023-12-16 09:26:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2023-12-16 09:26:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.2464920486435922) internal successors, (2665), 2138 states have internal predecessors, (2665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2665 transitions. [2023-12-16 09:26:27,404 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2665 transitions. Word has length 437 [2023-12-16 09:26:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:26:27,405 INFO L495 AbstractCegarLoop]: Abstraction has 2139 states and 2665 transitions. [2023-12-16 09:26:27,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:26:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2665 transitions. [2023-12-16 09:26:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2023-12-16 09:26:27,408 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:26:27,409 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:26:27,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 09:26:27,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:27,614 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:26:27,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:26:27,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2081760163, now seen corresponding path program 1 times [2023-12-16 09:26:27,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:26:27,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89049376] [2023-12-16 09:26:27,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:26:27,617 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:26:27,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:26:27,618 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 09:26:27,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 09:26:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:26:27,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 09:26:27,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:26:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 477 proven. 277 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 09:26:28,946 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:26:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 771 backedges. 725 proven. 29 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-16 09:26:35,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:26:35,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89049376] [2023-12-16 09:26:35,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89049376] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 09:26:35,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 09:26:35,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 09:26:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630860301] [2023-12-16 09:26:35,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 09:26:35,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 09:26:35,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:26:35,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 09:26:35,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 09:26:35,052 INFO L87 Difference]: Start difference. First operand 2139 states and 2665 transitions. Second operand has 9 states, 9 states have (on average 85.88888888888889) internal successors, (773), 9 states have internal predecessors, (773), 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) Received shutdown request... [2023-12-16 09:27:02,912 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-16 09:27:02,912 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 09:27:02,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 09:27:02,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 906 GetRequests, 898 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-16 09:27:02,994 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 869 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.6s IncrementalHoareTripleChecker+Time [2023-12-16 09:27:02,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 51 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 27.6s Time] [2023-12-16 09:27:02,996 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 09:27:03,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-16 09:27:03,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 09:27:03,198 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2139states) and FLOYD_HOARE automaton (currently 9 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (4374 states constructed, input type IntersectNwa). [2023-12-16 09:27:03,202 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:27:03,203 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 09:27:03,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:27:03 BoogieIcfgContainer [2023-12-16 09:27:03,206 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 09:27:03,206 INFO L158 Benchmark]: Toolchain (without parser) took 69875.84ms. Allocated memory was 201.3MB in the beginning and 380.6MB in the end (delta: 179.3MB). Free memory was 146.7MB in the beginning and 249.5MB in the end (delta: -102.8MB). Peak memory consumption was 206.0MB. Max. memory is 8.0GB. [2023-12-16 09:27:03,207 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 09:27:03,207 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.69ms. Allocated memory is still 201.3MB. Free memory was 146.4MB in the beginning and 109.0MB in the end (delta: 37.4MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. [2023-12-16 09:27:03,207 INFO L158 Benchmark]: Boogie Procedure Inliner took 138.82ms. Allocated memory was 201.3MB in the beginning and 299.9MB in the end (delta: 98.6MB). Free memory was 108.6MB in the beginning and 263.1MB in the end (delta: -154.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-16 09:27:03,207 INFO L158 Benchmark]: Boogie Preprocessor took 97.15ms. Allocated memory is still 299.9MB. Free memory was 263.1MB in the beginning and 256.3MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-16 09:27:03,208 INFO L158 Benchmark]: RCFGBuilder took 2957.19ms. Allocated memory is still 299.9MB. Free memory was 256.3MB in the beginning and 128.3MB in the end (delta: 127.9MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. [2023-12-16 09:27:03,208 INFO L158 Benchmark]: TraceAbstraction took 66063.04ms. Allocated memory was 299.9MB in the beginning and 380.6MB in the end (delta: 80.7MB). Free memory was 127.8MB in the beginning and 249.5MB in the end (delta: -121.7MB). Peak memory consumption was 87.5MB. Max. memory is 8.0GB. [2023-12-16 09:27:03,210 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 151.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 614.69ms. Allocated memory is still 201.3MB. Free memory was 146.4MB in the beginning and 109.0MB in the end (delta: 37.4MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 138.82ms. Allocated memory was 201.3MB in the beginning and 299.9MB in the end (delta: 98.6MB). Free memory was 108.6MB in the beginning and 263.1MB in the end (delta: -154.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 97.15ms. Allocated memory is still 299.9MB. Free memory was 263.1MB in the beginning and 256.3MB in the end (delta: 6.8MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 2957.19ms. Allocated memory is still 299.9MB. Free memory was 256.3MB in the beginning and 128.3MB in the end (delta: 127.9MB). Peak memory consumption was 127.9MB. Max. memory is 8.0GB. * TraceAbstraction took 66063.04ms. Allocated memory was 299.9MB in the beginning and 380.6MB in the end (delta: 80.7MB). Free memory was 127.8MB in the beginning and 249.5MB in the end (delta: -121.7MB). Peak memory consumption was 87.5MB. 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: 158]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 158). Cancelled while NwaCegarLoop was constructing difference of abstraction (2139states) and FLOYD_HOARE automaton (currently 9 states, 9 states before enhancement),while ReachableStatesComputation was computing reachable states (4374 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 66.0s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 51.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1684 SdHoareTripleChecker+Valid, 51.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1684 mSDsluCounter, 1130 SdHoareTripleChecker+Invalid, 45.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 750 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5993 IncrementalHoareTripleChecker+Invalid, 6743 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 750 mSolverCounterUnsat, 1059 mSDtfsCounter, 5993 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3161 GetRequests, 3141 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2139occurred in iteration=8, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 1955 NumberOfCodeBlocks, 1955 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 3159 ConstructedInterpolants, 0 QuantifiedInterpolants, 12447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2357 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 3548/4148 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