/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/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 07:49:47,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 07:49:47,297 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 07:49:47,300 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 07:49:47,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 07:49:47,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 07:49:47,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 07:49:47,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 07:49:47,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 07:49:47,327 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 07:49:47,327 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 07:49:47,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 07:49:47,328 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 07:49:47,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 07:49:47,329 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 07:49:47,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 07:49:47,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 07:49:47,330 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 07:49:47,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 07:49:47,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 07:49:47,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 07:49:47,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 07:49:47,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 07:49:47,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 07:49:47,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 07:49:47,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 07:49:47,331 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 07:49:47,332 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 07:49:47,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 07:49:47,332 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 07:49:47,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 07:49:47,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 07:49:47,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 07:49:47,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 07:49:47,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:49:47,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 07:49:47,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 07:49:47,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 07:49:47,334 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 07:49:47,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 07:49:47,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 07:49:47,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 07:49:47,335 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 07:49:47,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 07:49:47,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 07:49:47,335 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 07:49:47,336 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 07:49:47,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 07:49:47,547 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 07:49:47,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 07:49:47,549 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 07:49:47,550 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 07:49:47,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c [2023-12-16 07:49:48,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 07:49:48,853 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 07:49:48,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c [2023-12-16 07:49:48,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32afd698/73f82aab17dc48edbb33af1995f77933/FLAG091ba5cc3 [2023-12-16 07:49:49,111 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a32afd698/73f82aab17dc48edbb33af1995f77933 [2023-12-16 07:49:49,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 07:49:49,114 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 07:49:49,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 07:49:49,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 07:49:49,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 07:49:49,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:49:49" (1/1) ... [2023-12-16 07:49:49,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e30036c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:49, skipping insertion in model container [2023-12-16 07:49:49,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 07:49:49" (1/1) ... [2023-12-16 07:49:49,227 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 07:49:49,506 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c[6450,6463] [2023-12-16 07:49:49,558 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c[8787,8800] [2023-12-16 07:49:50,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:49:50,121 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 07:49:50,153 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c[6450,6463] [2023-12-16 07:49:50,159 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/combinations/pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c[8787,8800] [2023-12-16 07:49:50,515 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 07:49:50,535 INFO L206 MainTranslator]: Completed translation [2023-12-16 07:49:50,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50 WrapperNode [2023-12-16 07:49:50,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 07:49:50,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 07:49:50,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 07:49:50,538 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 07:49:50,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,698 INFO L138 Inliner]: procedures = 36, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4962 [2023-12-16 07:49:50,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 07:49:50,699 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 07:49:50,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 07:49:50,699 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 07:49:50,706 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,846 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 07:49:50,847 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,847 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:50,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:51,010 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 07:49:51,011 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 07:49:51,011 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 07:49:51,011 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 07:49:51,012 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (1/1) ... [2023-12-16 07:49:51,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 07:49:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 07:49:51,033 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 07:49:51,054 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 07:49:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 07:49:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 07:49:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 07:49:51,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 07:49:51,138 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 07:49:51,140 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 07:50:13,935 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 07:50:13,986 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 07:50:13,987 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 07:50:13,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:50:13 BoogieIcfgContainer [2023-12-16 07:50:13,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 07:50:13,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 07:50:13,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 07:50:13,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 07:50:13,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 07:49:49" (1/3) ... [2023-12-16 07:50:13,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fe9ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:50:13, skipping insertion in model container [2023-12-16 07:50:13,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 07:49:50" (2/3) ... [2023-12-16 07:50:13,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75fe9ecb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 07:50:13, skipping insertion in model container [2023-12-16 07:50:13,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 07:50:13" (3/3) ... [2023-12-16 07:50:13,992 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.UNBOUNDED.pals+Problem12_label03.c [2023-12-16 07:50:14,003 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 07:50:14,003 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-16 07:50:14,046 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 07:50:14,050 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;@38f35ef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 07:50:14,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-16 07:50:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 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 07:50:14,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 07:50:14,061 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:14,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:50:14,061 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:14,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:14,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2106045877, now seen corresponding path program 1 times [2023-12-16 07:50:14,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:14,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571642116] [2023-12-16 07:50:14,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:14,072 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 07:50:14,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:14,075 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 07:50:14,079 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 07:50:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:14,150 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 07:50:14,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:14,165 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 07:50:14,165 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:14,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:14,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571642116] [2023-12-16 07:50:14,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571642116] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:14,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:14,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:50:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260937546] [2023-12-16 07:50:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:14,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 07:50:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:14,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 07:50:14,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 07:50:14,197 INFO L87 Difference]: Start difference. First operand has 809 states, 806 states have (on average 1.978908188585608) internal successors, (1595), 808 states have internal predecessors, (1595), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:14,272 INFO L93 Difference]: Finished difference Result 1597 states and 3151 transitions. [2023-12-16 07:50:14,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 07:50:14,274 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-16 07:50:14,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:14,285 INFO L225 Difference]: With dead ends: 1597 [2023-12-16 07:50:14,285 INFO L226 Difference]: Without dead ends: 805 [2023-12-16 07:50:14,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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 07:50:14,299 INFO L413 NwaCegarLoop]: 1523 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:14,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1523 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2023-12-16 07:50:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2023-12-16 07:50:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8978829389788294) internal successors, (1524), 804 states have internal predecessors, (1524), 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 07:50:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1524 transitions. [2023-12-16 07:50:14,363 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1524 transitions. Word has length 17 [2023-12-16 07:50:14,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:14,363 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1524 transitions. [2023-12-16 07:50:14,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:14,364 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1524 transitions. [2023-12-16 07:50:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 07:50:14,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:14,365 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:50:14,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 07:50:14,567 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 07:50:14,568 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:14,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:14,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1602115405, now seen corresponding path program 1 times [2023-12-16 07:50:14,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:14,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173104971] [2023-12-16 07:50:14,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:14,570 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 07:50:14,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:14,571 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 07:50:14,572 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 07:50:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:14,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:50:14,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:14,671 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 07:50:14,671 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:14,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:14,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173104971] [2023-12-16 07:50:14,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173104971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:14,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:14,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:50:14,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732651561] [2023-12-16 07:50:14,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:14,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:50:14,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:14,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:50:14,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:50:14,673 INFO L87 Difference]: Start difference. First operand 805 states and 1524 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:14,723 INFO L93 Difference]: Finished difference Result 839 states and 1576 transitions. [2023-12-16 07:50:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:50:14,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-16 07:50:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:14,727 INFO L225 Difference]: With dead ends: 839 [2023-12-16 07:50:14,728 INFO L226 Difference]: Without dead ends: 805 [2023-12-16 07:50:14,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:50:14,729 INFO L413 NwaCegarLoop]: 1521 mSDtfsCounter, 0 mSDsluCounter, 3022 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4543 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:14,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4543 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:14,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2023-12-16 07:50:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2023-12-16 07:50:14,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 803 states have (on average 1.8779576587795765) internal successors, (1508), 804 states have internal predecessors, (1508), 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 07:50:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1508 transitions. [2023-12-16 07:50:14,741 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1508 transitions. Word has length 17 [2023-12-16 07:50:14,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:14,741 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1508 transitions. [2023-12-16 07:50:14,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:14,742 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1508 transitions. [2023-12-16 07:50:14,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 07:50:14,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:14,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:50:14,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 07:50:14,948 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 07:50:14,948 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:14,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash -2003021176, now seen corresponding path program 1 times [2023-12-16 07:50:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:14,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504924426] [2023-12-16 07:50:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:14,950 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 07:50:14,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:14,950 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 07:50:14,972 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 07:50:14,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:14,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:50:14,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:15,031 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 07:50:15,032 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:15,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:15,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504924426] [2023-12-16 07:50:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504924426] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 07:50:15,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874729098] [2023-12-16 07:50:15,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:15,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:50:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:50:15,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:50:15,033 INFO L87 Difference]: Start difference. First operand 805 states and 1508 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 07:50:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:47,106 INFO L93 Difference]: Finished difference Result 2309 states and 4381 transitions. [2023-12-16 07:50:47,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:50:47,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2023-12-16 07:50:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:47,111 INFO L225 Difference]: With dead ends: 2309 [2023-12-16 07:50:47,112 INFO L226 Difference]: Without dead ends: 1556 [2023-12-16 07:50:47,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 07:50:47,113 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 851 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 456 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 2862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 456 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:47,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 541 Invalid, 2862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [456 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 31.9s Time] [2023-12-16 07:50:47,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2023-12-16 07:50:47,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2023-12-16 07:50:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1554 states have (on average 1.6003861003861004) internal successors, (2487), 1555 states have internal predecessors, (2487), 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 07:50:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2487 transitions. [2023-12-16 07:50:47,135 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2487 transitions. Word has length 19 [2023-12-16 07:50:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:47,135 INFO L495 AbstractCegarLoop]: Abstraction has 1556 states and 2487 transitions. [2023-12-16 07:50:47,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 07:50:47,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2487 transitions. [2023-12-16 07:50:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 07:50:47,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:47,136 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] [2023-12-16 07:50:47,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 07:50:47,338 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 07:50:47,339 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:47,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:47,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1530211809, now seen corresponding path program 1 times [2023-12-16 07:50:47,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:47,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1536559897] [2023-12-16 07:50:47,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:47,340 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 07:50:47,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:47,341 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 07:50:47,345 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 07:50:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:47,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 07:50:47,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:47,589 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 07:50:47,590 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:47,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:47,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1536559897] [2023-12-16 07:50:47,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1536559897] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:47,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:47,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 07:50:47,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390527772] [2023-12-16 07:50:47,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:47,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 07:50:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:47,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 07:50:47,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:50:47,591 INFO L87 Difference]: Start difference. First operand 1556 states and 2487 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 07:50:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:47,729 INFO L93 Difference]: Finished difference Result 1680 states and 2683 transitions. [2023-12-16 07:50:47,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 07:50:47,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 32 [2023-12-16 07:50:47,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:47,734 INFO L225 Difference]: With dead ends: 1680 [2023-12-16 07:50:47,734 INFO L226 Difference]: Without dead ends: 1649 [2023-12-16 07:50:47,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-16 07:50:47,736 INFO L413 NwaCegarLoop]: 1499 mSDtfsCounter, 4558 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:47,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4558 Valid, 1627 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:50:47,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2023-12-16 07:50:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1614. [2023-12-16 07:50:47,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1612 states have (on average 1.6004962779156326) internal successors, (2580), 1613 states have internal predecessors, (2580), 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 07:50:47,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2580 transitions. [2023-12-16 07:50:47,761 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 2580 transitions. Word has length 32 [2023-12-16 07:50:47,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:47,762 INFO L495 AbstractCegarLoop]: Abstraction has 1614 states and 2580 transitions. [2023-12-16 07:50:47,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 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 07:50:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 2580 transitions. [2023-12-16 07:50:47,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-16 07:50:47,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:47,764 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] [2023-12-16 07:50:47,770 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 07:50:47,967 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 07:50:47,968 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:47,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:47,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1777423345, now seen corresponding path program 1 times [2023-12-16 07:50:47,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:47,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482649772] [2023-12-16 07:50:47,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:47,969 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 07:50:47,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:47,970 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 07:50:47,980 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 07:50:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:48,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:50:48,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:48,075 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 07:50:48,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:48,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:48,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482649772] [2023-12-16 07:50:48,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482649772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:48,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:48,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:50:48,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898631893] [2023-12-16 07:50:48,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:48,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:50:48,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:48,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:50:48,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:50:48,077 INFO L87 Difference]: Start difference. First operand 1614 states and 2580 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 07:50:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:48,124 INFO L93 Difference]: Finished difference Result 1776 states and 2836 transitions. [2023-12-16 07:50:48,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:50:48,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2023-12-16 07:50:48,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:48,130 INFO L225 Difference]: With dead ends: 1776 [2023-12-16 07:50:48,130 INFO L226 Difference]: Without dead ends: 1687 [2023-12-16 07:50:48,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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 07:50:48,132 INFO L413 NwaCegarLoop]: 1501 mSDtfsCounter, 1466 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 1542 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:48,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 1542 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:48,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2023-12-16 07:50:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 1682. [2023-12-16 07:50:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1680 states have (on average 1.5964285714285715) internal successors, (2682), 1681 states have internal predecessors, (2682), 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 07:50:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2682 transitions. [2023-12-16 07:50:48,158 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2682 transitions. Word has length 34 [2023-12-16 07:50:48,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:48,159 INFO L495 AbstractCegarLoop]: Abstraction has 1682 states and 2682 transitions. [2023-12-16 07:50:48,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 07:50:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2682 transitions. [2023-12-16 07:50:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-16 07:50:48,167 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:48,168 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] [2023-12-16 07:50:48,181 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 (6)] Ended with exit code 0 [2023-12-16 07:50:48,370 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 07:50:48,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:48,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash 672589841, now seen corresponding path program 1 times [2023-12-16 07:50:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:48,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918189190] [2023-12-16 07:50:48,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:48,372 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 07:50:48,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:48,373 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 07:50:48,405 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 07:50:48,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:48,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 07:50:48,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:48,455 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 07:50:48,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:48,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:48,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918189190] [2023-12-16 07:50:48,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918189190] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:48,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:48,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 07:50:48,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251223447] [2023-12-16 07:50:48,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:48,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 07:50:48,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:48,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 07:50:48,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:50:48,458 INFO L87 Difference]: Start difference. First operand 1682 states and 2682 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 07:50:48,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:48,512 INFO L93 Difference]: Finished difference Result 1696 states and 2699 transitions. [2023-12-16 07:50:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 07:50:48,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2023-12-16 07:50:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:48,518 INFO L225 Difference]: With dead ends: 1696 [2023-12-16 07:50:48,518 INFO L226 Difference]: Without dead ends: 1694 [2023-12-16 07:50:48,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 07:50:48,522 INFO L413 NwaCegarLoop]: 1504 mSDtfsCounter, 1 mSDsluCounter, 3000 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:48,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4504 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2023-12-16 07:50:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1690. [2023-12-16 07:50:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 1.5930094786729858) internal successors, (2689), 1689 states have internal predecessors, (2689), 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 07:50:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 2689 transitions. [2023-12-16 07:50:48,548 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 2689 transitions. Word has length 35 [2023-12-16 07:50:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:48,549 INFO L495 AbstractCegarLoop]: Abstraction has 1690 states and 2689 transitions. [2023-12-16 07:50:48,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 07:50:48,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 2689 transitions. [2023-12-16 07:50:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 07:50:48,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:48,550 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] [2023-12-16 07:50:48,556 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 07:50:48,753 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 07:50:48,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:48,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:48,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1662874585, now seen corresponding path program 1 times [2023-12-16 07:50:48,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:48,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686634136] [2023-12-16 07:50:48,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:48,755 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 07:50:48,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:48,756 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 07:50:48,777 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 07:50:48,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:48,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:50:48,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:48,845 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 07:50:48,845 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:48,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:48,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686634136] [2023-12-16 07:50:48,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686634136] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:48,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:48,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:50:48,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352590000] [2023-12-16 07:50:48,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:48,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:50:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:48,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:50:48,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:50:48,846 INFO L87 Difference]: Start difference. First operand 1690 states and 2689 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:48,884 INFO L93 Difference]: Finished difference Result 1996 states and 3149 transitions. [2023-12-16 07:50:48,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:50:48,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-16 07:50:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:48,890 INFO L225 Difference]: With dead ends: 1996 [2023-12-16 07:50:48,890 INFO L226 Difference]: Without dead ends: 1831 [2023-12-16 07:50:48,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 07:50:48,892 INFO L413 NwaCegarLoop]: 1520 mSDtfsCounter, 1473 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1473 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:48,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1473 Valid, 1577 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2023-12-16 07:50:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1829. [2023-12-16 07:50:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1827 states have (on average 1.582375478927203) internal successors, (2891), 1828 states have internal predecessors, (2891), 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 07:50:48,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2891 transitions. [2023-12-16 07:50:48,921 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2891 transitions. Word has length 36 [2023-12-16 07:50:48,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:48,922 INFO L495 AbstractCegarLoop]: Abstraction has 1829 states and 2891 transitions. [2023-12-16 07:50:48,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:48,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2891 transitions. [2023-12-16 07:50:48,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 07:50:48,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:48,922 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] [2023-12-16 07:50:48,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 07:50:49,125 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 07:50:49,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:49,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1743359271, now seen corresponding path program 1 times [2023-12-16 07:50:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:49,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743474168] [2023-12-16 07:50:49,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:49,127 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 07:50:49,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:49,128 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 07:50:49,157 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 07:50:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:49,177 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:50:49,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:49,212 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 07:50:49,212 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:49,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:49,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743474168] [2023-12-16 07:50:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743474168] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:49,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:49,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:50:49,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235043558] [2023-12-16 07:50:49,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:49,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:50:49,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:50:49,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:50:49,216 INFO L87 Difference]: Start difference. First operand 1829 states and 2891 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:49,252 INFO L93 Difference]: Finished difference Result 2389 states and 3713 transitions. [2023-12-16 07:50:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:50:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-12-16 07:50:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:49,258 INFO L225 Difference]: With dead ends: 2389 [2023-12-16 07:50:49,258 INFO L226 Difference]: Without dead ends: 2085 [2023-12-16 07:50:49,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 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 07:50:49,262 INFO L413 NwaCegarLoop]: 1530 mSDtfsCounter, 1475 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1475 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:49,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1475 Valid, 1583 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2023-12-16 07:50:49,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2083. [2023-12-16 07:50:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2081 states have (on average 1.5603075444497838) internal successors, (3247), 2082 states have internal predecessors, (3247), 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 07:50:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3247 transitions. [2023-12-16 07:50:49,301 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3247 transitions. Word has length 36 [2023-12-16 07:50:49,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:49,301 INFO L495 AbstractCegarLoop]: Abstraction has 2083 states and 3247 transitions. [2023-12-16 07:50:49,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3247 transitions. [2023-12-16 07:50:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 07:50:49,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:49,303 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] [2023-12-16 07:50:49,306 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 07:50:49,506 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 07:50:49,506 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:49,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:49,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1790191284, now seen corresponding path program 1 times [2023-12-16 07:50:49,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:49,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641212576] [2023-12-16 07:50:49,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:49,508 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 07:50:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:49,509 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 07:50:49,513 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 07:50:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:49,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:50:49,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:49,602 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 07:50:49,602 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:49,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:49,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641212576] [2023-12-16 07:50:49,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641212576] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:49,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:49,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:50:49,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2328342] [2023-12-16 07:50:49,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:49,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:50:49,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:49,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:50:49,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:50:49,604 INFO L87 Difference]: Start difference. First operand 2083 states and 3247 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:49,638 INFO L93 Difference]: Finished difference Result 2666 states and 4117 transitions. [2023-12-16 07:50:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:50:49,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-12-16 07:50:49,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:49,646 INFO L225 Difference]: With dead ends: 2666 [2023-12-16 07:50:49,646 INFO L226 Difference]: Without dead ends: 2339 [2023-12-16 07:50:49,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 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 07:50:49,648 INFO L413 NwaCegarLoop]: 1535 mSDtfsCounter, 1474 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:49,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1584 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2023-12-16 07:50:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2337. [2023-12-16 07:50:49,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2337 states, 2335 states have (on average 1.545610278372591) internal successors, (3609), 2336 states have internal predecessors, (3609), 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 07:50:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3609 transitions. [2023-12-16 07:50:49,686 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3609 transitions. Word has length 38 [2023-12-16 07:50:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:49,686 INFO L495 AbstractCegarLoop]: Abstraction has 2337 states and 3609 transitions. [2023-12-16 07:50:49,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 07:50:49,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3609 transitions. [2023-12-16 07:50:49,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-16 07:50:49,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:49,687 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 07:50:49,694 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 07:50:49,891 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 07:50:49,891 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:49,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1496014032, now seen corresponding path program 1 times [2023-12-16 07:50:49,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:49,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402101579] [2023-12-16 07:50:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:49,892 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 07:50:49,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:49,893 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 07:50:49,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 07:50:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:49,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:50:49,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:49,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:49,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:49,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402101579] [2023-12-16 07:50:49,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402101579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:49,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:49,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:50:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029911444] [2023-12-16 07:50:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:49,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:50:49,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:49,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:50:49,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:50:49,974 INFO L87 Difference]: Start difference. First operand 2337 states and 3609 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 07:50:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:50,009 INFO L93 Difference]: Finished difference Result 2932 states and 4479 transitions. [2023-12-16 07:50:50,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:50:50,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2023-12-16 07:50:50,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:50,038 INFO L225 Difference]: With dead ends: 2932 [2023-12-16 07:50:50,038 INFO L226 Difference]: Without dead ends: 2122 [2023-12-16 07:50:50,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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 07:50:50,040 INFO L413 NwaCegarLoop]: 1529 mSDtfsCounter, 34 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 3020 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:50,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 3020 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2023-12-16 07:50:50,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2023-12-16 07:50:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 2118 states have (on average 1.5561850802644004) internal successors, (3296), 2119 states have internal predecessors, (3296), 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 07:50:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3296 transitions. [2023-12-16 07:50:50,074 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3296 transitions. Word has length 50 [2023-12-16 07:50:50,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:50,074 INFO L495 AbstractCegarLoop]: Abstraction has 2120 states and 3296 transitions. [2023-12-16 07:50:50,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 07:50:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3296 transitions. [2023-12-16 07:50:50,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-16 07:50:50,074 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:50,074 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 07:50:50,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 07:50:50,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:50:50,286 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:50,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:50,287 INFO L85 PathProgramCache]: Analyzing trace with hash -350989803, now seen corresponding path program 1 times [2023-12-16 07:50:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351607801] [2023-12-16 07:50:50,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:50,287 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 07:50:50,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:50,288 INFO L229 MonitoredProcess]: Starting monitored process 12 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 07:50:50,293 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 (12)] Waiting until timeout for monitored process [2023-12-16 07:50:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:50,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:50:50,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:50,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:50,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:50:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:51,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:51,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351607801] [2023-12-16 07:50:51,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351607801] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:50:51,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:50:51,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 07:50:51,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480653748] [2023-12-16 07:50:51,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:50:51,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 07:50:51,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:51,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 07:50:51,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:50:51,178 INFO L87 Difference]: Start difference. First operand 2120 states and 3296 transitions. Second operand has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 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 07:50:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:52,661 INFO L93 Difference]: Finished difference Result 3648 states and 5467 transitions. [2023-12-16 07:50:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 07:50:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2023-12-16 07:50:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:52,671 INFO L225 Difference]: With dead ends: 3648 [2023-12-16 07:50:52,671 INFO L226 Difference]: Without dead ends: 3070 [2023-12-16 07:50:52,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2023-12-16 07:50:52,673 INFO L413 NwaCegarLoop]: 1512 mSDtfsCounter, 1921 mSDsluCounter, 12114 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1921 SdHoareTripleChecker+Valid, 13626 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:52,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1921 Valid, 13626 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 07:50:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3070 states. [2023-12-16 07:50:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3070 to 2696. [2023-12-16 07:50:52,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2694 states have (on average 1.5308092056421678) internal successors, (4124), 2695 states have internal predecessors, (4124), 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 07:50:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4124 transitions. [2023-12-16 07:50:52,726 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4124 transitions. Word has length 52 [2023-12-16 07:50:52,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:52,727 INFO L495 AbstractCegarLoop]: Abstraction has 2696 states and 4124 transitions. [2023-12-16 07:50:52,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.875) internal successors, (94), 16 states have internal predecessors, (94), 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 07:50:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4124 transitions. [2023-12-16 07:50:52,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-16 07:50:52,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:52,728 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-16 07:50:52,731 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 (12)] Forceful destruction successful, exit code 0 [2023-12-16 07:50:52,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 07:50:52,931 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:52,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:52,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1007998251, now seen corresponding path program 1 times [2023-12-16 07:50:52,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:52,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047777767] [2023-12-16 07:50:52,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:52,932 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 07:50:52,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:52,949 INFO L229 MonitoredProcess]: Starting monitored process 13 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 07:50:52,953 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 (13)] Waiting until timeout for monitored process [2023-12-16 07:50:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:53,007 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:50:53,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:53,038 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:53,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:53,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:53,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047777767] [2023-12-16 07:50:53,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047777767] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:53,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:53,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:50:53,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530440956] [2023-12-16 07:50:53,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:53,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:50:53,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:53,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:50:53,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:50:53,039 INFO L87 Difference]: Start difference. First operand 2696 states and 4124 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 07:50:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:53,072 INFO L93 Difference]: Finished difference Result 3276 states and 4960 transitions. [2023-12-16 07:50:53,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:50:53,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 54 [2023-12-16 07:50:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:53,077 INFO L225 Difference]: With dead ends: 3276 [2023-12-16 07:50:53,077 INFO L226 Difference]: Without dead ends: 2122 [2023-12-16 07:50:53,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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 07:50:53,079 INFO L413 NwaCegarLoop]: 1522 mSDtfsCounter, 28 mSDsluCounter, 1483 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:53,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3005 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2023-12-16 07:50:53,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2023-12-16 07:50:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2120 states, 2118 states have (on average 1.5476864966949953) internal successors, (3278), 2119 states have internal predecessors, (3278), 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 07:50:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3278 transitions. [2023-12-16 07:50:53,116 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3278 transitions. Word has length 54 [2023-12-16 07:50:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:53,116 INFO L495 AbstractCegarLoop]: Abstraction has 2120 states and 3278 transitions. [2023-12-16 07:50:53,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 07:50:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3278 transitions. [2023-12-16 07:50:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-16 07:50:53,117 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:53,117 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:50:53,122 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 (13)] Forceful destruction successful, exit code 0 [2023-12-16 07:50:53,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 07:50:53,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:53,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:53,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1513463516, now seen corresponding path program 1 times [2023-12-16 07:50:53,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:53,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [647186400] [2023-12-16 07:50:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:53,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 07:50:53,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:53,322 INFO L229 MonitoredProcess]: Starting monitored process 14 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 07:50:53,340 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 (14)] Waiting until timeout for monitored process [2023-12-16 07:50:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:53,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:50:53,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:53,958 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:50:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:54,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:54,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [647186400] [2023-12-16 07:50:54,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [647186400] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:50:54,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:50:54,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 07:50:54,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820271862] [2023-12-16 07:50:54,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:50:54,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 07:50:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:54,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 07:50:54,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:50:54,206 INFO L87 Difference]: Start difference. First operand 2120 states and 3278 transitions. Second operand has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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 07:50:55,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:55,228 INFO L93 Difference]: Finished difference Result 3700 states and 5490 transitions. [2023-12-16 07:50:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 07:50:55,228 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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 55 [2023-12-16 07:50:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:55,242 INFO L225 Difference]: With dead ends: 3700 [2023-12-16 07:50:55,243 INFO L226 Difference]: Without dead ends: 3122 [2023-12-16 07:50:55,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2023-12-16 07:50:55,244 INFO L413 NwaCegarLoop]: 1531 mSDtfsCounter, 4863 mSDsluCounter, 10571 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4863 SdHoareTripleChecker+Valid, 12102 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:55,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4863 Valid, 12102 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 07:50:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3122 states. [2023-12-16 07:50:55,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3122 to 2768. [2023-12-16 07:50:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2766 states have (on average 1.5039768618944325) internal successors, (4160), 2767 states have internal predecessors, (4160), 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 07:50:55,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 4160 transitions. [2023-12-16 07:50:55,307 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 4160 transitions. Word has length 55 [2023-12-16 07:50:55,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:55,308 INFO L495 AbstractCegarLoop]: Abstraction has 2768 states and 4160 transitions. [2023-12-16 07:50:55,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.375) internal successors, (102), 16 states have internal predecessors, (102), 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 07:50:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 4160 transitions. [2023-12-16 07:50:55,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-12-16 07:50:55,309 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:55,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:50:55,314 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 (14)] Forceful destruction successful, exit code 0 [2023-12-16 07:50:55,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 07:50:55,511 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:55,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1273776240, now seen corresponding path program 1 times [2023-12-16 07:50:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:55,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431217567] [2023-12-16 07:50:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:55,512 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 07:50:55,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:55,513 INFO L229 MonitoredProcess]: Starting monitored process 15 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 07:50:55,517 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 (15)] Waiting until timeout for monitored process [2023-12-16 07:50:55,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:55,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 07:50:55,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:55,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 07:50:55,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:55,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431217567] [2023-12-16 07:50:55,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431217567] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 07:50:55,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 07:50:55,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 07:50:55,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2367958] [2023-12-16 07:50:55,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 07:50:55,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 07:50:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:55,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 07:50:55,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 07:50:55,613 INFO L87 Difference]: Start difference. First operand 2768 states and 4160 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 07:50:55,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 07:50:55,648 INFO L93 Difference]: Finished difference Result 3330 states and 4934 transitions. [2023-12-16 07:50:55,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 07:50:55,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2023-12-16 07:50:55,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 07:50:55,652 INFO L225 Difference]: With dead ends: 3330 [2023-12-16 07:50:55,652 INFO L226 Difference]: Without dead ends: 2104 [2023-12-16 07:50:55,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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 07:50:55,654 INFO L413 NwaCegarLoop]: 1515 mSDtfsCounter, 24 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 2990 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:55,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 2990 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 07:50:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2104 states. [2023-12-16 07:50:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2104 to 2102. [2023-12-16 07:50:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2102 states, 2100 states have (on average 1.5319047619047619) internal successors, (3217), 2101 states have internal predecessors, (3217), 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 07:50:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 3217 transitions. [2023-12-16 07:50:55,685 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 3217 transitions. Word has length 57 [2023-12-16 07:50:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 07:50:55,685 INFO L495 AbstractCegarLoop]: Abstraction has 2102 states and 3217 transitions. [2023-12-16 07:50:55,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 07:50:55,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 3217 transitions. [2023-12-16 07:50:55,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-12-16 07:50:55,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 07:50:55,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:50:55,692 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 (15)] Forceful destruction successful, exit code 0 [2023-12-16 07:50:55,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 07:50:55,889 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 07:50:55,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 07:50:55,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1390802409, now seen corresponding path program 1 times [2023-12-16 07:50:55,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 07:50:55,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769719084] [2023-12-16 07:50:55,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 07:50:55,890 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 07:50:55,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 07:50:55,890 INFO L229 MonitoredProcess]: Starting monitored process 16 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 07:50:55,891 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 (16)] Waiting until timeout for monitored process [2023-12-16 07:50:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 07:50:55,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 07:50:55,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 07:50:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:56,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 07:50:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 07:50:56,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 07:50:56,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769719084] [2023-12-16 07:50:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769719084] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 07:50:56,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 07:50:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2023-12-16 07:50:56,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609438950] [2023-12-16 07:50:56,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 07:50:56,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 07:50:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 07:50:56,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 07:50:56,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-12-16 07:50:56,655 INFO L87 Difference]: Start difference. First operand 2102 states and 3217 transitions. Second operand has 16 states, 16 states have (on average 6.875) internal successors, (110), 16 states have internal predecessors, (110), 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 07:50:56,908 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 07:50:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 07:50:56,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-12-16 07:50:56,912 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 120 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 07:50:56,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 311 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 07:50:56,913 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-12-16 07:50:56,918 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 (16)] Ended with exit code 0 [2023-12-16 07:50:56,957 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 (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 07:50:57,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 07:50:57,114 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (2102states) and FLOYD_HOARE automaton (currently 8 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-5-1 context. [2023-12-16 07:50:57,116 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-16 07:50:57,118 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 07:50:57,120 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 07:50:57,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 07:50:57 BoogieIcfgContainer [2023-12-16 07:50:57,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 07:50:57,122 INFO L158 Benchmark]: Toolchain (without parser) took 68007.87ms. Allocated memory was 194.0MB in the beginning and 469.8MB in the end (delta: 275.8MB). Free memory was 130.6MB in the beginning and 237.7MB in the end (delta: -107.1MB). Peak memory consumption was 169.3MB. Max. memory is 8.0GB. [2023-12-16 07:50:57,122 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 194.0MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 07:50:57,122 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1422.54ms. Allocated memory was 194.0MB in the beginning and 262.1MB in the end (delta: 68.2MB). Free memory was 130.4MB in the beginning and 168.6MB in the end (delta: -38.2MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. [2023-12-16 07:50:57,122 INFO L158 Benchmark]: Boogie Procedure Inliner took 160.19ms. Allocated memory is still 262.1MB. Free memory was 168.6MB in the beginning and 133.5MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. [2023-12-16 07:50:57,122 INFO L158 Benchmark]: Boogie Preprocessor took 311.13ms. Allocated memory is still 262.1MB. Free memory was 133.0MB in the beginning and 177.5MB in the end (delta: -44.6MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. [2023-12-16 07:50:57,123 INFO L158 Benchmark]: RCFGBuilder took 22976.24ms. Allocated memory was 262.1MB in the beginning and 469.8MB in the end (delta: 207.6MB). Free memory was 177.5MB in the beginning and 281.3MB in the end (delta: -103.8MB). Peak memory consumption was 170.9MB. Max. memory is 8.0GB. [2023-12-16 07:50:57,123 INFO L158 Benchmark]: TraceAbstraction took 43132.88ms. Allocated memory is still 469.8MB. Free memory was 280.8MB in the beginning and 237.7MB in the end (delta: 43.1MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. [2023-12-16 07:50:57,124 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.13ms. Allocated memory is still 194.0MB. Free memory is still 146.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1422.54ms. Allocated memory was 194.0MB in the beginning and 262.1MB in the end (delta: 68.2MB). Free memory was 130.4MB in the beginning and 168.6MB in the end (delta: -38.2MB). Peak memory consumption was 106.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 160.19ms. Allocated memory is still 262.1MB. Free memory was 168.6MB in the beginning and 133.5MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 311.13ms. Allocated memory is still 262.1MB. Free memory was 133.0MB in the beginning and 177.5MB in the end (delta: -44.6MB). Peak memory consumption was 50.3MB. Max. memory is 8.0GB. * RCFGBuilder took 22976.24ms. Allocated memory was 262.1MB in the beginning and 469.8MB in the end (delta: 207.6MB). Free memory was 177.5MB in the beginning and 281.3MB in the end (delta: -103.8MB). Peak memory consumption was 170.9MB. Max. memory is 8.0GB. * TraceAbstraction took 43132.88ms. Allocated memory is still 469.8MB. Free memory was 280.8MB in the beginning and 237.7MB in the end (delta: 43.1MB). Peak memory consumption was 42.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 295]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 295). Cancelled while NwaCegarLoop was constructing difference of abstraction (2102states) and FLOYD_HOARE automaton (currently 8 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-5-1 context. - TimeoutResultAtElement [Line: 370]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 370). Cancelled while NwaCegarLoop was constructing difference of abstraction (2102states) and FLOYD_HOARE automaton (currently 8 states, 16 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-6-1 term,while SimplifyDDA2 was simplifying 4 xjuncts wrt. a ∧-5-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 809 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 43.1s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 35.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18288 SdHoareTripleChecker+Valid, 33.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18288 mSDsluCounter, 54078 SdHoareTripleChecker+Invalid, 27.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33761 mSDsCounter, 519 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3792 IncrementalHoareTripleChecker+Invalid, 4311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 519 mSolverCounterUnsat, 20317 mSDtfsCounter, 3792 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 769 GetRequests, 680 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2768occurred in iteration=13, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 784 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 590 NumberOfCodeBlocks, 590 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 737 ConstructedInterpolants, 111 QuantifiedInterpolants, 4828 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1755 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 70/94 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