/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/array-industry-pattern/check_removal_from_set_after_insertion.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 17:09:41,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 17:09:41,788 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-21 17:09:41,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 17:09:41,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 17:09:41,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 17:09:41,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 17:09:41,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 17:09:41,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 17:09:41,813 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 17:09:41,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 17:09:41,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 17:09:41,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 17:09:41,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 17:09:41,815 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 17:09:41,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 17:09:41,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 17:09:41,816 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 17:09:41,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 17:09:41,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 17:09:41,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 17:09:41,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 17:09:41,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 17:09:41,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 17:09:41,818 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 17:09:41,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 17:09:41,818 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 17:09:41,818 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 17:09:41,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 17:09:41,818 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 17:09:41,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 17:09:41,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 17:09:41,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 17:09:41,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 17:09:41,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:09:41,819 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 17:09:41,820 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 17:09:41,820 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 17:09:41,820 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 17:09:41,820 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 17:09:41,820 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 17:09:41,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 17:09:41,821 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 17:09:41,821 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 17:09:41,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 17:09:41,821 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 17:09:41,821 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-21 17:09:41,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 17:09:42,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 17:09:42,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 17:09:42,012 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 17:09:42,012 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 17:09:42,013 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion.c [2023-12-21 17:09:43,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 17:09:43,236 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 17:09:43,237 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion.c [2023-12-21 17:09:43,243 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef5070da/15d1984795354ed09f3ece025bc9f9c8/FLAG8e9461e31 [2023-12-21 17:09:43,262 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ef5070da/15d1984795354ed09f3ece025bc9f9c8 [2023-12-21 17:09:43,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 17:09:43,265 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 17:09:43,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 17:09:43,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 17:09:43,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 17:09:43,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26838e78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43, skipping insertion in model container [2023-12-21 17:09:43,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,289 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 17:09:43,409 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion.c[342,355] [2023-12-21 17:09:43,427 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:09:43,435 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 17:09:43,444 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/check_removal_from_set_after_insertion.c[342,355] [2023-12-21 17:09:43,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:09:43,462 INFO L206 MainTranslator]: Completed translation [2023-12-21 17:09:43,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43 WrapperNode [2023-12-21 17:09:43,463 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 17:09:43,463 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 17:09:43,464 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 17:09:43,464 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 17:09:43,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,474 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,490 INFO L138 Inliner]: procedures = 18, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2023-12-21 17:09:43,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 17:09:43,491 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 17:09:43,491 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 17:09:43,491 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 17:09:43,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,500 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,515 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 7, 3]. 58 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 3, 1]. [2023-12-21 17:09:43,515 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,520 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,523 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,524 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 17:09:43,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 17:09:43,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 17:09:43,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 17:09:43,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (1/1) ... [2023-12-21 17:09:43,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:09:43,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 17:09:43,576 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-21 17:09:43,580 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-21 17:09:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 17:09:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 17:09:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 17:09:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 17:09:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 17:09:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 17:09:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 17:09:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 17:09:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 17:09:43,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 17:09:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 17:09:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 17:09:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 17:09:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 17:09:43,676 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 17:09:43,678 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 17:09:43,891 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 17:09:43,927 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 17:09:43,927 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-21 17:09:43,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:09:43 BoogieIcfgContainer [2023-12-21 17:09:43,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 17:09:43,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 17:09:43,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 17:09:43,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 17:09:43,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:09:43" (1/3) ... [2023-12-21 17:09:43,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc50ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:09:43, skipping insertion in model container [2023-12-21 17:09:43,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:09:43" (2/3) ... [2023-12-21 17:09:43,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc50ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:09:43, skipping insertion in model container [2023-12-21 17:09:43,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:09:43" (3/3) ... [2023-12-21 17:09:43,933 INFO L112 eAbstractionObserver]: Analyzing ICFG check_removal_from_set_after_insertion.c [2023-12-21 17:09:43,945 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 17:09:43,945 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 17:09:43,974 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 17:09:43,978 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;@228bafd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 17:09:43,979 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 17:09:43,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 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-21 17:09:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 17:09:43,985 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:09:43,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:09:43,986 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:09:43,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:09:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash 272925399, now seen corresponding path program 1 times [2023-12-21 17:09:43,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:09:43,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173250161] [2023-12-21 17:09:43,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:09:43,998 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-21 17:09:43,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:09:44,000 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-21 17:09:44,001 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-21 17:09:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:09:44,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:09:44,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:09:44,096 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-21 17:09:44,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:09:44,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:09:44,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173250161] [2023-12-21 17:09:44,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173250161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:09:44,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:09:44,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 17:09:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381750332] [2023-12-21 17:09:44,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:09:44,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:09:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:09:44,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:09:44,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:09:44,119 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 23 states have internal predecessors, (41), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:09:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:09:44,198 INFO L93 Difference]: Finished difference Result 47 states and 81 transitions. [2023-12-21 17:09:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:09:44,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-21 17:09:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:09:44,205 INFO L225 Difference]: With dead ends: 47 [2023-12-21 17:09:44,205 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 17:09:44,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-21 17:09:44,212 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:09:44,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:09:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 17:09:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-21 17:09:44,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 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-21 17:09:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 32 transitions. [2023-12-21 17:09:44,235 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 32 transitions. Word has length 11 [2023-12-21 17:09:44,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:09:44,236 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 32 transitions. [2023-12-21 17:09:44,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:09:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 32 transitions. [2023-12-21 17:09:44,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 17:09:44,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:09:44,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:09:44,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-21 17:09:44,440 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-21 17:09:44,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:09:44,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:09:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 410553975, now seen corresponding path program 1 times [2023-12-21 17:09:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:09:44,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433295391] [2023-12-21 17:09:44,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:09:44,442 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-21 17:09:44,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:09:44,444 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-21 17:09:44,460 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-21 17:09:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:09:44,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 17:09:44,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:09:44,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:09:44,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:09:44,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:09:44,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:09:44,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433295391] [2023-12-21 17:09:44,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433295391] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:09:44,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:09:44,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-21 17:09:44,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223731487] [2023-12-21 17:09:44,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:09:44,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 17:09:44,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:09:44,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 17:09:44,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-21 17:09:44,589 INFO L87 Difference]: Start difference. First operand 23 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:09:44,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:09:44,701 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-21 17:09:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:09:44,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-21 17:09:44,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:09:44,702 INFO L225 Difference]: With dead ends: 46 [2023-12-21 17:09:44,702 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 17:09:44,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:09:44,704 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:09:44,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:09:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 17:09:44,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 17:09:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.4) internal successors, (35), 25 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-21 17:09:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-12-21 17:09:44,707 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 12 [2023-12-21 17:09:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:09:44,708 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-12-21 17:09:44,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:09:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-12-21 17:09:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 17:09:44,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:09:44,708 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:09:44,714 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-21 17:09:44,912 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-21 17:09:44,912 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:09:44,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:09:44,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2101712169, now seen corresponding path program 2 times [2023-12-21 17:09:44,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:09:44,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1361787796] [2023-12-21 17:09:44,913 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:09:44,914 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-21 17:09:44,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:09:44,915 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-21 17:09:44,915 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-21 17:09:44,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 17:09:44,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:09:44,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-21 17:09:44,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:09:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 17:09:44,992 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:09:44,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:09:44,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1361787796] [2023-12-21 17:09:44,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1361787796] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:09:44,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:09:44,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:09:44,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694634538] [2023-12-21 17:09:44,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:09:44,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 17:09:44,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:09:44,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 17:09:44,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 17:09:44,993 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:09:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:09:45,049 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2023-12-21 17:09:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 17:09:45,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 17:09:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:09:45,051 INFO L225 Difference]: With dead ends: 45 [2023-12-21 17:09:45,051 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 17:09:45,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 17:09:45,052 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:09:45,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 33 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:09:45,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 17:09:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2023-12-21 17:09:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 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-21 17:09:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-21 17:09:45,057 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 15 [2023-12-21 17:09:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:09:45,057 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-21 17:09:45,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:09:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-21 17:09:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-21 17:09:45,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:09:45,058 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:09:45,062 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-21 17:09:45,260 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-21 17:09:45,260 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:09:45,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:09:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1526450082, now seen corresponding path program 1 times [2023-12-21 17:09:45,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:09:45,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800328392] [2023-12-21 17:09:45,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:09:45,261 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-21 17:09:45,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:09:45,262 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-21 17:09:45,264 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-21 17:09:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:09:45,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-21 17:09:45,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:09:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 17:09:45,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:09:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 17:09:45,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:09:45,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800328392] [2023-12-21 17:09:45,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800328392] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:09:45,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:09:45,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-21 17:09:45,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329223713] [2023-12-21 17:09:45,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:09:45,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 17:09:45,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:09:45,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 17:09:45,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-21 17:09:45,558 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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-21 17:09:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:09:45,939 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2023-12-21 17:09:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 17:09:45,940 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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 21 [2023-12-21 17:09:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:09:45,940 INFO L225 Difference]: With dead ends: 54 [2023-12-21 17:09:45,940 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 17:09:45,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-21 17:09:45,941 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:09:45,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 89 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:09:45,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 17:09:45,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-12-21 17:09:45,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 states have internal predecessors, (42), 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-21 17:09:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2023-12-21 17:09:45,947 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 21 [2023-12-21 17:09:45,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:09:45,947 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2023-12-21 17:09:45,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 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-21 17:09:45,947 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2023-12-21 17:09:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 17:09:45,947 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:09:45,947 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:09:45,952 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-21 17:09:46,150 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-21 17:09:46,151 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:09:46,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:09:46,151 INFO L85 PathProgramCache]: Analyzing trace with hash 136221790, now seen corresponding path program 2 times [2023-12-21 17:09:46,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:09:46,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465686953] [2023-12-21 17:09:46,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:09:46,152 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-21 17:09:46,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:09:46,153 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-21 17:09:46,154 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-21 17:09:46,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 17:09:46,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:09:46,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-21 17:09:46,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:09:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-21 17:09:46,307 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:09:46,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:09:46,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465686953] [2023-12-21 17:09:46,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465686953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:09:46,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:09:46,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:09:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044921600] [2023-12-21 17:09:46,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:09:46,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 17:09:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:09:46,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 17:09:46,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 17:09:46,309 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:09:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:09:46,370 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2023-12-21 17:09:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 17:09:46,370 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-21 17:09:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:09:46,372 INFO L225 Difference]: With dead ends: 49 [2023-12-21 17:09:46,372 INFO L226 Difference]: Without dead ends: 39 [2023-12-21 17:09:46,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-21 17:09:46,373 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:09:46,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 34 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:09:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-21 17:09:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2023-12-21 17:09:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-21 17:09:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2023-12-21 17:09:46,379 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 27 [2023-12-21 17:09:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:09:46,379 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2023-12-21 17:09:46,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:09:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2023-12-21 17:09:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-21 17:09:46,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:09:46,380 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:09:46,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 17:09:46,584 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-21 17:09:46,584 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:09:46,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:09:46,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1864376792, now seen corresponding path program 1 times [2023-12-21 17:09:46,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:09:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678512718] [2023-12-21 17:09:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:09:46,585 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-21 17:09:46,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:09:46,586 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-21 17:09:46,587 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-21 17:09:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:09:46,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 17:09:46,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:09:46,815 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 17:09:46,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:09:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 17:09:47,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:09:47,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678512718] [2023-12-21 17:09:47,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678512718] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:09:47,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:09:47,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-21 17:09:47,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357253262] [2023-12-21 17:09:47,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:09:47,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 17:09:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:09:47,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 17:09:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-21 17:09:47,323 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 states have internal predecessors, (42), 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-21 17:09:49,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:09:49,247 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2023-12-21 17:09:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 17:09:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 states have internal predecessors, (42), 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 30 [2023-12-21 17:09:49,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:09:49,254 INFO L225 Difference]: With dead ends: 72 [2023-12-21 17:09:49,254 INFO L226 Difference]: Without dead ends: 48 [2023-12-21 17:09:49,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 17:09:49,255 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 17:09:49,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 165 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 17:09:49,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-21 17:09:49,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-12-21 17:09:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 states have internal predecessors, (58), 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-21 17:09:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2023-12-21 17:09:49,281 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 30 [2023-12-21 17:09:49,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:09:49,281 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2023-12-21 17:09:49,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 states have internal predecessors, (42), 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-21 17:09:49,281 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2023-12-21 17:09:49,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-21 17:09:49,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:09:49,282 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:09:49,292 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-21 17:09:49,485 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-21 17:09:49,485 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:09:49,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:09:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash 2135910872, now seen corresponding path program 2 times [2023-12-21 17:09:49,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:09:49,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637648768] [2023-12-21 17:09:49,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:09:49,486 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-21 17:09:49,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:09:49,487 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-21 17:09:49,490 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-21 17:09:49,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 17:09:49,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:09:49,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-21 17:09:49,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:09:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2023-12-21 17:09:49,575 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:09:49,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:09:49,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637648768] [2023-12-21 17:09:49,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637648768] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:09:49,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:09:49,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:09:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635374610] [2023-12-21 17:09:49,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:09:49,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-21 17:09:49,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:09:49,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-21 17:09:49,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-21 17:09:49,577 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-21 17:09:49,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:09:49,614 INFO L93 Difference]: Finished difference Result 59 states and 72 transitions. [2023-12-21 17:09:49,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-21 17:09:49,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 42 [2023-12-21 17:09:49,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:09:49,615 INFO L225 Difference]: With dead ends: 59 [2023-12-21 17:09:49,615 INFO L226 Difference]: Without dead ends: 50 [2023-12-21 17:09:49,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 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-21 17:09:49,616 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:09:49,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:09:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2023-12-21 17:09:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2023-12-21 17:09:49,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 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-21 17:09:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2023-12-21 17:09:49,627 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 42 [2023-12-21 17:09:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:09:49,628 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2023-12-21 17:09:49,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-21 17:09:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2023-12-21 17:09:49,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-21 17:09:49,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:09:49,632 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:09:49,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-21 17:09:49,834 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-21 17:09:49,835 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:09:49,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:09:49,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1347043392, now seen corresponding path program 1 times [2023-12-21 17:09:49,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:09:49,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138072393] [2023-12-21 17:09:49,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:09:49,836 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-21 17:09:49,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:09:49,837 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-21 17:09:49,839 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-21 17:09:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:09:49,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 17:09:49,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:09:50,330 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 17:09:50,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:09:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 17:09:52,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:09:52,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138072393] [2023-12-21 17:09:52,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138072393] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:09:52,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:09:52,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-21 17:09:52,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922029153] [2023-12-21 17:09:52,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:09:52,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-21 17:09:52,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:09:52,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-21 17:09:52,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-21 17:09:52,206 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 47 states have internal predecessors, (67), 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-21 17:10:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:10:04,897 INFO L93 Difference]: Finished difference Result 94 states and 133 transitions. [2023-12-21 17:10:04,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-21 17:10:04,898 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 47 states have internal predecessors, (67), 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 43 [2023-12-21 17:10:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:10:04,899 INFO L225 Difference]: With dead ends: 94 [2023-12-21 17:10:04,899 INFO L226 Difference]: Without dead ends: 71 [2023-12-21 17:10:04,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-21 17:10:04,901 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 17:10:04,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 309 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 17:10:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-21 17:10:04,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-12-21 17:10:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.1285714285714286) internal successors, (79), 70 states have internal predecessors, (79), 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-21 17:10:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2023-12-21 17:10:04,911 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 43 [2023-12-21 17:10:04,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:10:04,911 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2023-12-21 17:10:04,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 47 states have internal predecessors, (67), 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-21 17:10:04,912 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2023-12-21 17:10:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-21 17:10:04,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:10:04,917 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:10:04,925 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-21 17:10:05,122 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-21 17:10:05,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:10:05,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:10:05,123 INFO L85 PathProgramCache]: Analyzing trace with hash -146689984, now seen corresponding path program 2 times [2023-12-21 17:10:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:10:05,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199246382] [2023-12-21 17:10:05,124 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:10:05,124 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-21 17:10:05,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:10:05,125 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-21 17:10:05,128 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-21 17:10:05,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:10:05,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:10:05,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-21 17:10:05,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:10:06,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 17:10:06,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:10:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1083 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 17:10:13,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:10:13,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199246382] [2023-12-21 17:10:13,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199246382] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:10:13,754 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:10:13,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2023-12-21 17:10:13,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001419273] [2023-12-21 17:10:13,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:10:13,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2023-12-21 17:10:13,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:10:13,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2023-12-21 17:10:13,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2023-12-21 17:10:13,758 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 96 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:11:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:11:51,897 INFO L93 Difference]: Finished difference Result 142 states and 205 transitions. [2023-12-21 17:11:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-12-21 17:11:51,897 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2023-12-21 17:11:51,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:11:51,898 INFO L225 Difference]: With dead ends: 142 [2023-12-21 17:11:51,898 INFO L226 Difference]: Without dead ends: 119 [2023-12-21 17:11:51,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 101.8s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2023-12-21 17:11:51,903 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 3060 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 3062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:11:51,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 585 Invalid, 3062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3060 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-21 17:11:51,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-21 17:11:51,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-12-21 17:11:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.076271186440678) internal successors, (127), 118 states have internal predecessors, (127), 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-21 17:11:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2023-12-21 17:11:51,930 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 67 [2023-12-21 17:11:51,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:11:51,930 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2023-12-21 17:11:51,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 95 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:11:51,930 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2023-12-21 17:11:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 17:11:51,931 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:11:51,931 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:11:51,939 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-21 17:11:52,132 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-21 17:11:52,133 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:11:52,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:11:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2067828800, now seen corresponding path program 3 times [2023-12-21 17:11:52,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:11:52,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666540887] [2023-12-21 17:11:52,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:11:52,134 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-21 17:11:52,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:11:52,135 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-21 17:11:52,136 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-21 17:11:52,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-21 17:11:52,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:11:52,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 17:11:52,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:11:52,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4467 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4466 trivial. 0 not checked. [2023-12-21 17:11:52,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:11:52,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:11:52,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666540887] [2023-12-21 17:11:52,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666540887] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:11:52,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:11:52,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:11:52,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325742406] [2023-12-21 17:11:52,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:11:52,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 17:11:52,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:11:52,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 17:11:52,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 17:11:52,436 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-21 17:11:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:11:52,524 INFO L93 Difference]: Finished difference Result 160 states and 181 transitions. [2023-12-21 17:11:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 17:11:52,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2023-12-21 17:11:52,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:11:52,526 INFO L225 Difference]: With dead ends: 160 [2023-12-21 17:11:52,526 INFO L226 Difference]: Without dead ends: 139 [2023-12-21 17:11:52,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 17:11:52,526 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:11:52,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 93 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 17:11:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-21 17:11:52,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2023-12-21 17:11:52,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.0887096774193548) internal successors, (135), 124 states have internal predecessors, (135), 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-21 17:11:52,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2023-12-21 17:11:52,569 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 115 [2023-12-21 17:11:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:11:52,569 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2023-12-21 17:11:52,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-21 17:11:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2023-12-21 17:11:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-21 17:11:52,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:11:52,570 INFO L195 NwaCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:11:52,575 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 (11)] Ended with exit code 0 [2023-12-21 17:11:52,773 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-21 17:11:52,773 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:11:52,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:11:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash -428096714, now seen corresponding path program 1 times [2023-12-21 17:11:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:11:52,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319219106] [2023-12-21 17:11:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:11:52,774 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-21 17:11:52,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:11:52,775 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-21 17:11:52,775 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-21 17:11:53,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:11:53,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 97 conjunts are in the unsatisfiable core [2023-12-21 17:11:53,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:11:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4467 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 17:11:57,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:12:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4467 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 17:12:25,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:12:25,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319219106] [2023-12-21 17:12:25,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319219106] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:12:25,061 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:12:25,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 191 [2023-12-21 17:12:25,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953315747] [2023-12-21 17:12:25,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:12:25,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 192 states [2023-12-21 17:12:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:12:25,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2023-12-21 17:12:25,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9406, Invalid=27266, Unknown=0, NotChecked=0, Total=36672 [2023-12-21 17:12:25,068 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 192 states, 192 states have (on average 1.0989583333333333) internal successors, (211), 191 states have internal predecessors, (211), 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-21 17:13:00,688 WARN L293 SmtUtils]: Spent 19.26s on a formula simplification that was a NOOP. DAG size: 286 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:13:23,847 WARN L293 SmtUtils]: Spent 18.25s on a formula simplification that was a NOOP. DAG size: 283 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:13:45,549 WARN L293 SmtUtils]: Spent 17.50s on a formula simplification that was a NOOP. DAG size: 280 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:14:06,428 WARN L293 SmtUtils]: Spent 16.58s on a formula simplification that was a NOOP. DAG size: 277 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:14:28,502 WARN L293 SmtUtils]: Spent 17.03s on a formula simplification that was a NOOP. DAG size: 274 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:14:50,992 WARN L293 SmtUtils]: Spent 17.45s on a formula simplification that was a NOOP. DAG size: 271 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:15:13,005 WARN L293 SmtUtils]: Spent 16.83s on a formula simplification that was a NOOP. DAG size: 268 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:15:34,036 WARN L293 SmtUtils]: Spent 15.81s on a formula simplification that was a NOOP. DAG size: 265 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:15:54,912 WARN L293 SmtUtils]: Spent 15.77s on a formula simplification that was a NOOP. DAG size: 262 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:16:16,394 WARN L293 SmtUtils]: Spent 16.28s on a formula simplification that was a NOOP. DAG size: 259 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:16:35,139 WARN L293 SmtUtils]: Spent 13.80s on a formula simplification that was a NOOP. DAG size: 256 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:16:53,824 WARN L293 SmtUtils]: Spent 13.82s on a formula simplification that was a NOOP. DAG size: 253 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:17:12,689 WARN L293 SmtUtils]: Spent 13.94s on a formula simplification that was a NOOP. DAG size: 250 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:17:30,387 WARN L293 SmtUtils]: Spent 12.91s on a formula simplification that was a NOOP. DAG size: 247 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:17:48,916 WARN L293 SmtUtils]: Spent 13.61s on a formula simplification that was a NOOP. DAG size: 244 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:18:06,650 WARN L293 SmtUtils]: Spent 12.75s on a formula simplification that was a NOOP. DAG size: 241 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:18:24,723 WARN L293 SmtUtils]: Spent 12.94s on a formula simplification that was a NOOP. DAG size: 238 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:18:42,158 WARN L293 SmtUtils]: Spent 12.29s on a formula simplification that was a NOOP. DAG size: 235 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:18:59,810 WARN L293 SmtUtils]: Spent 12.54s on a formula simplification that was a NOOP. DAG size: 232 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:19:16,082 WARN L293 SmtUtils]: Spent 11.27s on a formula simplification that was a NOOP. DAG size: 229 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:19:31,558 WARN L293 SmtUtils]: Spent 10.83s on a formula simplification that was a NOOP. DAG size: 226 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:19:47,869 WARN L293 SmtUtils]: Spent 11.54s on a formula simplification that was a NOOP. DAG size: 223 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:20:02,836 WARN L293 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 220 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:20:19,272 WARN L293 SmtUtils]: Spent 10.71s on a formula simplification that was a NOOP. DAG size: 217 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:20:34,525 WARN L293 SmtUtils]: Spent 10.10s on a formula simplification that was a NOOP. DAG size: 214 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:20:49,037 WARN L293 SmtUtils]: Spent 9.85s on a formula simplification that was a NOOP. DAG size: 211 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:21:02,932 WARN L293 SmtUtils]: Spent 8.78s on a formula simplification that was a NOOP. DAG size: 208 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:21:16,691 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 205 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:21:30,334 WARN L293 SmtUtils]: Spent 8.97s on a formula simplification that was a NOOP. DAG size: 202 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:21:43,862 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 199 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:21:57,260 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 196 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:22:11,181 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 193 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:22:24,969 WARN L293 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:22:38,482 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 187 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:22:52,023 WARN L293 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 184 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:23:04,492 WARN L293 SmtUtils]: Spent 7.50s on a formula simplification that was a NOOP. DAG size: 181 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:23:16,658 WARN L293 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 178 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:23:29,033 WARN L293 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 175 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:23:41,325 WARN L293 SmtUtils]: Spent 7.49s on a formula simplification that was a NOOP. DAG size: 172 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:23:52,825 WARN L293 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 169 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:24:04,563 WARN L293 SmtUtils]: Spent 6.92s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:24:16,082 WARN L293 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-21 17:24:25,184 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 17:24:25,184 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-21 17:24:26,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2023-12-21 17:24:26,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 728.3s TimeCoverageRelationStatistics Valid=17470, Invalid=37052, Unknown=0, NotChecked=0, Total=54522 [2023-12-21 17:24:26,202 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 9164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-12-21 17:24:26,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 9164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9163 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2023-12-21 17:24:26,203 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 17:24:26,221 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-21 17:24:26,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-21 17:24:26,404 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-21 17:24:26,404 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (125states) and FLOYD_HOARE automaton (currently 139 states, 192 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-21 17:24:26,408 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1] [2023-12-21 17:24:26,409 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 17:24:26,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:24:26 BoogieIcfgContainer [2023-12-21 17:24:26,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 17:24:26,411 INFO L158 Benchmark]: Toolchain (without parser) took 883146.14ms. Allocated memory was 203.4MB in the beginning and 268.4MB in the end (delta: 65.0MB). Free memory was 168.6MB in the beginning and 220.8MB in the end (delta: -52.2MB). Peak memory consumption was 160.6MB. Max. memory is 8.0GB. [2023-12-21 17:24:26,412 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 203.4MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 17:24:26,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.38ms. Allocated memory is still 203.4MB. Free memory was 168.6MB in the beginning and 156.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 17:24:26,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.86ms. Allocated memory is still 203.4MB. Free memory was 156.5MB in the beginning and 154.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 17:24:26,412 INFO L158 Benchmark]: Boogie Preprocessor took 50.54ms. Allocated memory is still 203.4MB. Free memory was 154.5MB in the beginning and 152.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 17:24:26,413 INFO L158 Benchmark]: RCFGBuilder took 385.83ms. Allocated memory is still 203.4MB. Free memory was 152.4MB in the beginning and 133.0MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2023-12-21 17:24:26,413 INFO L158 Benchmark]: TraceAbstraction took 882481.99ms. Allocated memory was 203.4MB in the beginning and 268.4MB in the end (delta: 65.0MB). Free memory was 131.9MB in the beginning and 220.8MB in the end (delta: -88.9MB). Peak memory consumption was 123.9MB. Max. memory is 8.0GB. [2023-12-21 17:24:26,414 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 203.4MB. Free memory is still 160.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 195.38ms. Allocated memory is still 203.4MB. Free memory was 168.6MB in the beginning and 156.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.86ms. Allocated memory is still 203.4MB. Free memory was 156.5MB in the beginning and 154.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.54ms. Allocated memory is still 203.4MB. Free memory was 154.5MB in the beginning and 152.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 385.83ms. Allocated memory is still 203.4MB. Free memory was 152.4MB in the beginning and 133.0MB in the end (delta: 19.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 882481.99ms. Allocated memory was 203.4MB in the beginning and 268.4MB in the end (delta: 65.0MB). Free memory was 131.9MB in the beginning and 220.8MB in the end (delta: -88.9MB). Peak memory consumption was 123.9MB. 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: 4]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 4). Cancelled while NwaCegarLoop was constructing difference of abstraction (125states) and FLOYD_HOARE automaton (currently 139 states, 192 states before enhancement),while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 882.4s, OverallIterations: 11, TraceHistogramMax: 94, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 834.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 19.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 1428 SdHoareTripleChecker+Invalid, 17.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1189 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13810 IncrementalHoareTripleChecker+Invalid, 13827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 239 mSDtfsCounter, 13810 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 896 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 500 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2220 ImplicationChecksByTransitivity, 845.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=10, InterpolantAutomatonStates: 204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 43.6s InterpolantComputationTime, 498 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 769 ConstructedInterpolants, 0 QuantifiedInterpolants, 2943 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2095 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 4806/16536 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