/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/list-simple/sll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:44:02,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:44:02,750 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 21:44:02,755 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:44:02,755 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:44:02,790 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:44:02,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:44:02,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:44:02,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:44:02,795 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:44:02,796 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:44:02,796 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:44:02,797 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:44:02,798 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:44:02,798 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:44:02,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:44:02,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:44:02,799 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:44:02,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:44:02,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:44:02,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:44:02,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:44:02,802 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:44:02,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:44:02,802 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:44:02,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:44:02,803 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:44:02,803 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:44:02,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:44:02,803 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:44:02,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:44:02,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:44:02,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:44:02,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:44:02,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:44:02,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:44:02,805 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:44:02,805 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:44:02,806 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:44:02,806 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:44:02,806 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:44:02,806 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:44:02,806 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:44:02,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:44:02,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:44:02,807 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:44:02,807 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 21:44:03,059 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:44:03,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:44:03,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:44:03,094 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:44:03,095 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:44:03,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_remove_all.i [2023-12-24 21:44:04,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:44:04,547 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:44:04,547 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all.i [2023-12-24 21:44:04,559 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed35016e/73e8f462c88c41bbbddac223af0da48b/FLAG8d64600e8 [2023-12-24 21:44:04,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed35016e/73e8f462c88c41bbbddac223af0da48b [2023-12-24 21:44:04,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:44:04,576 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:44:04,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:44:04,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:44:04,581 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:44:04,582 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:44:04" (1/1) ... [2023-12-24 21:44:04,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50acc7fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:04, skipping insertion in model container [2023-12-24 21:44:04,583 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:44:04" (1/1) ... [2023-12-24 21:44:04,618 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:44:04,922 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all.i[23806,23819] [2023-12-24 21:44:04,926 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:44:04,942 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:44:04,985 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all.i[23806,23819] [2023-12-24 21:44:04,985 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:44:05,012 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:44:05,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05 WrapperNode [2023-12-24 21:44:05,013 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:44:05,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:44:05,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:44:05,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:44:05,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,040 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,059 INFO L138 Inliner]: procedures = 129, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2023-12-24 21:44:05,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:44:05,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:44:05,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:44:05,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:44:05,069 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,089 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 5, 4]. 45 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 4 writes are split as follows [0, 1, 3]. [2023-12-24 21:44:05,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,090 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,111 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,113 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,115 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:44:05,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:44:05,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:44:05,136 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:44:05,137 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (1/1) ... [2023-12-24 21:44:05,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:44:05,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:44:05,162 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 21:44:05,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 21:44:05,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:44:05,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:44:05,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-24 21:44:05,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:44:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:44:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-24 21:44:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:44:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:44:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-24 21:44:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:44:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 21:44:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 21:44:05,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 21:44:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:44:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:44:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-24 21:44:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:44:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:44:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 21:44:05,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:44:05,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:44:05,294 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:44:05,296 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:44:05,495 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:44:05,546 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:44:05,546 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-24 21:44:05,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:44:05 BoogieIcfgContainer [2023-12-24 21:44:05,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:44:05,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:44:05,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:44:05,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:44:05,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:44:04" (1/3) ... [2023-12-24 21:44:05,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df8a667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:44:05, skipping insertion in model container [2023-12-24 21:44:05,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:44:05" (2/3) ... [2023-12-24 21:44:05,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df8a667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:44:05, skipping insertion in model container [2023-12-24 21:44:05,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:44:05" (3/3) ... [2023-12-24 21:44:05,554 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.i [2023-12-24 21:44:05,571 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:44:05,571 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 21:44:05,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:44:05,623 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7275666b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:44:05,623 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 21:44:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:05,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-24 21:44:05,632 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:44:05,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:44:05,633 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:44:05,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:44:05,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1440775617, now seen corresponding path program 1 times [2023-12-24 21:44:05,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:44:05,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729755482] [2023-12-24 21:44:05,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:44:05,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:05,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:44:05,656 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:44:05,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 21:44:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:44:05,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:44:05,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:44:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:44:05,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:44:05,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:44:05,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729755482] [2023-12-24 21:44:05,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729755482] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:44:05,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:44:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:44:05,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181591084] [2023-12-24 21:44:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:44:05,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 21:44:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:44:05,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 21:44:05,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:44:05,863 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:44:05,963 INFO L93 Difference]: Finished difference Result 23 states and 33 transitions. [2023-12-24 21:44:05,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 21:44:05,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-24 21:44:05,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:44:05,971 INFO L225 Difference]: With dead ends: 23 [2023-12-24 21:44:05,971 INFO L226 Difference]: Without dead ends: 11 [2023-12-24 21:44:05,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 21:44:05,978 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:44:05,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 15 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:44:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-24 21:44:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2023-12-24 21:44:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2023-12-24 21:44:06,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 7 [2023-12-24 21:44:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:44:06,018 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2023-12-24 21:44:06,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:06,019 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2023-12-24 21:44:06,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-24 21:44:06,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:44:06,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:44:06,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:44:06,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:06,227 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:44:06,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:44:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash 265014835, now seen corresponding path program 1 times [2023-12-24 21:44:06,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:44:06,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421263211] [2023-12-24 21:44:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:44:06,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:06,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:44:06,230 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:44:06,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 21:44:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:44:06,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 21:44:06,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:44:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:44:06,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:44:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:44:06,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:44:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421263211] [2023-12-24 21:44:06,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421263211] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:44:06,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:44:06,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-24 21:44:06,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074268765] [2023-12-24 21:44:06,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:44:06,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 21:44:06,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:44:06,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 21:44:06,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:44:06,413 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:44:06,593 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2023-12-24 21:44:06,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:44:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-24 21:44:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:44:06,596 INFO L225 Difference]: With dead ends: 19 [2023-12-24 21:44:06,596 INFO L226 Difference]: Without dead ends: 13 [2023-12-24 21:44:06,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:44:06,597 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:44:06,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:44:06,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-24 21:44:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2023-12-24 21:44:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2023-12-24 21:44:06,602 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2023-12-24 21:44:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:44:06,603 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2023-12-24 21:44:06,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2023-12-24 21:44:06,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-24 21:44:06,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:44:06,605 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:44:06,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:44:06,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:06,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:44:06,809 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:44:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1147867865, now seen corresponding path program 2 times [2023-12-24 21:44:06,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:44:06,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742132878] [2023-12-24 21:44:06,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:44:06,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:06,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:44:06,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:44:06,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 21:44:06,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-24 21:44:06,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:44:06,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:44:06,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:44:06,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:44:06,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:44:06,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:44:06,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742132878] [2023-12-24 21:44:06,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742132878] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:44:06,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:44:06,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 21:44:06,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487982143] [2023-12-24 21:44:06,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:44:06,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:44:06,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:44:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:44:06,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:44:06,946 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:44:07,015 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-24 21:44:07,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:44:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-24 21:44:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:44:07,016 INFO L225 Difference]: With dead ends: 17 [2023-12-24 21:44:07,017 INFO L226 Difference]: Without dead ends: 13 [2023-12-24 21:44:07,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:44:07,018 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:44:07,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 11 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:44:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-24 21:44:07,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-24 21:44:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:07,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2023-12-24 21:44:07,023 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2023-12-24 21:44:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:44:07,024 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2023-12-24 21:44:07,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:07,024 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2023-12-24 21:44:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-24 21:44:07,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:44:07,025 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:44:07,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 21:44:07,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:07,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:44:07,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:44:07,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1196760683, now seen corresponding path program 1 times [2023-12-24 21:44:07,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:44:07,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102934296] [2023-12-24 21:44:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:44:07,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:07,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:44:07,231 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:44:07,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 21:44:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:44:07,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 21:44:07,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:44:07,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:44:07,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:44:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:44:07,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:44:07,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102934296] [2023-12-24 21:44:07,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102934296] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:44:07,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:44:07,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 21:44:07,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390968595] [2023-12-24 21:44:07,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:44:07,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:44:07,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:44:07,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:44:07,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:44:07,462 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:44:07,607 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2023-12-24 21:44:07,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:44:07,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-24 21:44:07,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:44:07,609 INFO L225 Difference]: With dead ends: 18 [2023-12-24 21:44:07,609 INFO L226 Difference]: Without dead ends: 14 [2023-12-24 21:44:07,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-24 21:44:07,610 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 8 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:44:07,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 21 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:44:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-24 21:44:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-24 21:44:07,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:07,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-24 21:44:07,614 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2023-12-24 21:44:07,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:44:07,614 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-24 21:44:07,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:07,614 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-24 21:44:07,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-24 21:44:07,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:44:07,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:44:07,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:44:07,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:07,816 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:44:07,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:44:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1582529255, now seen corresponding path program 2 times [2023-12-24 21:44:07,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:44:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087094113] [2023-12-24 21:44:07,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-24 21:44:07,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:07,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:44:07,819 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:44:07,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 21:44:07,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-24 21:44:07,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:44:07,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 42 conjunts are in the unsatisfiable core [2023-12-24 21:44:07,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:44:08,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:44:08,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:44:08,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 21:44:08,148 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:44:08,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-24 21:44:08,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 41 [2023-12-24 21:44:08,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-12-24 21:44:08,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2023-12-24 21:44:08,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2023-12-24 21:44:08,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 111 [2023-12-24 21:44:08,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 79 [2023-12-24 21:44:08,607 INFO L349 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2023-12-24 21:44:08,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 45 [2023-12-24 21:44:08,640 INFO L349 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2023-12-24 21:44:08,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 32 [2023-12-24 21:44:08,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:44:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-24 21:44:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:44:08,728 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:44:12,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 64 [2023-12-24 21:44:12,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2023-12-24 21:44:12,974 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:44:12,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2023-12-24 21:44:12,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 21:44:12,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2023-12-24 21:44:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-24 21:44:13,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:44:13,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087094113] [2023-12-24 21:44:13,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087094113] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:44:13,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:44:13,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2023-12-24 21:44:13,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000367939] [2023-12-24 21:44:13,536 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:44:13,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 21:44:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:44:13,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 21:44:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=205, Unknown=1, NotChecked=0, Total=240 [2023-12-24 21:44:13,539 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:44:14,984 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2023-12-24 21:44:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 21:44:14,984 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-24 21:44:14,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:44:14,985 INFO L225 Difference]: With dead ends: 25 [2023-12-24 21:44:14,985 INFO L226 Difference]: Without dead ends: 21 [2023-12-24 21:44:14,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=47, Invalid=294, Unknown=1, NotChecked=0, Total=342 [2023-12-24 21:44:14,986 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 21:44:14,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 61 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 21:44:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-24 21:44:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2023-12-24 21:44:14,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2023-12-24 21:44:14,992 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2023-12-24 21:44:14,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:44:14,992 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2023-12-24 21:44:14,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:14,992 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2023-12-24 21:44:14,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-24 21:44:14,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:44:14,993 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:44:15,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 21:44:15,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:15,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:44:15,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:44:15,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1841171413, now seen corresponding path program 3 times [2023-12-24 21:44:15,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:44:15,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465496992] [2023-12-24 21:44:15,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-24 21:44:15,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 [2023-12-24 21:44:15,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:44:15,202 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:44:15,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 21:44:15,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-24 21:44:15,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:44:15,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 21:44:15,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:44:15,400 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:44:15,400 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:44:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:44:15,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:44:15,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465496992] [2023-12-24 21:44:15,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465496992] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:44:15,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:44:15,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-24 21:44:15,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800068858] [2023-12-24 21:44:15,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:44:15,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 21:44:15,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:44:15,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 21:44:15,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-24 21:44:15,575 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:44:15,773 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2023-12-24 21:44:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:44:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-12-24 21:44:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:44:15,774 INFO L225 Difference]: With dead ends: 25 [2023-12-24 21:44:15,774 INFO L226 Difference]: Without dead ends: 16 [2023-12-24 21:44:15,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-12-24 21:44:15,775 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:44:15,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 22 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:44:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-24 21:44:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-24 21:44:15,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2023-12-24 21:44:15,780 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2023-12-24 21:44:15,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:44:15,780 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2023-12-24 21:44:15,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2023-12-24 21:44:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-24 21:44:15,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:44:15,781 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:44:15,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 21:44:15,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:15,982 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:44:15,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:44:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1312030757, now seen corresponding path program 4 times [2023-12-24 21:44:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:44:15,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487003398] [2023-12-24 21:44:15,983 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-24 21:44:15,983 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:15,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:44:15,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:44:15,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 (8)] Waiting until timeout for monitored process [2023-12-24 21:44:16,124 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-24 21:44:16,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-24 21:44:16,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 21:44:16,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:44:16,157 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:44:16,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 21:44:16,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-24 21:44:16,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:44:16,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487003398] [2023-12-24 21:44:16,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [487003398] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 21:44:16,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 21:44:16,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-24 21:44:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849302562] [2023-12-24 21:44:16,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 21:44:16,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 21:44:16,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:44:16,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 21:44:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:44:16,207 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:16,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:44:16,338 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2023-12-24 21:44:16,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 21:44:16,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-24 21:44:16,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:44:16,341 INFO L225 Difference]: With dead ends: 16 [2023-12-24 21:44:16,342 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 21:44:16,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-24 21:44:16,342 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:44:16,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:44:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 21:44:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 21:44:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:16,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 21:44:16,343 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2023-12-24 21:44:16,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:44:16,344 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 21:44:16,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 21:44:16,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 21:44:16,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 21:44:16,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 21:44:16,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 21:44:16,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:44:16,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 21:44:16,680 INFO L899 garLoopResultBuilder]: For program point L576(lines 576 578) no Hoare annotation was computed. [2023-12-24 21:44:16,680 INFO L899 garLoopResultBuilder]: For program point L605(lines 605 607) no Hoare annotation was computed. [2023-12-24 21:44:16,680 INFO L899 garLoopResultBuilder]: For program point L572(line 572) no Hoare annotation was computed. [2023-12-24 21:44:16,681 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 597 611) no Hoare annotation was computed. [2023-12-24 21:44:16,681 INFO L895 garLoopResultBuilder]: At program point L585-3(lines 585 589) the Hoare annotation is: (let ((.cse4 (bvadd |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv4 32)))) (let ((.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse4)) (.cse0 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse1 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_sll_create_~head~0#1.base|) .cse4))) (or (and (= |ULTIMATE.start_sll_create_~head~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32)) (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32)) .cse0) (and (= .cse1 (_ bv0 32)) (= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_sll_create_~head~0#1.base|)) (_ bv0 1)) (= |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (= .cse2 (_ bv0 32)) .cse0) (let ((.cse3 (bvadd (_ bv4 32) .cse1))) (and (= (select (select |#memory_$Pointer$#2.base| .cse2) .cse3) (_ bv0 32)) (= |ULTIMATE.start_sll_create_~len#1| (_ bv0 32)) (= (select (select |#memory_$Pointer$#2.offset| .cse2) .cse3) (_ bv0 32)) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| .cse2)) .cse0))))) [2023-12-24 21:44:16,681 INFO L899 garLoopResultBuilder]: For program point L585-4(lines 585 589) no Hoare annotation was computed. [2023-12-24 21:44:16,681 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 609) no Hoare annotation was computed. [2023-12-24 21:44:16,681 INFO L895 garLoopResultBuilder]: At program point L602-3(lines 602 604) the Hoare annotation is: (let ((.cse5 (select (select |#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse2 (select (select |#memory_$Pointer$#1.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (bvadd .cse5 (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$#2.base| .cse2) .cse8)) (.cse3 (= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)) (.cse4 (select (select |#memory_$Pointer$#2.offset| .cse2) .cse8))) (or (let ((.cse1 (bvadd (_ bv4 32) .cse4))) (and (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) (_ bv0 32)) (not (= .cse0 .cse2)) (= (select (select |#memory_$Pointer$#2.base| .cse0) .cse1) (_ bv0 32)) .cse3)) (and (= (_ bv0 32) .cse2) (= .cse5 (_ bv0 32)) .cse3 (= (bvadd |ULTIMATE.start_main_~i~0#1| (_ bv1 32)) (_ bv0 32))) (and (= .cse0 (_ bv0 32)) (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (exists ((v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_5 (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) v_arrayElimCell_6))) (let ((.cse7 (select (select |#memory_$Pointer$#2.base| v_arrayElimCell_5) .cse6))) (and (= .cse5 (select (select |#memory_$Pointer$#2.offset| v_arrayElimCell_5) .cse6)) (= .cse7 .cse2) (not (= .cse7 v_arrayElimCell_5)))))) .cse3 (= (_ bv0 32) .cse4)))))) [2023-12-24 21:44:16,681 INFO L899 garLoopResultBuilder]: For program point L602-4(lines 602 604) no Hoare annotation was computed. [2023-12-24 21:44:16,682 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 21:44:16,682 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 21:44:16,682 INFO L899 garLoopResultBuilder]: For program point main_ERROR#1(lines 597 611) no Hoare annotation was computed. [2023-12-24 21:44:16,684 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1] [2023-12-24 21:44:16,686 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:44:16,697 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)]][~bvadd~32(4bv32, #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)])] could not be translated [2023-12-24 21:44:16,698 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)] could not be translated [2023-12-24 21:44:16,698 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:44:16,698 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)]][~bvadd~32(4bv32, #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)])] could not be translated [2023-12-24 21:44:16,699 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:44:16,699 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated [2023-12-24 21:44:16,699 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)] could not be translated [2023-12-24 21:44:16,699 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_6 : bv32, v_arrayElimCell_5 : bv32 :: (#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] == #memory_$Pointer$#2.offset[v_arrayElimCell_5][~bvadd~32(4bv32, v_arrayElimCell_6)] && #memory_$Pointer$#2.base[v_arrayElimCell_5][~bvadd~32(4bv32, v_arrayElimCell_6)] == #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]) && !(#memory_$Pointer$#2.base[v_arrayElimCell_5][~bvadd~32(4bv32, v_arrayElimCell_6)] == v_arrayElimCell_5)) could not be translated [2023-12-24 21:44:16,699 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)] could not be translated [2023-12-24 21:44:16,701 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)] could not be translated [2023-12-24 21:44:16,701 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated [2023-12-24 21:44:16,702 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)] could not be translated [2023-12-24 21:44:16,702 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)]][~bvadd~32(4bv32, #memory_$Pointer$#2.offset[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)])] could not be translated [2023-12-24 21:44:16,702 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)]][~bvadd~32(4bv32, #memory_$Pointer$#2.offset[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)])] could not be translated [2023-12-24 21:44:16,702 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)] could not be translated [2023-12-24 21:44:16,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:44:16 BoogieIcfgContainer [2023-12-24 21:44:16,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:44:16,703 INFO L158 Benchmark]: Toolchain (without parser) took 12127.13ms. Allocated memory is still 224.4MB. Free memory was 173.4MB in the beginning and 158.8MB in the end (delta: 14.7MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2023-12-24 21:44:16,703 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory was 123.6MB in the beginning and 123.5MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:44:16,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.46ms. Allocated memory is still 224.4MB. Free memory was 172.9MB in the beginning and 154.5MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 21:44:16,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.22ms. Allocated memory is still 224.4MB. Free memory was 154.5MB in the beginning and 152.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:44:16,704 INFO L158 Benchmark]: Boogie Preprocessor took 70.18ms. Allocated memory is still 224.4MB. Free memory was 152.4MB in the beginning and 149.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 21:44:16,704 INFO L158 Benchmark]: RCFGBuilder took 416.17ms. Allocated memory is still 224.4MB. Free memory was 149.3MB in the beginning and 130.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 21:44:16,704 INFO L158 Benchmark]: TraceAbstraction took 11153.52ms. Allocated memory is still 224.4MB. Free memory was 129.9MB in the beginning and 158.8MB in the end (delta: -28.9MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:44:16,705 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.16ms. Allocated memory is still 176.2MB. Free memory was 123.6MB in the beginning and 123.5MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 436.46ms. Allocated memory is still 224.4MB. Free memory was 172.9MB in the beginning and 154.5MB in the end (delta: 18.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.22ms. Allocated memory is still 224.4MB. Free memory was 154.5MB in the beginning and 152.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.18ms. Allocated memory is still 224.4MB. Free memory was 152.4MB in the beginning and 149.3MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 416.17ms. Allocated memory is still 224.4MB. Free memory was 149.3MB in the beginning and 130.4MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 11153.52ms. Allocated memory is still 224.4MB. Free memory was 129.9MB in the beginning and 158.8MB in the end (delta: -28.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)]][~bvadd~32(4bv32, #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)])] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)]][~bvadd~32(4bv32, #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)])] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_6 : bv32, v_arrayElimCell_5 : bv32 :: (#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset] == #memory_$Pointer$#2.offset[v_arrayElimCell_5][~bvadd~32(4bv32, v_arrayElimCell_6)] && #memory_$Pointer$#2.base[v_arrayElimCell_5][~bvadd~32(4bv32, v_arrayElimCell_6)] == #memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]) && !(#memory_$Pointer$#2.base[v_arrayElimCell_5][~bvadd~32(4bv32, v_arrayElimCell_6)] == v_arrayElimCell_5)) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#1.base[~#s~0!base][~#s~0!offset]][~bvadd~32(#memory_$Pointer$#1.offset[~#s~0!base][~#s~0!offset], 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #valid[~head~0!base] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[#memory_$Pointer$#2.base[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)]][~bvadd~32(4bv32, #memory_$Pointer$#2.offset[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)])] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.offset[#memory_$Pointer$#2.base[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)]][~bvadd~32(4bv32, #memory_$Pointer$#2.offset[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)])] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_$Pointer$#2.base[~head~0!base][~bvadd~32(~head~0!offset, 4bv32)] could not be translated * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 609]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 220 IncrementalHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 36 mSDtfsCounter, 220 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 141 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 8 NumberOfFragments, 311 HoareAnnotationTreeSize, 2 FormulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FormulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 81 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 132 ConstructedInterpolants, 3 QuantifiedInterpolants, 1063 SizeOfPredicates, 29 NumberOfNonLiveVariables, 780 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 39/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 602]: Loop Invariant Derived loop invariant: ((((i == 1) && (2 == len)) || ((2 == len) && (((i + 1) % 4294967296) == 0))) || ((i == 0) && (2 == len))) - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((((len == 2) && (2 == len)) || ((len == 1) && (2 == len))) || ((len == 0) && (2 == len))) RESULT: Ultimate proved your program to be correct! [2023-12-24 21:44:16,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...