/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 05:34:24,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 05:34:24,886 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-06 05:34:24,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 05:34:24,893 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 05:34:24,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 05:34:24,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 05:34:24,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 05:34:24,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 05:34:24,926 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 05:34:24,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 05:34:24,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 05:34:24,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 05:34:24,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 05:34:24,927 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 05:34:24,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 05:34:24,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 05:34:24,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 05:34:24,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 05:34:24,929 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 05:34:24,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 05:34:24,933 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 05:34:24,933 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 05:34:24,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 05:34:24,933 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 05:34:24,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 05:34:24,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 05:34:24,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 05:34:24,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 05:34:24,935 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 05:34:24,935 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 05:34:24,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:34:24,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 05:34:24,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 05:34:24,936 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 05:34:24,936 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 05:34:24,940 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 05:34:24,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 05:34:24,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 05:34:24,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 05:34:24,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 05:34:24,942 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 05:34:25,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 05:34:25,179 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 05:34:25,182 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 05:34:25,183 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 05:34:25,183 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 05:34:25,184 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2024-11-06 05:34:26,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 05:34:26,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 05:34:26,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2024-11-06 05:34:26,745 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223145a68/690c499e07ae420c90c02c9f3fe237e2/FLAG220e03928 [2024-11-06 05:34:27,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/223145a68/690c499e07ae420c90c02c9f3fe237e2 [2024-11-06 05:34:27,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 05:34:27,088 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 05:34:27,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 05:34:27,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 05:34:27,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 05:34:27,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f93b22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27, skipping insertion in model container [2024-11-06 05:34:27,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,131 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:34:27,346 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2024-11-06 05:34:27,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:34:27,569 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 05:34:27,578 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-array/btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c[1270,1283] [2024-11-06 05:34:27,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:34:27,666 INFO L204 MainTranslator]: Completed translation [2024-11-06 05:34:27,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27 WrapperNode [2024-11-06 05:34:27,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 05:34:27,667 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 05:34:27,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 05:34:27,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 05:34:27,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,747 INFO L138 Inliner]: procedures = 18, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 953 [2024-11-06 05:34:27,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 05:34:27,748 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 05:34:27,748 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 05:34:27,748 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 05:34:27,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,791 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 9, 9]. 45 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 4, 4]. [2024-11-06 05:34:27,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 05:34:27,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 05:34:27,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 05:34:27,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 05:34:27,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (1/1) ... [2024-11-06 05:34:27,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:34:27,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 05:34:27,859 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) [2024-11-06 05:34:27,861 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 [2024-11-06 05:34:27,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 05:34:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-06 05:34:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-06 05:34:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-06 05:34:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 05:34:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 05:34:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 05:34:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 05:34:27,883 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 05:34:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 05:34:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 05:34:27,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 05:34:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-06 05:34:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-06 05:34:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-06 05:34:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 05:34:28,076 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 05:34:28,078 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 05:34:28,715 INFO L? ?]: Removed 675 outVars from TransFormulas that were not future-live. [2024-11-06 05:34:28,715 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 05:34:28,726 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 05:34:28,726 INFO L316 CfgBuilder]: Removed 7 assume(true) statements. [2024-11-06 05:34:28,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:34:28 BoogieIcfgContainer [2024-11-06 05:34:28,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 05:34:28,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 05:34:28,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 05:34:28,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 05:34:28,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 05:34:27" (1/3) ... [2024-11-06 05:34:28,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f448a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:34:28, skipping insertion in model container [2024-11-06 05:34:28,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:34:27" (2/3) ... [2024-11-06 05:34:28,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f448a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:34:28, skipping insertion in model container [2024-11-06 05:34:28,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:34:28" (3/3) ... [2024-11-06 05:34:28,733 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.unsafe_arbitrated_fifos_n2d8w8.c [2024-11-06 05:34:28,745 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 05:34:28,745 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 05:34:28,792 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 05:34:28,796 INFO L333 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, 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;@7a826ca6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 05:34:28,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 05:34:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 05:34:28,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 05:34:28,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:28,807 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:28,808 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:28,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1919498836, now seen corresponding path program 1 times [2024-11-06 05:34:28,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:28,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752946623] [2024-11-06 05:34:28,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:28,823 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 [2024-11-06 05:34:28,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:28,831 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) [2024-11-06 05:34:28,843 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 [2024-11-06 05:34:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:29,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 05:34:29,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 05:34:29,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:29,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:29,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752946623] [2024-11-06 05:34:29,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752946623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:29,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:29,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 05:34:29,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952275424] [2024-11-06 05:34:29,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:29,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 05:34:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 05:34:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:34:29,220 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:34:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:29,234 INFO L93 Difference]: Finished difference Result 77 states and 117 transitions. [2024-11-06 05:34:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 05:34:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2024-11-06 05:34:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:29,240 INFO L225 Difference]: With dead ends: 77 [2024-11-06 05:34:29,240 INFO L226 Difference]: Without dead ends: 39 [2024-11-06 05:34:29,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:34:29,244 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:29,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-06 05:34:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-06 05:34:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 05:34:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-06 05:34:29,275 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 39 [2024-11-06 05:34:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:29,276 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-06 05:34:29,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:34:29,276 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-06 05:34:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-06 05:34:29,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:29,278 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:29,283 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 [2024-11-06 05:34:29,478 WARN L453 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 [2024-11-06 05:34:29,479 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:29,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:29,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1633554172, now seen corresponding path program 1 times [2024-11-06 05:34:29,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:29,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38578681] [2024-11-06 05:34:29,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:29,481 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 [2024-11-06 05:34:29,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:29,489 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) [2024-11-06 05:34:29,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 (3)] Waiting until timeout for monitored process [2024-11-06 05:34:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:29,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:29,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-06 05:34:29,789 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:29,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:29,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38578681] [2024-11-06 05:34:29,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38578681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:29,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:29,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006861871] [2024-11-06 05:34:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:29,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:29,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:29,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:29,793 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:29,810 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2024-11-06 05:34:29,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:29,810 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2024-11-06 05:34:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:29,811 INFO L225 Difference]: With dead ends: 76 [2024-11-06 05:34:29,811 INFO L226 Difference]: Without dead ends: 41 [2024-11-06 05:34:29,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:29,813 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:29,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-06 05:34:29,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-06 05:34:29,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 05:34:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-11-06 05:34:29,818 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 39 [2024-11-06 05:34:29,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:29,819 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-11-06 05:34:29,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:29,819 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-06 05:34:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-06 05:34:29,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:29,820 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:29,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-06 05:34:30,020 WARN L453 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 [2024-11-06 05:34:30,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:30,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1034306366, now seen corresponding path program 1 times [2024-11-06 05:34:30,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:30,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731214375] [2024-11-06 05:34:30,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:30,023 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 [2024-11-06 05:34:30,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:30,031 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) [2024-11-06 05:34:30,032 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 [2024-11-06 05:34:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:30,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:30,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:30,351 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-06 05:34:30,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:30,387 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-06 05:34:30,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:30,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731214375] [2024-11-06 05:34:30,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731214375] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:30,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:30,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:30,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104107766] [2024-11-06 05:34:30,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:30,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:30,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:30,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:30,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:30,389 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-06 05:34:30,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:30,434 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2024-11-06 05:34:30,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:30,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 41 [2024-11-06 05:34:30,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:30,438 INFO L225 Difference]: With dead ends: 81 [2024-11-06 05:34:30,438 INFO L226 Difference]: Without dead ends: 46 [2024-11-06 05:34:30,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:30,440 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:30,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 179 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-06 05:34:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-06 05:34:30,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 05:34:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-06 05:34:30,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 41 [2024-11-06 05:34:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:30,448 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-06 05:34:30,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-06 05:34:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-06 05:34:30,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 05:34:30,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:30,450 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:30,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-06 05:34:30,651 WARN L453 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 [2024-11-06 05:34:30,651 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:30,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:30,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1863265540, now seen corresponding path program 2 times [2024-11-06 05:34:30,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:30,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437270035] [2024-11-06 05:34:30,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:30,652 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 [2024-11-06 05:34:30,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:30,655 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) [2024-11-06 05:34:30,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-06 05:34:30,966 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 05:34:30,967 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:30,970 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:30,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:30,983 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-06 05:34:30,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:30,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:30,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437270035] [2024-11-06 05:34:30,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437270035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:30,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:30,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:30,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555969828] [2024-11-06 05:34:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:30,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:30,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:30,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:30,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:30,990 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:31,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:31,020 INFO L93 Difference]: Finished difference Result 80 states and 99 transitions. [2024-11-06 05:34:31,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:31,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2024-11-06 05:34:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:31,022 INFO L225 Difference]: With dead ends: 80 [2024-11-06 05:34:31,022 INFO L226 Difference]: Without dead ends: 48 [2024-11-06 05:34:31,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:31,024 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:31,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-06 05:34:31,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2024-11-06 05:34:31,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 05:34:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-11-06 05:34:31,037 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 47 [2024-11-06 05:34:31,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:31,037 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-11-06 05:34:31,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:31,038 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-11-06 05:34:31,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 05:34:31,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:31,043 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:31,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-06 05:34:31,243 WARN L453 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 [2024-11-06 05:34:31,244 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:31,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:31,244 INFO L85 PathProgramCache]: Analyzing trace with hash 347467898, now seen corresponding path program 1 times [2024-11-06 05:34:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:31,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414502708] [2024-11-06 05:34:31,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:31,245 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 [2024-11-06 05:34:31,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:31,247 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) [2024-11-06 05:34:31,248 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 [2024-11-06 05:34:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:31,509 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:31,513 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-06 05:34:31,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:31,669 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-06 05:34:31,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:31,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414502708] [2024-11-06 05:34:31,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [414502708] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:31,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:31,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:31,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517897956] [2024-11-06 05:34:31,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:31,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:31,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:31,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:31,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:31,675 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-06 05:34:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:31,797 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2024-11-06 05:34:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 49 [2024-11-06 05:34:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:31,799 INFO L225 Difference]: With dead ends: 91 [2024-11-06 05:34:31,799 INFO L226 Difference]: Without dead ends: 55 [2024-11-06 05:34:31,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:31,800 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:31,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 311 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:31,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-06 05:34:31,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-06 05:34:31,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-06 05:34:31,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-11-06 05:34:31,807 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 49 [2024-11-06 05:34:31,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:31,807 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-11-06 05:34:31,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-06 05:34:31,807 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-11-06 05:34:31,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-06 05:34:31,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:31,808 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:31,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 05:34:32,008 WARN L453 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 [2024-11-06 05:34:32,009 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:32,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:32,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1009564786, now seen corresponding path program 2 times [2024-11-06 05:34:32,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:32,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179707660] [2024-11-06 05:34:32,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:32,010 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 [2024-11-06 05:34:32,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:32,012 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) [2024-11-06 05:34:32,013 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 [2024-11-06 05:34:32,292 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-06 05:34:32,292 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:32,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 05:34:32,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-06 05:34:32,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:32,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:32,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179707660] [2024-11-06 05:34:32,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179707660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:32,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:32,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 05:34:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858274844] [2024-11-06 05:34:32,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:32,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 05:34:32,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:32,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 05:34:32,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:34:32,548 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:32,685 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2024-11-06 05:34:32,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 05:34:32,686 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 57 [2024-11-06 05:34:32,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:32,687 INFO L225 Difference]: With dead ends: 69 [2024-11-06 05:34:32,687 INFO L226 Difference]: Without dead ends: 67 [2024-11-06 05:34:32,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:32,687 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 34 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:32,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 112 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:32,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-06 05:34:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-06 05:34:32,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 55 states have internal predecessors, (62), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:32,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2024-11-06 05:34:32,697 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 57 [2024-11-06 05:34:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:32,698 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2024-11-06 05:34:32,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-11-06 05:34:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2024-11-06 05:34:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 05:34:32,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:32,699 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:32,706 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 (7)] Ended with exit code 0 [2024-11-06 05:34:32,903 WARN L453 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 [2024-11-06 05:34:32,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:32,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:32,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1536287813, now seen corresponding path program 1 times [2024-11-06 05:34:32,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:32,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338144842] [2024-11-06 05:34:32,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:32,905 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 [2024-11-06 05:34:32,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:32,906 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) [2024-11-06 05:34:32,908 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 [2024-11-06 05:34:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:33,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:33,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-06 05:34:33,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-06 05:34:33,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:33,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338144842] [2024-11-06 05:34:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338144842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:33,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943250426] [2024-11-06 05:34:33,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:33,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:33,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:33,470 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-06 05:34:33,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:33,512 INFO L93 Difference]: Finished difference Result 117 states and 148 transitions. [2024-11-06 05:34:33,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:33,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 98 [2024-11-06 05:34:33,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:33,513 INFO L225 Difference]: With dead ends: 117 [2024-11-06 05:34:33,513 INFO L226 Difference]: Without dead ends: 73 [2024-11-06 05:34:33,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:33,514 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:33,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:33,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-06 05:34:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-06 05:34:33,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.1147540983606556) internal successors, (68), 61 states have internal predecessors, (68), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:33,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2024-11-06 05:34:33,521 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 98 [2024-11-06 05:34:33,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:33,522 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2024-11-06 05:34:33,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-06 05:34:33,522 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2024-11-06 05:34:33,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-06 05:34:33,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:33,523 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:33,539 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 [2024-11-06 05:34:33,723 WARN L453 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 [2024-11-06 05:34:33,724 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:33,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1495219189, now seen corresponding path program 2 times [2024-11-06 05:34:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:33,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926960553] [2024-11-06 05:34:33,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:33,725 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 [2024-11-06 05:34:33,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:33,728 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) [2024-11-06 05:34:33,729 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 [2024-11-06 05:34:34,657 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:34,657 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:34,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 1144 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:34,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:34,713 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-06 05:34:34,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:34,810 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2024-11-06 05:34:34,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:34,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926960553] [2024-11-06 05:34:34,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926960553] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:34,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:34,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134351439] [2024-11-06 05:34:34,811 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:34,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:34,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:34,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:34,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:34,813 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-06 05:34:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:34,959 INFO L93 Difference]: Finished difference Result 125 states and 157 transitions. [2024-11-06 05:34:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:34,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 104 [2024-11-06 05:34:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:34,961 INFO L225 Difference]: With dead ends: 125 [2024-11-06 05:34:34,962 INFO L226 Difference]: Without dead ends: 81 [2024-11-06 05:34:34,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:34,963 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:34,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 434 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-06 05:34:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-06 05:34:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 69 states have internal predecessors, (76), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2024-11-06 05:34:34,989 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 104 [2024-11-06 05:34:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:34,989 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2024-11-06 05:34:34,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-06 05:34:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2024-11-06 05:34:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 05:34:34,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:34,997 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:35,008 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 [2024-11-06 05:34:35,197 WARN L453 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 [2024-11-06 05:34:35,198 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:35,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:35,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1746558445, now seen corresponding path program 3 times [2024-11-06 05:34:35,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:35,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697243649] [2024-11-06 05:34:35,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:35,200 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 [2024-11-06 05:34:35,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:35,202 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) [2024-11-06 05:34:35,203 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 [2024-11-06 05:34:36,068 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 05:34:36,069 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:36,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:36,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-06 05:34:36,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:36,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:36,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697243649] [2024-11-06 05:34:36,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697243649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:36,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:36,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:36,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515928677] [2024-11-06 05:34:36,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:36,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:36,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:36,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:36,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:36,099 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:36,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:36,132 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2024-11-06 05:34:36,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:36,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2024-11-06 05:34:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:36,136 INFO L225 Difference]: With dead ends: 114 [2024-11-06 05:34:36,136 INFO L226 Difference]: Without dead ends: 83 [2024-11-06 05:34:36,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:36,138 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:36,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-06 05:34:36,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-11-06 05:34:36,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.1) internal successors, (77), 70 states have internal predecessors, (77), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2024-11-06 05:34:36,149 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 112 [2024-11-06 05:34:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:36,150 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2024-11-06 05:34:36,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2024-11-06 05:34:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-06 05:34:36,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:36,151 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:36,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-06 05:34:36,352 WARN L453 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 [2024-11-06 05:34:36,352 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:36,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:36,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1839362927, now seen corresponding path program 1 times [2024-11-06 05:34:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:36,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1177122438] [2024-11-06 05:34:36,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:36,354 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 [2024-11-06 05:34:36,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:36,355 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) [2024-11-06 05:34:36,356 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 [2024-11-06 05:34:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:37,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:37,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-06 05:34:37,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-06 05:34:37,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:37,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1177122438] [2024-11-06 05:34:37,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1177122438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:37,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:37,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:37,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864328733] [2024-11-06 05:34:37,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:37,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:37,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:37,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:37,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:37,204 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:37,349 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2024-11-06 05:34:37,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:37,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-11-06 05:34:37,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:37,355 INFO L225 Difference]: With dead ends: 120 [2024-11-06 05:34:37,355 INFO L226 Difference]: Without dead ends: 88 [2024-11-06 05:34:37,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:37,356 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:37,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-06 05:34:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-06 05:34:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 76 states have internal predecessors, (83), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:37,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2024-11-06 05:34:37,368 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 114 [2024-11-06 05:34:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:37,368 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2024-11-06 05:34:37,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2024-11-06 05:34:37,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-06 05:34:37,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:37,369 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:37,386 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 [2024-11-06 05:34:37,573 WARN L453 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 [2024-11-06 05:34:37,574 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:37,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:37,574 INFO L85 PathProgramCache]: Analyzing trace with hash 513335051, now seen corresponding path program 2 times [2024-11-06 05:34:37,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:37,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176382764] [2024-11-06 05:34:37,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:37,575 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 [2024-11-06 05:34:37,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:37,577 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) [2024-11-06 05:34:37,579 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 [2024-11-06 05:34:38,617 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:38,617 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:38,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 1188 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:38,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:38,692 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 112 proven. 16 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-06 05:34:38,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-06 05:34:38,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:38,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176382764] [2024-11-06 05:34:38,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176382764] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:38,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:38,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872147097] [2024-11-06 05:34:38,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:38,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:38,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:38,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:38,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:38,802 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:38,985 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2024-11-06 05:34:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:38,987 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2024-11-06 05:34:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:38,988 INFO L225 Difference]: With dead ends: 134 [2024-11-06 05:34:38,988 INFO L226 Difference]: Without dead ends: 96 [2024-11-06 05:34:38,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:38,990 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:38,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 262 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:38,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-06 05:34:38,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-06 05:34:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 84 states have (on average 1.0833333333333333) internal successors, (91), 84 states have internal predecessors, (91), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2024-11-06 05:34:38,999 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 120 [2024-11-06 05:34:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:38,999 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2024-11-06 05:34:38,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2024-11-06 05:34:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-06 05:34:39,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:39,001 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:39,016 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 (12)] Ended with exit code 0 [2024-11-06 05:34:39,201 WARN L453 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 [2024-11-06 05:34:39,201 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:39,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:39,202 INFO L85 PathProgramCache]: Analyzing trace with hash -291789821, now seen corresponding path program 3 times [2024-11-06 05:34:39,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:39,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827345788] [2024-11-06 05:34:39,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:39,204 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 [2024-11-06 05:34:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:39,207 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:34:39,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-06 05:34:40,165 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 05:34:40,165 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:40,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:40,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 05:34:40,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:40,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:40,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827345788] [2024-11-06 05:34:40,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827345788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:40,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:40,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:40,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134315541] [2024-11-06 05:34:40,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:40,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:40,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:40,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:40,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:40,199 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:40,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:40,225 INFO L93 Difference]: Finished difference Result 144 states and 168 transitions. [2024-11-06 05:34:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:40,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 128 [2024-11-06 05:34:40,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:40,227 INFO L225 Difference]: With dead ends: 144 [2024-11-06 05:34:40,227 INFO L226 Difference]: Without dead ends: 98 [2024-11-06 05:34:40,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:40,227 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:40,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-06 05:34:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-11-06 05:34:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 85 states have (on average 1.0823529411764705) internal successors, (92), 85 states have internal predecessors, (92), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 112 transitions. [2024-11-06 05:34:40,234 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 112 transitions. Word has length 128 [2024-11-06 05:34:40,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:40,235 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 112 transitions. [2024-11-06 05:34:40,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 112 transitions. [2024-11-06 05:34:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-06 05:34:40,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:40,236 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:40,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-06 05:34:40,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:34:40,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:40,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1747262911, now seen corresponding path program 1 times [2024-11-06 05:34:40,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:40,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1778849518] [2024-11-06 05:34:40,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:40,439 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 [2024-11-06 05:34:40,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:40,442 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:34:40,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-06 05:34:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:41,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 1218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:41,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 05:34:41,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:41,713 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-06 05:34:41,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:41,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1778849518] [2024-11-06 05:34:41,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1778849518] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:41,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:41,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:41,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296831375] [2024-11-06 05:34:41,714 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:41,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:41,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:41,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:41,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:41,715 INFO L87 Difference]: Start difference. First operand 97 states and 112 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:41,776 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2024-11-06 05:34:41,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:41,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2024-11-06 05:34:41,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:41,777 INFO L225 Difference]: With dead ends: 150 [2024-11-06 05:34:41,777 INFO L226 Difference]: Without dead ends: 103 [2024-11-06 05:34:41,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:41,778 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:41,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:41,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-06 05:34:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-06 05:34:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 91 states have (on average 1.0769230769230769) internal successors, (98), 91 states have internal predecessors, (98), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:41,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2024-11-06 05:34:41,784 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 130 [2024-11-06 05:34:41,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:41,784 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2024-11-06 05:34:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:41,784 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2024-11-06 05:34:41,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-06 05:34:41,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:41,785 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:41,798 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 (14)] Ended with exit code 0 [2024-11-06 05:34:41,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:34:41,990 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:41,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1563987963, now seen corresponding path program 2 times [2024-11-06 05:34:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [325952001] [2024-11-06 05:34:41,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:41,991 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 [2024-11-06 05:34:41,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:41,994 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:34:41,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-06 05:34:43,244 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:43,245 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:43,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 1236 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:43,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 112 proven. 16 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 05:34:43,312 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2024-11-06 05:34:43,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:43,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [325952001] [2024-11-06 05:34:43,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [325952001] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:43,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:43,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:43,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396611332] [2024-11-06 05:34:43,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:43,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:43,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:43,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:43,389 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:43,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:43,546 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2024-11-06 05:34:43,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:43,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2024-11-06 05:34:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:43,548 INFO L225 Difference]: With dead ends: 164 [2024-11-06 05:34:43,548 INFO L226 Difference]: Without dead ends: 111 [2024-11-06 05:34:43,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:43,548 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:43,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 348 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:43,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-06 05:34:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-06 05:34:43,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 99 states have (on average 1.0707070707070707) internal successors, (106), 99 states have internal predecessors, (106), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2024-11-06 05:34:43,555 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 136 [2024-11-06 05:34:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:43,555 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2024-11-06 05:34:43,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2024-11-06 05:34:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-06 05:34:43,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:43,556 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:43,569 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 (15)] Ended with exit code 0 [2024-11-06 05:34:43,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:34:43,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:43,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:43,757 INFO L85 PathProgramCache]: Analyzing trace with hash -469367821, now seen corresponding path program 3 times [2024-11-06 05:34:43,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:43,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033573705] [2024-11-06 05:34:43,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:43,759 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 [2024-11-06 05:34:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:43,761 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:34:43,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-06 05:34:44,539 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 05:34:44,539 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:44,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:44,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-06 05:34:44,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:44,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:44,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033573705] [2024-11-06 05:34:44,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033573705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:44,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:44,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:44,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181418694] [2024-11-06 05:34:44,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:44,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:44,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:44,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:44,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:44,572 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:44,608 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2024-11-06 05:34:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:44,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 144 [2024-11-06 05:34:44,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:44,610 INFO L225 Difference]: With dead ends: 174 [2024-11-06 05:34:44,610 INFO L226 Difference]: Without dead ends: 113 [2024-11-06 05:34:44,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:44,612 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:44,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:44,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-06 05:34:44,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2024-11-06 05:34:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 100 states have (on average 1.07) internal successors, (107), 100 states have internal predecessors, (107), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2024-11-06 05:34:44,618 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 144 [2024-11-06 05:34:44,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:44,619 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2024-11-06 05:34:44,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2024-11-06 05:34:44,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-06 05:34:44,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:44,621 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:44,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-06 05:34:44,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:34:44,821 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:44,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:44,822 INFO L85 PathProgramCache]: Analyzing trace with hash 2091779569, now seen corresponding path program 1 times [2024-11-06 05:34:44,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:44,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319572184] [2024-11-06 05:34:44,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:44,823 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 [2024-11-06 05:34:44,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:44,824 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2024-11-06 05:34:44,826 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 (17)] Waiting until timeout for monitored process [2024-11-06 05:34:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:46,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:46,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:46,410 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-06 05:34:46,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-06 05:34:46,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:46,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319572184] [2024-11-06 05:34:46,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319572184] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:46,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:46,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:46,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623157942] [2024-11-06 05:34:46,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:46,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:46,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:46,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:46,457 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:46,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:46,514 INFO L93 Difference]: Finished difference Result 180 states and 206 transitions. [2024-11-06 05:34:46,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:46,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 146 [2024-11-06 05:34:46,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:46,516 INFO L225 Difference]: With dead ends: 180 [2024-11-06 05:34:46,516 INFO L226 Difference]: Without dead ends: 118 [2024-11-06 05:34:46,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:46,517 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:46,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 176 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-06 05:34:46,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-06 05:34:46,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 106 states have (on average 1.0660377358490567) internal successors, (113), 106 states have internal predecessors, (113), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2024-11-06 05:34:46,531 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 146 [2024-11-06 05:34:46,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:46,531 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2024-11-06 05:34:46,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2024-11-06 05:34:46,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-06 05:34:46,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:46,533 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:46,552 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 (17)] Forceful destruction successful, exit code 0 [2024-11-06 05:34:46,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 [2024-11-06 05:34:46,737 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:46,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:46,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1989517589, now seen corresponding path program 2 times [2024-11-06 05:34:46,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:46,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706195286] [2024-11-06 05:34:46,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:46,739 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 [2024-11-06 05:34:46,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:46,743 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2024-11-06 05:34:46,744 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 (18)] Waiting until timeout for monitored process [2024-11-06 05:34:48,603 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:48,604 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:48,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 1284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:48,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:48,694 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 112 proven. 16 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-06 05:34:48,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2024-11-06 05:34:48,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:48,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706195286] [2024-11-06 05:34:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706195286] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:48,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:48,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100860360] [2024-11-06 05:34:48,824 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:48,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:48,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:48,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:48,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:48,826 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:48,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:48,961 INFO L93 Difference]: Finished difference Result 194 states and 221 transitions. [2024-11-06 05:34:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:48,962 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 152 [2024-11-06 05:34:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:48,963 INFO L225 Difference]: With dead ends: 194 [2024-11-06 05:34:48,963 INFO L226 Difference]: Without dead ends: 126 [2024-11-06 05:34:48,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:48,964 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:48,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 262 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:48,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-06 05:34:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-06 05:34:48,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 114 states have (on average 1.0614035087719298) internal successors, (121), 114 states have internal predecessors, (121), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 141 transitions. [2024-11-06 05:34:48,973 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 141 transitions. Word has length 152 [2024-11-06 05:34:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:48,974 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 141 transitions. [2024-11-06 05:34:48,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 141 transitions. [2024-11-06 05:34:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-06 05:34:48,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:48,975 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:48,992 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 (18)] Forceful destruction successful, exit code 0 [2024-11-06 05:34:49,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2024-11-06 05:34:49,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:49,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:49,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1008746979, now seen corresponding path program 3 times [2024-11-06 05:34:49,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290586136] [2024-11-06 05:34:49,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:49,180 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 [2024-11-06 05:34:49,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:49,183 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2024-11-06 05:34:49,184 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 (19)] Waiting until timeout for monitored process [2024-11-06 05:34:50,184 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-06 05:34:50,184 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:50,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 05:34:50,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:50,273 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-06 05:34:50,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:34:50,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:50,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290586136] [2024-11-06 05:34:50,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290586136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:34:50,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:34:50,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 05:34:50,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357530047] [2024-11-06 05:34:50,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:34:50,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 05:34:50,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:50,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 05:34:50,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:50,274 INFO L87 Difference]: Start difference. First operand 126 states and 141 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:50,297 INFO L93 Difference]: Finished difference Result 204 states and 228 transitions. [2024-11-06 05:34:50,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 05:34:50,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 160 [2024-11-06 05:34:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:50,300 INFO L225 Difference]: With dead ends: 204 [2024-11-06 05:34:50,300 INFO L226 Difference]: Without dead ends: 128 [2024-11-06 05:34:50,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 05:34:50,301 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:50,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:50,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-06 05:34:50,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2024-11-06 05:34:50,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 115 states have (on average 1.0608695652173914) internal successors, (122), 115 states have internal predecessors, (122), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2024-11-06 05:34:50,310 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 160 [2024-11-06 05:34:50,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:50,310 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2024-11-06 05:34:50,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-06 05:34:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2024-11-06 05:34:50,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-06 05:34:50,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:50,312 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:50,325 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 (19)] Ended with exit code 0 [2024-11-06 05:34:50,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 [2024-11-06 05:34:50,513 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:50,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:50,513 INFO L85 PathProgramCache]: Analyzing trace with hash -277973087, now seen corresponding path program 1 times [2024-11-06 05:34:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:50,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420453189] [2024-11-06 05:34:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:34:50,514 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 [2024-11-06 05:34:50,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:50,516 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2024-11-06 05:34:50,518 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 (20)] Waiting until timeout for monitored process [2024-11-06 05:34:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:34:52,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 05:34:52,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 112 proven. 1 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-06 05:34:52,618 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-06 05:34:52,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420453189] [2024-11-06 05:34:52,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420453189] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:52,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:52,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-06 05:34:52,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757954983] [2024-11-06 05:34:52,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:52,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:34:52,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:52,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:34:52,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 05:34:52,658 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:52,705 INFO L93 Difference]: Finished difference Result 210 states and 236 transitions. [2024-11-06 05:34:52,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:34:52,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 162 [2024-11-06 05:34:52,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:52,706 INFO L225 Difference]: With dead ends: 210 [2024-11-06 05:34:52,706 INFO L226 Difference]: Without dead ends: 133 [2024-11-06 05:34:52,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:34:52,707 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 3 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:52,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 176 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:34:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-06 05:34:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-06 05:34:52,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 121 states have (on average 1.0578512396694215) internal successors, (128), 121 states have internal predecessors, (128), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2024-11-06 05:34:52,718 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 162 [2024-11-06 05:34:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:52,718 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2024-11-06 05:34:52,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:52,719 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2024-11-06 05:34:52,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-06 05:34:52,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:52,720 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:52,747 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 (20)] Ended with exit code 0 [2024-11-06 05:34:52,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 [2024-11-06 05:34:52,928 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:52,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:52,928 INFO L85 PathProgramCache]: Analyzing trace with hash -946222117, now seen corresponding path program 2 times [2024-11-06 05:34:52,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:52,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669185513] [2024-11-06 05:34:52,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 05:34:52,929 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 [2024-11-06 05:34:52,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:52,932 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2024-11-06 05:34:52,933 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 (21)] Waiting until timeout for monitored process [2024-11-06 05:34:55,955 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 05:34:55,956 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:56,004 INFO L255 TraceCheckSpWp]: Trace formula consists of 1332 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 05:34:56,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 112 proven. 16 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-06 05:34:56,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-11-06 05:34:56,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669185513] [2024-11-06 05:34:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669185513] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 05:34:56,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:34:56,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-06 05:34:56,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505708354] [2024-11-06 05:34:56,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:34:56,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:34:56,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:34:56,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:34:56,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:34:56,202 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:34:56,299 INFO L93 Difference]: Finished difference Result 224 states and 251 transitions. [2024-11-06 05:34:56,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:34:56,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2024-11-06 05:34:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:34:56,301 INFO L225 Difference]: With dead ends: 224 [2024-11-06 05:34:56,301 INFO L226 Difference]: Without dead ends: 141 [2024-11-06 05:34:56,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-06 05:34:56,302 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:34:56,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 305 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:34:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-06 05:34:56,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-06 05:34:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.054263565891473) internal successors, (136), 129 states have internal predecessors, (136), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-06 05:34:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2024-11-06 05:34:56,309 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 168 [2024-11-06 05:34:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:34:56,309 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2024-11-06 05:34:56,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 12 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-06 05:34:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2024-11-06 05:34:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-06 05:34:56,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:34:56,310 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:34:56,328 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 (21)] Ended with exit code 0 [2024-11-06 05:34:56,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 [2024-11-06 05:34:56,515 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:34:56,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:34:56,515 INFO L85 PathProgramCache]: Analyzing trace with hash 197516755, now seen corresponding path program 3 times [2024-11-06 05:34:56,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:34:56,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078795243] [2024-11-06 05:34:56,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:56,516 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 [2024-11-06 05:34:56,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:34:56,518 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2024-11-06 05:34:56,520 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 (22)] Waiting until timeout for monitored process [2024-11-06 05:34:57,989 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-06 05:34:57,989 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:34:58,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-06 05:34:58,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:34:58,872 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-06 05:34:58,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:34:58,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:34:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078795243] [2024-11-06 05:34:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078795243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 05:34:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1515389701] [2024-11-06 05:34:58,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-06 05:34:58,994 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-06 05:34:58,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-06 05:34:58,999 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-06 05:34:59,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2024-11-06 05:35:01,123 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-06 05:35:01,124 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:35:01,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 982 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-06 05:35:01,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:35:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 12 proven. 27 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2024-11-06 05:35:02,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:35:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1515389701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 05:35:02,475 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 05:35:02,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2024-11-06 05:35:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100084145] [2024-11-06 05:35:02,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 05:35:02,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 05:35:02,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:35:02,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 05:35:02,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-06 05:35:02,478 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand has 17 states, 15 states have (on average 5.8) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-06 05:35:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:35:03,277 INFO L93 Difference]: Finished difference Result 265 states and 291 transitions. [2024-11-06 05:35:03,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 05:35:03,277 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 5.8) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) Word has length 176 [2024-11-06 05:35:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:35:03,279 INFO L225 Difference]: With dead ends: 265 [2024-11-06 05:35:03,279 INFO L226 Difference]: Without dead ends: 263 [2024-11-06 05:35:03,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2024-11-06 05:35:03,280 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 73 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 05:35:03,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 450 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 05:35:03,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-06 05:35:03,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 226. [2024-11-06 05:35:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 1.0526315789473684) internal successors, (220), 209 states have internal predecessors, (220), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-06 05:35:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 250 transitions. [2024-11-06 05:35:03,300 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 250 transitions. Word has length 176 [2024-11-06 05:35:03,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:35:03,301 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 250 transitions. [2024-11-06 05:35:03,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 5.8) internal successors, (87), 17 states have internal predecessors, (87), 6 states have call successors, (20), 1 states have call predecessors, (20), 2 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2024-11-06 05:35:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 250 transitions. [2024-11-06 05:35:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-06 05:35:03,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:35:03,302 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:35:03,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Forceful destruction successful, exit code 0 [2024-11-06 05:35:03,518 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 (22)] Forceful destruction successful, exit code 0 [2024-11-06 05:35:03,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /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 [2024-11-06 05:35:03,711 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:35:03,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:35:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1897711676, now seen corresponding path program 4 times [2024-11-06 05:35:03,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:35:03,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624087481] [2024-11-06 05:35:03,713 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-06 05:35:03,713 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 [2024-11-06 05:35:03,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:35:03,716 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2024-11-06 05:35:03,716 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 (24)] Waiting until timeout for monitored process [2024-11-06 05:35:30,447 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-06 05:35:30,447 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 05:35:30,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 2266 conjuncts, 161 conjuncts are in the unsatisfiable core [2024-11-06 05:35:30,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:35:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 51 proven. 648 refuted. 0 times theorem prover too weak. 982 trivial. 0 not checked. [2024-11-06 05:35:38,936 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:35:44,763 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse2 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_87~0#1|)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_83~0#1|))) (or (forall ((|v_ULTIMATE.start_main_~var_105_arg_1~0#1_61| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_86_arg_1~0#1_61| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_113_arg_0~0#1_62| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_86_arg_1~0#1_61|) .cse1)))))))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_105_arg_1~0#1_61|))))))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_113_arg_0~0#1_62|)))))))) (= (_ bv0 32) .cse2) (let ((.cse8 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_15~0#1|))) (let ((.cse3 (bvsge ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_55~0#1|) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_27~0#1|)))))) (.cse4 (or .cse8 (forall ((|v_ULTIMATE.start_main_~var_98_arg_1~0#1_61| (_ BitVec 8))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_98_arg_1~0#1_61|))) .cse7)))))))) (.cse5 (not .cse8)) (.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse1))))) (and (or (not .cse3) (and .cse4 (or .cse5 (forall ((|v_ULTIMATE.start_main_~var_58_arg_0~0#1_59| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_92_arg_0~0#1_59| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_60_arg_1~0#1_59| (_ BitVec 8))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_58_arg_0~0#1_59|)))) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_60_arg_1~0#1_59|))))))) .cse0)))) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_92_arg_0~0#1_59|))))))) .cse2)))))))) .cse7))))))))) (or .cse3 (and .cse4 (or .cse5 (forall ((|v_ULTIMATE.start_main_~var_92_arg_0~0#1_59| (_ BitVec 8))) (not (= (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_92_arg_0~0#1_59|))))))) .cse2))))))) .cse7)))))))))))))) is different from false [2024-11-06 05:36:08,580 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 101 [2024-11-06 05:36:08,580 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-06 05:36:08,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:36:08,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624087481] [2024-11-06 05:36:08,581 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-06 05:36:08,651 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 (24)] Ended with exit code 0 [2024-11-06 05:36:08,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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 [2024-11-06 05:36:08,786 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:360) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-06 05:36:08,791 INFO L158 Benchmark]: Toolchain (without parser) took 101702.58ms. Allocated memory was 226.5MB in the beginning and 785.4MB in the end (delta: 558.9MB). Free memory was 160.1MB in the beginning and 558.2MB in the end (delta: -398.1MB). Peak memory consumption was 162.3MB. Max. memory is 8.0GB. [2024-11-06 05:36:08,791 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 226.5MB. Free memory is still 177.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-06 05:36:08,791 INFO L158 Benchmark]: CACSL2BoogieTranslator took 575.52ms. Allocated memory was 226.5MB in the beginning and 321.9MB in the end (delta: 95.4MB). Free memory was 159.9MB in the beginning and 265.3MB in the end (delta: -105.4MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. [2024-11-06 05:36:08,791 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.24ms. Allocated memory is still 321.9MB. Free memory was 265.3MB in the beginning and 258.0MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2024-11-06 05:36:08,792 INFO L158 Benchmark]: Boogie Preprocessor took 79.67ms. Allocated memory is still 321.9MB. Free memory was 258.0MB in the beginning and 248.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-11-06 05:36:08,792 INFO L158 Benchmark]: RCFGBuilder took 897.89ms. Allocated memory is still 321.9MB. Free memory was 248.6MB in the beginning and 208.4MB in the end (delta: 40.2MB). Peak memory consumption was 40.2MB. Max. memory is 8.0GB. [2024-11-06 05:36:08,792 INFO L158 Benchmark]: TraceAbstraction took 100062.17ms. Allocated memory was 321.9MB in the beginning and 785.4MB in the end (delta: 463.5MB). Free memory was 207.3MB in the beginning and 558.2MB in the end (delta: -350.9MB). Peak memory consumption was 113.1MB. Max. memory is 8.0GB. [2024-11-06 05:36:08,795 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.12ms. Allocated memory is still 226.5MB. Free memory is still 177.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 575.52ms. Allocated memory was 226.5MB in the beginning and 321.9MB in the end (delta: 95.4MB). Free memory was 159.9MB in the beginning and 265.3MB in the end (delta: -105.4MB). Peak memory consumption was 18.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 80.24ms. Allocated memory is still 321.9MB. Free memory was 265.3MB in the beginning and 258.0MB in the end (delta: 7.3MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 79.67ms. Allocated memory is still 321.9MB. Free memory was 258.0MB in the beginning and 248.6MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * RCFGBuilder took 897.89ms. Allocated memory is still 321.9MB. Free memory was 248.6MB in the beginning and 208.4MB in the end (delta: 40.2MB). Peak memory consumption was 40.2MB. Max. memory is 8.0GB. * TraceAbstraction took 100062.17ms. Allocated memory was 321.9MB in the beginning and 785.4MB in the end (delta: 463.5MB). Free memory was 207.3MB in the beginning and 558.2MB in the end (delta: -350.9MB). Peak memory consumption was 113.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...