/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_label55.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 09:27:39,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 09:27:39,494 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:27:39,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 09:27:39,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 09:27:39,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 09:27:39,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 09:27:39,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 09:27:39,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 09:27:39,527 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 09:27:39,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 09:27:39,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 09:27:39,528 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 09:27:39,529 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 09:27:39,529 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 09:27:39,529 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 09:27:39,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 09:27:39,530 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 09:27:39,530 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 09:27:39,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 09:27:39,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 09:27:39,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 09:27:39,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 09:27:39,531 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 09:27:39,532 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 09:27:39,532 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 09:27:39,532 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 09:27:39,532 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 09:27:39,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 09:27:39,532 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 09:27:39,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 09:27:39,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 09:27:39,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 09:27:39,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 09:27:39,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:27:39,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 09:27:39,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 09:27:39,534 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 09:27:39,534 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 09:27:39,534 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 09:27:39,534 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 09:27:39,534 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 09:27:39,535 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 09:27:39,535 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 09:27:39,535 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 09:27:39,535 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 09:27:39,535 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:27:39,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 09:27:39,720 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 09:27:39,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 09:27:39,723 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 09:27:39,723 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 09:27:39,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label55.c [2023-12-16 09:27:40,752 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 09:27:40,979 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 09:27:40,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label55.c [2023-12-16 09:27:40,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56fa2f492/525f82de0ae943099038ea44b0066047/FLAG4cb9d2b1a [2023-12-16 09:27:41,000 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56fa2f492/525f82de0ae943099038ea44b0066047 [2023-12-16 09:27:41,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 09:27:41,003 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 09:27:41,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 09:27:41,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 09:27:41,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 09:27:41,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f99875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41, skipping insertion in model container [2023-12-16 09:27:41,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,069 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 09:27:41,257 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_label55.c[5831,5844] [2023-12-16 09:27:41,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:27:41,444 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 09:27:41,477 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_label55.c[5831,5844] [2023-12-16 09:27:41,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 09:27:41,557 INFO L206 MainTranslator]: Completed translation [2023-12-16 09:27:41,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41 WrapperNode [2023-12-16 09:27:41,558 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 09:27:41,559 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 09:27:41,559 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 09:27:41,560 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 09:27:41,566 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:27:41" (1/1) ... [2023-12-16 09:27:41,585 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:27:41" (1/1) ... [2023-12-16 09:27:41,625 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 857 [2023-12-16 09:27:41,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 09:27:41,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 09:27:41,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 09:27:41,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 09:27:41,648 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,682 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:27:41,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,682 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,703 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 09:27:41,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 09:27:41,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 09:27:41,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 09:27:41,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (1/1) ... [2023-12-16 09:27:41,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 09:27:41,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 09:27:41,782 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:27:41,823 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:27:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 09:27:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 09:27:41,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 09:27:41,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 09:27:41,901 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 09:27:41,903 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 09:27:44,266 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 09:27:44,311 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 09:27:44,311 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 09:27:44,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:27:44 BoogieIcfgContainer [2023-12-16 09:27:44,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 09:27:44,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 09:27:44,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 09:27:44,315 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 09:27:44,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 09:27:41" (1/3) ... [2023-12-16 09:27:44,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea7e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:27:44, skipping insertion in model container [2023-12-16 09:27:44,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:27:41" (2/3) ... [2023-12-16 09:27:44,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ea7e1d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 09:27:44, skipping insertion in model container [2023-12-16 09:27:44,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:27:44" (3/3) ... [2023-12-16 09:27:44,319 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label55.c [2023-12-16 09:27:44,331 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 09:27:44,331 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 09:27:44,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 09:27:44,389 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;@3c7547db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 09:27:44,390 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 09:27:44,393 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:27:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-16 09:27:44,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:27:44,399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:27:44,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:27:44,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:27:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash 2064485996, now seen corresponding path program 1 times [2023-12-16 09:27:44,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:27:44,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69965016] [2023-12-16 09:27:44,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:27:44,415 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:27:44,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:27:44,420 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:27:44,424 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:27:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:27:44,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 09:27:44,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:27:44,526 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:27:44,527 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:27:44,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:27:44,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69965016] [2023-12-16 09:27:44,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69965016] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:27:44,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:27:44,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:27:44,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308176620] [2023-12-16 09:27:44,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:27:44,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 09:27:44,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:27:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 09:27:44,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 09:27:44,564 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 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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:27:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:27:44,609 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2023-12-16 09:27:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 09:27:44,612 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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 56 [2023-12-16 09:27:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:27:44,622 INFO L225 Difference]: With dead ends: 365 [2023-12-16 09:27:44,623 INFO L226 Difference]: Without dead ends: 181 [2023-12-16 09:27:44,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 55 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:27:44,629 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:27:44,630 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:27:44,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-12-16 09:27:44,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-12-16 09:27:44,659 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:27:44,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2023-12-16 09:27:44,661 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 56 [2023-12-16 09:27:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:27:44,661 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2023-12-16 09:27:44,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 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:27:44,662 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2023-12-16 09:27:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-16 09:27:44,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:27:44,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:27:44,668 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:27:44,865 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:27:44,866 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:27:44,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:27:44,866 INFO L85 PathProgramCache]: Analyzing trace with hash -701156091, now seen corresponding path program 1 times [2023-12-16 09:27:44,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:27:44,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087160654] [2023-12-16 09:27:44,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:27:44,867 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:27:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:27:44,868 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:27:44,871 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:27:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:27:44,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:27:44,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:27:45,023 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:27:45,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:27:45,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:27:45,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087160654] [2023-12-16 09:27:45,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087160654] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:27:45,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:27:45,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:27:45,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884849991] [2023-12-16 09:27:45,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:27:45,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:27:45,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:27:45,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:27:45,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:27:45,030 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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:27:47,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:27:47,928 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2023-12-16 09:27:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:27:47,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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 56 [2023-12-16 09:27:47,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:27:47,931 INFO L225 Difference]: With dead ends: 539 [2023-12-16 09:27:47,931 INFO L226 Difference]: Without dead ends: 359 [2023-12-16 09:27:47,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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:27:47,932 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 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.8s IncrementalHoareTripleChecker+Time [2023-12-16 09:27:47,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 64 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-16 09:27:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-16 09:27:47,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2023-12-16 09:27:47,946 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:27:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 533 transitions. [2023-12-16 09:27:47,947 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 533 transitions. Word has length 56 [2023-12-16 09:27:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:27:47,947 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 533 transitions. [2023-12-16 09:27:47,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 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:27:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 533 transitions. [2023-12-16 09:27:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-16 09:27:47,950 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:27:47,950 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:27:47,967 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 (3)] Ended with exit code 0 [2023-12-16 09:27:48,152 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:27:48,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:27:48,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:27:48,153 INFO L85 PathProgramCache]: Analyzing trace with hash -818392808, now seen corresponding path program 1 times [2023-12-16 09:27:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:27:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695476139] [2023-12-16 09:27:48,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:27:48,154 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:27:48,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:27:48,155 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:27:48,156 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:27:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:27:48,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:27:48,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:27:48,354 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:27:48,354 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:27:48,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:27:48,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695476139] [2023-12-16 09:27:48,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695476139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:27:48,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:27:48,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:27:48,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529625580] [2023-12-16 09:27:48,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:27:48,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:27:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:27:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:27:48,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:27:48,365 INFO L87 Difference]: Start difference. First operand 359 states and 533 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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:27:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:27:51,372 INFO L93 Difference]: Finished difference Result 1073 states and 1596 transitions. [2023-12-16 09:27:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:27:51,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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 121 [2023-12-16 09:27:51,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:27:51,375 INFO L225 Difference]: With dead ends: 1073 [2023-12-16 09:27:51,375 INFO L226 Difference]: Without dead ends: 715 [2023-12-16 09:27:51,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 119 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:27:51,377 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 116 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 99 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:27:51,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 99 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-16 09:27:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2023-12-16 09:27:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2023-12-16 09:27:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.3473389355742298) internal successors, (962), 714 states have internal predecessors, (962), 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:27:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 962 transitions. [2023-12-16 09:27:51,442 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 962 transitions. Word has length 121 [2023-12-16 09:27:51,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:27:51,442 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 962 transitions. [2023-12-16 09:27:51,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 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:27:51,442 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 962 transitions. [2023-12-16 09:27:51,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-16 09:27:51,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:27:51,445 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, 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] [2023-12-16 09:27:51,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-16 09:27:51,648 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:27:51,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:27:51,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:27:51,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1455063898, now seen corresponding path program 1 times [2023-12-16 09:27:51,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:27:51,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733461172] [2023-12-16 09:27:51,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:27:51,650 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:27:51,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:27:51,653 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:27:51,660 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:27:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:27:51,705 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 09:27:51,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:27:51,813 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 09:27:51,813 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:27:51,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:27:51,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733461172] [2023-12-16 09:27:51,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733461172] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:27:51,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:27:51,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:27:51,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662580901] [2023-12-16 09:27:51,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:27:51,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:27:51,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:27:51,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:27:51,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:27:51,817 INFO L87 Difference]: Start difference. First operand 715 states and 962 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:27:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:27:54,595 INFO L93 Difference]: Finished difference Result 1963 states and 2656 transitions. [2023-12-16 09:27:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:27:54,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124 [2023-12-16 09:27:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:27:54,599 INFO L225 Difference]: With dead ends: 1963 [2023-12-16 09:27:54,599 INFO L226 Difference]: Without dead ends: 1249 [2023-12-16 09:27:54,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 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:27:54,602 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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.7s IncrementalHoareTripleChecker+Time [2023-12-16 09:27:54,602 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.7s Time] [2023-12-16 09:27:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2023-12-16 09:27:54,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2023-12-16 09:27:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.2467948717948718) internal successors, (1556), 1248 states have internal predecessors, (1556), 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:27:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1556 transitions. [2023-12-16 09:27:54,644 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1556 transitions. Word has length 124 [2023-12-16 09:27:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:27:54,644 INFO L495 AbstractCegarLoop]: Abstraction has 1249 states and 1556 transitions. [2023-12-16 09:27:54,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 09:27:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1556 transitions. [2023-12-16 09:27:54,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2023-12-16 09:27:54,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:27:54,651 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:27:54,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 09:27:54,870 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:27:54,871 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:27:54,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:27:54,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1958838223, now seen corresponding path program 1 times [2023-12-16 09:27:54,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:27:54,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256160967] [2023-12-16 09:27:54,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:27:54,873 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:27:54,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:27:54,873 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:27:54,898 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:27:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:27:54,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 09:27:54,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:27:55,521 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 09:27:55,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:27:55,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:27:55,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256160967] [2023-12-16 09:27:55,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256160967] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:27:55,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:27:55,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 09:27:55,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100795136] [2023-12-16 09:27:55,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:27:55,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 09:27:55,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:27:55,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 09:27:55,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-16 09:27:55,523 INFO L87 Difference]: Start difference. First operand 1249 states and 1556 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:27:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:27:57,610 INFO L93 Difference]: Finished difference Result 2170 states and 2742 transitions. [2023-12-16 09:27:57,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 09:27:57,610 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 205 [2023-12-16 09:27:57,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:27:57,613 INFO L225 Difference]: With dead ends: 2170 [2023-12-16 09:27:57,613 INFO L226 Difference]: Without dead ends: 1071 [2023-12-16 09:27:57,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 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:27:57,615 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 09:27:57,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 110 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 09:27:57,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-16 09:27:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-16 09:27:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.2401869158878505) internal successors, (1327), 1070 states have internal predecessors, (1327), 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:27:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1327 transitions. [2023-12-16 09:27:57,632 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1327 transitions. Word has length 205 [2023-12-16 09:27:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:27:57,633 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1327 transitions. [2023-12-16 09:27:57,633 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:27:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1327 transitions. [2023-12-16 09:27:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-12-16 09:27:57,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:27:57,638 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:27:57,644 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:27:57,842 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:27:57,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:27:57,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:27:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1268146734, now seen corresponding path program 1 times [2023-12-16 09:27:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:27:57,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220649364] [2023-12-16 09:27:57,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:27:57,844 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:27:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:27:57,845 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:27:57,849 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:27:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:27:57,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:27:57,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:27:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-12-16 09:27:58,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 09:27:58,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:27:58,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220649364] [2023-12-16 09:27:58,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220649364] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 09:27:58,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 09:27:58,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 09:27:58,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215361730] [2023-12-16 09:27:58,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:27:58,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:27:58,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:27:58,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:27:58,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 09:27:58,497 INFO L87 Difference]: Start difference. First operand 1071 states and 1327 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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:28:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:28:00,362 INFO L93 Difference]: Finished difference Result 1785 states and 2288 transitions. [2023-12-16 09:28:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:28:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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 231 [2023-12-16 09:28:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:28:00,366 INFO L225 Difference]: With dead ends: 1785 [2023-12-16 09:28:00,366 INFO L226 Difference]: Without dead ends: 1071 [2023-12-16 09:28:00,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 229 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:28:00,367 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.8s IncrementalHoareTripleChecker+Time [2023-12-16 09:28:00,368 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.8s Time] [2023-12-16 09:28:00,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2023-12-16 09:28:00,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2023-12-16 09:28:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.2345794392523364) internal successors, (1321), 1070 states have internal predecessors, (1321), 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:28:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1321 transitions. [2023-12-16 09:28:00,381 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1321 transitions. Word has length 231 [2023-12-16 09:28:00,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:28:00,381 INFO L495 AbstractCegarLoop]: Abstraction has 1071 states and 1321 transitions. [2023-12-16 09:28:00,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 2 states have internal predecessors, (164), 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:28:00,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1321 transitions. [2023-12-16 09:28:00,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2023-12-16 09:28:00,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:28:00,383 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:28:00,387 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:28:00,587 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:28:00,587 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:28:00,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:28:00,587 INFO L85 PathProgramCache]: Analyzing trace with hash -718227299, now seen corresponding path program 1 times [2023-12-16 09:28:00,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:28:00,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660661798] [2023-12-16 09:28:00,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:28:00,588 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:28:00,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:28:00,591 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:28:00,592 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:28:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:28:00,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:28:00,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:28:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 164 proven. 135 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:28:01,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:28:01,586 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 299 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2023-12-16 09:28:01,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:28:01,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660661798] [2023-12-16 09:28:01,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660661798] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:28:01,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:28:01,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:28:01,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566554887] [2023-12-16 09:28:01,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:28:01,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:28:01,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:28:01,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:28:01,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:28:01,588 INFO L87 Difference]: Start difference. First operand 1071 states and 1321 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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:28:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:28:07,567 INFO L93 Difference]: Finished difference Result 2141 states and 2813 transitions. [2023-12-16 09:28:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:28:07,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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 335 [2023-12-16 09:28:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:28:07,571 INFO L225 Difference]: With dead ends: 2141 [2023-12-16 09:28:07,571 INFO L226 Difference]: Without dead ends: 1427 [2023-12-16 09:28:07,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 665 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:28:07,572 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s 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.9s IncrementalHoareTripleChecker+Time [2023-12-16 09:28:07,572 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.9s Time] [2023-12-16 09:28:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2023-12-16 09:28:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2023-12-16 09:28:07,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.2391304347826086) internal successors, (1767), 1426 states have internal predecessors, (1767), 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:28:07,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1767 transitions. [2023-12-16 09:28:07,611 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1767 transitions. Word has length 335 [2023-12-16 09:28:07,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:28:07,613 INFO L495 AbstractCegarLoop]: Abstraction has 1427 states and 1767 transitions. [2023-12-16 09:28:07,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 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:28:07,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1767 transitions. [2023-12-16 09:28:07,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2023-12-16 09:28:07,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:28:07,618 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, 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, 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:28:07,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-16 09:28:07,826 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:28:07,827 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:28:07,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:28:07,827 INFO L85 PathProgramCache]: Analyzing trace with hash -719065833, now seen corresponding path program 1 times [2023-12-16 09:28:07,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:28:07,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527873571] [2023-12-16 09:28:07,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:28:07,829 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:28:07,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:28:07,830 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:28:07,833 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:28:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:28:07,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 09:28:07,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:28:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 441 proven. 159 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-16 09:28:08,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:28:08,776 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-16 09:28:08,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:28:08,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527873571] [2023-12-16 09:28:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527873571] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 09:28:08,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 09:28:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-12-16 09:28:08,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165210773] [2023-12-16 09:28:08,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 09:28:08,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 09:28:08,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:28:08,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 09:28:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 09:28:08,778 INFO L87 Difference]: Start difference. First operand 1427 states and 1767 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:28:13,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 09:28:13,980 INFO L93 Difference]: Finished difference Result 3209 states and 4152 transitions. [2023-12-16 09:28:13,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 09:28:13,981 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 446 [2023-12-16 09:28:13,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 09:28:13,986 INFO L225 Difference]: With dead ends: 3209 [2023-12-16 09:28:13,986 INFO L226 Difference]: Without dead ends: 2139 [2023-12-16 09:28:13,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 887 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:28:13,988 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s 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.2s IncrementalHoareTripleChecker+Time [2023-12-16 09:28:13,988 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.2s Time] [2023-12-16 09:28:13,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2023-12-16 09:28:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2023-12-16 09:28:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.2474275023386343) internal successors, (2667), 2138 states have internal predecessors, (2667), 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:28:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2667 transitions. [2023-12-16 09:28:14,053 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2667 transitions. Word has length 446 [2023-12-16 09:28:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 09:28:14,053 INFO L495 AbstractCegarLoop]: Abstraction has 2139 states and 2667 transitions. [2023-12-16 09:28:14,053 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:28:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2667 transitions. [2023-12-16 09:28:14,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2023-12-16 09:28:14,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 09:28:14,072 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, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:28:14,092 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:28:14,279 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:28:14,279 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 09:28:14,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 09:28:14,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1340325393, now seen corresponding path program 1 times [2023-12-16 09:28:14,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 09:28:14,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663282944] [2023-12-16 09:28:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 09:28:14,281 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:28:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 09:28:14,282 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:28:14,283 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:28:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 09:28:14,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 09:28:14,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 09:28:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 504 proven. 277 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 09:28:15,409 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 09:28:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 752 proven. 29 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-16 09:28:21,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 09:28:21,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663282944] [2023-12-16 09:28:21,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663282944] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 09:28:21,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 09:28:21,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 09:28:21,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923165072] [2023-12-16 09:28:21,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 09:28:21,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 09:28:21,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 09:28:21,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 09:28:21,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-16 09:28:21,542 INFO L87 Difference]: Start difference. First operand 2139 states and 2667 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:28:56,364 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:28:56,392 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:28:56,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 09:28:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 09:28:56,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 916 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:28:56,552 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 463 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 2616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.7s IncrementalHoareTripleChecker+Time [2023-12-16 09:28:56,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 51 Invalid, 2616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 34.7s Time] [2023-12-16 09:28:56,553 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 09:28:56,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 09:28:56,753 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:28:56,754 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 (5511 states constructed, input type IntersectNwa). [2023-12-16 09:28:56,760 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 09:28:56,767 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 09:28:56,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 09:28:56 BoogieIcfgContainer [2023-12-16 09:28:56,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 09:28:56,771 INFO L158 Benchmark]: Toolchain (without parser) took 75768.07ms. Allocated memory was 251.7MB in the beginning and 310.4MB in the end (delta: 58.7MB). Free memory was 209.8MB in the beginning and 211.5MB in the end (delta: -1.7MB). Peak memory consumption was 175.8MB. Max. memory is 8.0GB. [2023-12-16 09:28:56,771 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 188.7MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 09:28:56,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 554.58ms. Allocated memory is still 251.7MB. Free memory was 209.5MB in the beginning and 171.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2023-12-16 09:28:56,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.13ms. Allocated memory is still 251.7MB. Free memory was 171.8MB in the beginning and 165.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-16 09:28:56,773 INFO L158 Benchmark]: Boogie Preprocessor took 89.47ms. Allocated memory is still 251.7MB. Free memory was 165.2MB in the beginning and 212.8MB in the end (delta: -47.6MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2023-12-16 09:28:56,773 INFO L158 Benchmark]: RCFGBuilder took 2595.51ms. Allocated memory is still 251.7MB. Free memory was 212.8MB in the beginning and 202.0MB in the end (delta: 10.8MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. [2023-12-16 09:28:56,773 INFO L158 Benchmark]: TraceAbstraction took 72457.13ms. Allocated memory was 251.7MB in the beginning and 310.4MB in the end (delta: 58.7MB). Free memory was 201.5MB in the beginning and 211.5MB in the end (delta: -10.0MB). Peak memory consumption was 168.2MB. Max. memory is 8.0GB. [2023-12-16 09:28:56,775 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.14ms. Allocated memory is still 188.7MB. Free memory is still 142.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 554.58ms. Allocated memory is still 251.7MB. Free memory was 209.5MB in the beginning and 171.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.13ms. Allocated memory is still 251.7MB. Free memory was 171.8MB in the beginning and 165.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 89.47ms. Allocated memory is still 251.7MB. Free memory was 165.2MB in the beginning and 212.8MB in the end (delta: -47.6MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * RCFGBuilder took 2595.51ms. Allocated memory is still 251.7MB. Free memory was 212.8MB in the beginning and 202.0MB in the end (delta: 10.8MB). Peak memory consumption was 122.7MB. Max. memory is 8.0GB. * TraceAbstraction took 72457.13ms. Allocated memory was 251.7MB in the beginning and 310.4MB in the end (delta: 58.7MB). Free memory was 201.5MB in the beginning and 211.5MB in the end (delta: -10.0MB). Peak memory consumption was 168.2MB. 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: 185]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 185). 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 (5511 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.4s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 59.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1270 SdHoareTripleChecker+Valid, 58.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1270 mSDsluCounter, 1129 SdHoareTripleChecker+Invalid, 52.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 784 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5997 IncrementalHoareTripleChecker+Invalid, 6781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 784 mSolverCounterUnsat, 1059 mSDtfsCounter, 5997 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3269 GetRequests, 3249 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 2036 NumberOfCodeBlocks, 2036 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 3267 ConstructedInterpolants, 0 QuantifiedInterpolants, 12573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2438 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 3800/4400 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