/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-ext3-properties/sll_nondet_insert-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:23:21,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:23:21,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 16:23:21,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:23:21,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:23:21,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:23:21,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:23:21,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:23:21,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:23:21,656 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:23:21,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:23:21,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:23:21,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:23:21,658 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:23:21,658 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:23:21,658 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:23:21,658 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:23:21,659 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:23:21,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:23:21,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:23:21,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:23:21,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:23:21,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:23:21,660 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:23:21,660 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:23:21,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:23:21,660 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:23:21,660 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:23:21,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:23:21,660 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:23:21,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:23:21,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:23:21,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:23:21,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:23:21,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:23:21,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:23:21,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:23:21,662 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:23:21,663 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:23:21,663 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:23:21,663 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:23:21,663 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:23:21,663 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:23:21,663 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:23:21,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:23:21,664 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:23:21,664 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 16:23:21,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:23:21,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:23:21,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:23:21,882 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:23:21,883 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:23:21,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-1.i [2023-12-16 16:23:22,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:23:23,043 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:23:23,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert-1.i [2023-12-16 16:23:23,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d2e8094/ca1aa2fd555249dbac85d112cf09b252/FLAGda7e7aab1 [2023-12-16 16:23:23,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82d2e8094/ca1aa2fd555249dbac85d112cf09b252 [2023-12-16 16:23:23,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:23:23,067 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:23:23,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:23:23,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:23:23,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:23:23,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,073 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53142b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23, skipping insertion in model container [2023-12-16 16:23:23,073 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,106 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:23:23,280 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-ext3-properties/sll_nondet_insert-1.i[24521,24534] [2023-12-16 16:23:23,284 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:23:23,292 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:23:23,344 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-ext3-properties/sll_nondet_insert-1.i[24521,24534] [2023-12-16 16:23:23,345 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:23:23,370 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:23:23,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23 WrapperNode [2023-12-16 16:23:23,370 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:23:23,371 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:23:23,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:23:23,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:23:23,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,404 INFO L138 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 136 [2023-12-16 16:23:23,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:23:23,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:23:23,405 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:23:23,405 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:23:23,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,424 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,436 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 5, 6]. 46 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-16 16:23:23,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,436 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,443 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:23:23,452 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:23:23,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:23:23,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:23:23,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (1/1) ... [2023-12-16 16:23:23,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:23:23,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:23:23,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 16:23:23,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 16:23:23,501 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-12-16 16:23:23,502 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-12-16 16:23:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 16:23:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2023-12-16 16:23:23,502 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2023-12-16 16:23:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:23:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-16 16:23:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 16:23:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 16:23:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 16:23:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 16:23:23,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 16:23:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 16:23:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-16 16:23:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-16 16:23:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-16 16:23:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-12-16 16:23:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:23:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 16:23:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 16:23:23,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:23:23,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:23:23,598 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:23:23,600 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:23:23,622 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-12-16 16:23:23,823 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:23:23,850 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:23:23,850 INFO L309 CfgBuilder]: Removed 6 assume(true) statements. [2023-12-16 16:23:23,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:23:23 BoogieIcfgContainer [2023-12-16 16:23:23,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:23:23,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:23:23,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:23:23,854 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:23:23,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:23:23" (1/3) ... [2023-12-16 16:23:23,855 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e06e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:23:23, skipping insertion in model container [2023-12-16 16:23:23,855 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:23:23" (2/3) ... [2023-12-16 16:23:23,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22e06e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:23:23, skipping insertion in model container [2023-12-16 16:23:23,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:23:23" (3/3) ... [2023-12-16 16:23:23,857 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2023-12-16 16:23:23,869 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:23:23,869 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:23:23,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:23:23,914 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;@453f5de6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:23:23,914 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:23:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 36 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:23:23,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-16 16:23:23,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:23,924 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:23,924 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:23,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:23,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1925725124, now seen corresponding path program 1 times [2023-12-16 16:23:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484148004] [2023-12-16 16:23:23,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:23:23,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:23,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:23,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:23,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 16:23:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:23:24,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 16:23:24,062 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:24,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:23:24,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:23:24,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:24,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484148004] [2023-12-16 16:23:24,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484148004] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:23:24,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:23:24,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 16:23:24,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658711961] [2023-12-16 16:23:24,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:23:24,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 16:23:24,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:24,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 16:23:24,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:23:24,112 INFO L87 Difference]: Start difference. First operand has 42 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 36 states have internal predecessors, (53), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:23:24,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:23:24,137 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2023-12-16 16:23:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 16:23:24,140 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-12-16 16:23:24,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:23:24,144 INFO L225 Difference]: With dead ends: 82 [2023-12-16 16:23:24,144 INFO L226 Difference]: Without dead ends: 34 [2023-12-16 16:23:24,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 16:23:24,149 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:23:24,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:23:24,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-16 16:23:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-16 16:23:24,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:23:24,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2023-12-16 16:23:24,172 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 21 [2023-12-16 16:23:24,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:23:24,172 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2023-12-16 16:23:24,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:23:24,172 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2023-12-16 16:23:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 16:23:24,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:24,173 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:24,181 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 16:23:24,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:24,377 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:24,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:24,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1034308714, now seen corresponding path program 1 times [2023-12-16 16:23:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:24,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780523661] [2023-12-16 16:23:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:23:24,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:24,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:24,381 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:24,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 16:23:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:23:24,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:23:24,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:23:24,537 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:23:24,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:24,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780523661] [2023-12-16 16:23:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780523661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:23:24,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:23:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:23:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330125542] [2023-12-16 16:23:24,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:23:24,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:23:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:24,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:23:24,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:23:24,543 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:23:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:23:24,651 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2023-12-16 16:23:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 16:23:24,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-12-16 16:23:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:23:24,655 INFO L225 Difference]: With dead ends: 69 [2023-12-16 16:23:24,655 INFO L226 Difference]: Without dead ends: 42 [2023-12-16 16:23:24,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-16 16:23:24,658 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:23:24,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 178 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:23:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-16 16:23:24,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-16 16:23:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 16:23:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2023-12-16 16:23:24,670 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 28 [2023-12-16 16:23:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:23:24,671 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2023-12-16 16:23:24,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:23:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2023-12-16 16:23:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-16 16:23:24,672 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:24,672 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:24,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:24,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:24,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:24,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:24,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1384952166, now seen corresponding path program 1 times [2023-12-16 16:23:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:24,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878422568] [2023-12-16 16:23:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:23:24,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:24,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:24,881 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:24,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 16:23:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:23:24,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 16:23:24,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:23:25,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:23:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:23:25,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:25,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878422568] [2023-12-16 16:23:25,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878422568] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:23:25,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:23:25,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 16:23:25,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743729182] [2023-12-16 16:23:25,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:23:25,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:23:25,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:25,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:23:25,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:23:25,230 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:23:25,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:23:25,577 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2023-12-16 16:23:25,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 16:23:25,578 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2023-12-16 16:23:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:23:25,579 INFO L225 Difference]: With dead ends: 118 [2023-12-16 16:23:25,580 INFO L226 Difference]: Without dead ends: 86 [2023-12-16 16:23:25,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2023-12-16 16:23:25,581 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 50 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:23:25,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 405 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:23:25,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-16 16:23:25,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2023-12-16 16:23:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-16 16:23:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2023-12-16 16:23:25,589 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 31 [2023-12-16 16:23:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:23:25,589 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2023-12-16 16:23:25,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:23:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2023-12-16 16:23:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 16:23:25,590 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:25,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:25,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:25,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:25,794 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:25,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:25,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1452360817, now seen corresponding path program 1 times [2023-12-16 16:23:25,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:25,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707359952] [2023-12-16 16:23:25,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:23:25,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:25,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:25,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:25,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:23:25,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:23:25,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 16:23:25,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:23:25,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:23:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:23:26,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:26,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707359952] [2023-12-16 16:23:26,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707359952] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:23:26,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:23:26,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 16:23:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636130945] [2023-12-16 16:23:26,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:23:26,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:23:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:26,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:23:26,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:23:26,102 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:23:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:23:26,343 INFO L93 Difference]: Finished difference Result 132 states and 183 transitions. [2023-12-16 16:23:26,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 16:23:26,344 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-12-16 16:23:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:23:26,345 INFO L225 Difference]: With dead ends: 132 [2023-12-16 16:23:26,345 INFO L226 Difference]: Without dead ends: 89 [2023-12-16 16:23:26,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:23:26,346 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 20 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:23:26,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 326 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:23:26,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-12-16 16:23:26,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 58. [2023-12-16 16:23:26,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2023-12-16 16:23:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2023-12-16 16:23:26,353 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 32 [2023-12-16 16:23:26,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:23:26,353 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2023-12-16 16:23:26,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:23:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2023-12-16 16:23:26,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 16:23:26,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:26,354 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:26,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:26,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:26,558 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:26,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:26,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1851596552, now seen corresponding path program 2 times [2023-12-16 16:23:26,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:26,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615081034] [2023-12-16 16:23:26,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:23:26,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:26,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:26,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:26,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 16:23:26,628 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:23:26,628 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:23:26,630 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:23:26,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:26,718 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 16 treesize of output 8 [2023-12-16 16:23:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:23:26,725 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:23:26,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:26,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615081034] [2023-12-16 16:23:26,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615081034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:23:26,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:23:26,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:23:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960193677] [2023-12-16 16:23:26,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:23:26,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:23:26,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:26,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:23:26,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:23:26,727 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:23:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:23:26,852 INFO L93 Difference]: Finished difference Result 112 states and 151 transitions. [2023-12-16 16:23:26,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:23:26,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2023-12-16 16:23:26,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:23:26,853 INFO L225 Difference]: With dead ends: 112 [2023-12-16 16:23:26,853 INFO L226 Difference]: Without dead ends: 108 [2023-12-16 16:23:26,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:23:26,854 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 41 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:23:26,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 187 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:23:26,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-16 16:23:26,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 83. [2023-12-16 16:23:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.3150684931506849) internal successors, (96), 73 states have internal predecessors, (96), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2023-12-16 16:23:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2023-12-16 16:23:26,862 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 36 [2023-12-16 16:23:26,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:23:26,863 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2023-12-16 16:23:26,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 16:23:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2023-12-16 16:23:26,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 16:23:26,863 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:26,864 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:26,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:27,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:27,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:27,068 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1565485831, now seen corresponding path program 1 times [2023-12-16 16:23:27,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:27,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450858301] [2023-12-16 16:23:27,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:23:27,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:27,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:27,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:27,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 16:23:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:23:27,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 16:23:27,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-16 16:23:27,196 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:23:27,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:27,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450858301] [2023-12-16 16:23:27,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450858301] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:23:27,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:23:27,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 16:23:27,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768948314] [2023-12-16 16:23:27,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:23:27,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 16:23:27,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:27,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 16:23:27,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:23:27,201 INFO L87 Difference]: Start difference. First operand 83 states and 112 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:23:27,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:23:27,286 INFO L93 Difference]: Finished difference Result 168 states and 228 transitions. [2023-12-16 16:23:27,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 16:23:27,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2023-12-16 16:23:27,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:23:27,287 INFO L225 Difference]: With dead ends: 168 [2023-12-16 16:23:27,287 INFO L226 Difference]: Without dead ends: 108 [2023-12-16 16:23:27,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:23:27,288 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:23:27,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 166 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:23:27,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-16 16:23:27,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2023-12-16 16:23:27,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 5 states have call successors, (5), 2 states have call predecessors, (5), 6 states have return successors, (16), 9 states have call predecessors, (16), 5 states have call successors, (16) [2023-12-16 16:23:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 132 transitions. [2023-12-16 16:23:27,297 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 132 transitions. Word has length 37 [2023-12-16 16:23:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:23:27,297 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 132 transitions. [2023-12-16 16:23:27,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-16 16:23:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 132 transitions. [2023-12-16 16:23:27,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 16:23:27,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:27,298 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:27,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:27,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:27,502 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:27,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:27,503 INFO L85 PathProgramCache]: Analyzing trace with hash 756139205, now seen corresponding path program 1 times [2023-12-16 16:23:27,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:27,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1616017937] [2023-12-16 16:23:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:23:27,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:27,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:27,504 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:27,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 16:23:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:23:27,580 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 16:23:27,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:27,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 1 [2023-12-16 16:23:27,690 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 24 treesize of output 16 [2023-12-16 16:23:27,692 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 20 treesize of output 12 [2023-12-16 16:23:27,714 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 16 treesize of output 8 [2023-12-16 16:23:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:23:27,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:23:27,746 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 25 treesize of output 17 [2023-12-16 16:23:27,749 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 21 treesize of output 13 [2023-12-16 16:23:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:23:27,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:27,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1616017937] [2023-12-16 16:23:27,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1616017937] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:23:27,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:23:27,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2023-12-16 16:23:27,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410716378] [2023-12-16 16:23:27,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:23:27,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 16:23:27,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:27,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 16:23:27,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-16 16:23:27,765 INFO L87 Difference]: Start difference. First operand 98 states and 132 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 16:23:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:23:28,049 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2023-12-16 16:23:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 16:23:28,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2023-12-16 16:23:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:23:28,050 INFO L225 Difference]: With dead ends: 146 [2023-12-16 16:23:28,050 INFO L226 Difference]: Without dead ends: 142 [2023-12-16 16:23:28,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:23:28,051 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:23:28,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 284 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:23:28,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-16 16:23:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 128. [2023-12-16 16:23:28,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 112 states have (on average 1.2857142857142858) internal successors, (144), 113 states have internal predecessors, (144), 7 states have call successors, (7), 3 states have call predecessors, (7), 8 states have return successors, (20), 11 states have call predecessors, (20), 7 states have call successors, (20) [2023-12-16 16:23:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 171 transitions. [2023-12-16 16:23:28,062 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 171 transitions. Word has length 37 [2023-12-16 16:23:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:23:28,063 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 171 transitions. [2023-12-16 16:23:28,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-16 16:23:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 171 transitions. [2023-12-16 16:23:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 16:23:28,064 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:28,064 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:28,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:28,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:28,267 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:28,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1966046442, now seen corresponding path program 2 times [2023-12-16 16:23:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [79471594] [2023-12-16 16:23:28,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:23:28,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:28,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:28,269 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:28,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 16:23:28,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:23:28,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:23:28,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-16 16:23:28,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-12-16 16:23:28,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:23:28,842 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-16 16:23:28,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:28,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [79471594] [2023-12-16 16:23:28,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [79471594] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:23:28,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:23:28,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2023-12-16 16:23:28,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391009948] [2023-12-16 16:23:28,842 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:23:28,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-16 16:23:28,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:28,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-16 16:23:28,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-12-16 16:23:28,843 INFO L87 Difference]: Start difference. First operand 128 states and 171 transitions. Second operand has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:23:29,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:23:29,172 INFO L93 Difference]: Finished difference Result 220 states and 294 transitions. [2023-12-16 16:23:29,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 16:23:29,173 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2023-12-16 16:23:29,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:23:29,174 INFO L225 Difference]: With dead ends: 220 [2023-12-16 16:23:29,174 INFO L226 Difference]: Without dead ends: 216 [2023-12-16 16:23:29,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2023-12-16 16:23:29,175 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 66 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:23:29,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 502 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:23:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-12-16 16:23:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 147. [2023-12-16 16:23:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 130 states have (on average 1.2538461538461538) internal successors, (163), 130 states have internal predecessors, (163), 8 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (22), 13 states have call predecessors, (22), 8 states have call successors, (22) [2023-12-16 16:23:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 193 transitions. [2023-12-16 16:23:29,186 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 193 transitions. Word has length 38 [2023-12-16 16:23:29,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:23:29,187 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 193 transitions. [2023-12-16 16:23:29,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:23:29,187 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 193 transitions. [2023-12-16 16:23:29,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 16:23:29,188 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:29,188 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:29,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:29,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:29,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:29,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash 818465125, now seen corresponding path program 3 times [2023-12-16 16:23:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [995260626] [2023-12-16 16:23:29,393 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:23:29,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:29,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:29,394 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:29,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 16:23:29,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-16 16:23:29,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:23:29,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-16 16:23:29,487 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:29,516 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-16 16:23:29,519 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-16 16:23:29,577 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-12-16 16:23:29,578 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 1 case distinctions, treesize of input 23 treesize of output 22 [2023-12-16 16:23:29,597 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2023-12-16 16:23:29,598 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 1 case distinctions, treesize of input 27 treesize of output 23 [2023-12-16 16:23:30,001 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 65 treesize of output 41 [2023-12-16 16:23:30,169 INFO L349 Elim1Store]: treesize reduction 20, result has 67.2 percent of original size [2023-12-16 16:23:30,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 96 [2023-12-16 16:23:30,435 INFO L349 Elim1Store]: treesize reduction 66, result has 32.0 percent of original size [2023-12-16 16:23:30,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 69 [2023-12-16 16:23:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:23:30,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:23:30,721 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 151 treesize of output 111 [2023-12-16 16:23:30,725 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 115 treesize of output 75 [2023-12-16 16:23:44,148 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:23:44,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 456 treesize of output 400 [2023-12-16 16:23:44,173 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 16:23:44,266 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 16:23:44,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 16:23:44,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 359 treesize of output 352 [2023-12-16 16:23:44,409 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 16:23:44,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:44,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [995260626] [2023-12-16 16:23:44,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [995260626] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:23:44,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:23:44,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2023-12-16 16:23:44,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043870794] [2023-12-16 16:23:44,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:23:44,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 16:23:44,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:44,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 16:23:44,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=328, Unknown=1, NotChecked=0, Total=380 [2023-12-16 16:23:44,410 INFO L87 Difference]: Start difference. First operand 147 states and 193 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:23:49,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 16:23:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:23:56,933 INFO L93 Difference]: Finished difference Result 236 states and 309 transitions. [2023-12-16 16:23:56,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 16:23:56,934 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2023-12-16 16:23:56,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:23:56,935 INFO L225 Difference]: With dead ends: 236 [2023-12-16 16:23:56,936 INFO L226 Difference]: Without dead ends: 232 [2023-12-16 16:23:56,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=156, Invalid=965, Unknown=1, NotChecked=0, Total=1122 [2023-12-16 16:23:56,938 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 72 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-12-16 16:23:56,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 566 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 443 Invalid, 1 Unknown, 0 Unchecked, 9.3s Time] [2023-12-16 16:23:56,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-12-16 16:23:56,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 200. [2023-12-16 16:23:56,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 178 states have (on average 1.2640449438202248) internal successors, (225), 179 states have internal predecessors, (225), 11 states have call successors, (11), 4 states have call predecessors, (11), 10 states have return successors, (28), 16 states have call predecessors, (28), 11 states have call successors, (28) [2023-12-16 16:23:56,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 264 transitions. [2023-12-16 16:23:56,964 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 264 transitions. Word has length 39 [2023-12-16 16:23:56,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:23:56,964 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 264 transitions. [2023-12-16 16:23:56,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:23:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 264 transitions. [2023-12-16 16:23:56,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 16:23:56,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:23:56,970 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:23:56,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 16:23:57,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:57,172 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:23:57,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:23:57,174 INFO L85 PathProgramCache]: Analyzing trace with hash -2016998626, now seen corresponding path program 1 times [2023-12-16 16:23:57,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:23:57,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957235623] [2023-12-16 16:23:57,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:23:57,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:23:57,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:23:57,176 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:23:57,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 16:23:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:23:57,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 16:23:57,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:23:57,521 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:23:57,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:23:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:23:58,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:23:58,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957235623] [2023-12-16 16:23:58,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957235623] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:23:58,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:23:58,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-16 16:23:58,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239317710] [2023-12-16 16:23:58,271 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:23:58,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 16:23:58,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:23:58,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 16:23:58,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:23:58,272 INFO L87 Difference]: Start difference. First operand 200 states and 264 transitions. Second operand has 18 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:24:00,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:00,418 INFO L93 Difference]: Finished difference Result 466 states and 656 transitions. [2023-12-16 16:24:00,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-16 16:24:00,419 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2023-12-16 16:24:00,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:00,420 INFO L225 Difference]: With dead ends: 466 [2023-12-16 16:24:00,420 INFO L226 Difference]: Without dead ends: 339 [2023-12-16 16:24:00,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2023-12-16 16:24:00,421 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 75 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:24:00,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 572 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 16:24:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-12-16 16:24:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 223. [2023-12-16 16:24:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 200 states have (on average 1.26) internal successors, (252), 201 states have internal predecessors, (252), 11 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (31), 17 states have call predecessors, (31), 11 states have call successors, (31) [2023-12-16 16:24:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 294 transitions. [2023-12-16 16:24:00,441 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 294 transitions. Word has length 39 [2023-12-16 16:24:00,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:00,441 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 294 transitions. [2023-12-16 16:24:00,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.625) internal successors, (58), 16 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:24:00,441 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 294 transitions. [2023-12-16 16:24:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 16:24:00,442 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:00,442 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:00,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:00,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:00,646 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:00,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:00,646 INFO L85 PathProgramCache]: Analyzing trace with hash -396817334, now seen corresponding path program 4 times [2023-12-16 16:24:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60622741] [2023-12-16 16:24:00,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:24:00,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:00,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:00,648 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:00,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 16:24:00,724 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:24:00,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:24:00,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-16 16:24:00,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:00,775 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-16 16:24:00,835 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-16 16:24:00,847 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-16 16:24:00,939 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-16 16:24:00,939 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-16 16:24:01,016 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 31 treesize of output 19 [2023-12-16 16:24:01,034 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 31 treesize of output 19 [2023-12-16 16:24:01,559 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 90 treesize of output 62 [2023-12-16 16:24:01,570 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 66 treesize of output 42 [2023-12-16 16:24:01,858 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:24:01,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:02,248 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 72 treesize of output 52 [2023-12-16 16:24:02,254 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 56 treesize of output 36 [2023-12-16 16:24:11,074 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-16 16:24:12,241 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-16 16:24:12,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:12,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60622741] [2023-12-16 16:24:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60622741] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:12,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2023-12-16 16:24:12,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152293083] [2023-12-16 16:24:12,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:12,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-16 16:24:12,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:12,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-16 16:24:12,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=296, Unknown=2, NotChecked=0, Total=342 [2023-12-16 16:24:12,242 INFO L87 Difference]: Start difference. First operand 223 states and 294 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:24:18,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 16:24:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:18,550 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2023-12-16 16:24:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 16:24:18,552 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 40 [2023-12-16 16:24:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:18,554 INFO L225 Difference]: With dead ends: 244 [2023-12-16 16:24:18,554 INFO L226 Difference]: Without dead ends: 228 [2023-12-16 16:24:18,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=70, Invalid=434, Unknown=2, NotChecked=0, Total=506 [2023-12-16 16:24:18,556 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-16 16:24:18,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 542 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2023-12-16 16:24:18,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-12-16 16:24:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 214. [2023-12-16 16:24:18,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 191 states have (on average 1.2670157068062826) internal successors, (242), 193 states have internal predecessors, (242), 11 states have call successors, (11), 4 states have call predecessors, (11), 11 states have return successors, (30), 16 states have call predecessors, (30), 11 states have call successors, (30) [2023-12-16 16:24:18,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 283 transitions. [2023-12-16 16:24:18,574 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 283 transitions. Word has length 40 [2023-12-16 16:24:18,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:18,574 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 283 transitions. [2023-12-16 16:24:18,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-16 16:24:18,575 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 283 transitions. [2023-12-16 16:24:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 16:24:18,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:18,576 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:18,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:18,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:18,780 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:18,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:18,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1726052840, now seen corresponding path program 1 times [2023-12-16 16:24:18,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:18,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1132620765] [2023-12-16 16:24:18,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:18,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:18,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:18,813 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:18,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 16:24:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:18,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 16:24:18,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:19,253 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 16:24:19,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 16:24:19,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1132620765] [2023-12-16 16:24:19,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1132620765] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:19,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:19,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-12-16 16:24:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726109308] [2023-12-16 16:24:19,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:19,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 16:24:19,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:19,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 16:24:19,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-16 16:24:19,973 INFO L87 Difference]: Start difference. First operand 214 states and 283 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:24:21,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:21,505 INFO L93 Difference]: Finished difference Result 454 states and 617 transitions. [2023-12-16 16:24:21,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-16 16:24:21,506 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2023-12-16 16:24:21,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:21,507 INFO L225 Difference]: With dead ends: 454 [2023-12-16 16:24:21,507 INFO L226 Difference]: Without dead ends: 267 [2023-12-16 16:24:21,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=416, Unknown=0, NotChecked=0, Total=552 [2023-12-16 16:24:21,508 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 44 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:24:21,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 321 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 16:24:21,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-12-16 16:24:21,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 174. [2023-12-16 16:24:21,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 155 states have (on average 1.2516129032258065) internal successors, (194), 158 states have internal predecessors, (194), 9 states have call successors, (9), 5 states have call predecessors, (9), 9 states have return successors, (16), 10 states have call predecessors, (16), 9 states have call successors, (16) [2023-12-16 16:24:21,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 219 transitions. [2023-12-16 16:24:21,533 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 219 transitions. Word has length 40 [2023-12-16 16:24:21,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:21,533 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 219 transitions. [2023-12-16 16:24:21,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-16 16:24:21,534 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2023-12-16 16:24:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 16:24:21,535 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:21,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:21,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:21,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:21,738 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:21,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:21,738 INFO L85 PathProgramCache]: Analyzing trace with hash 160286352, now seen corresponding path program 1 times [2023-12-16 16:24:21,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:21,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047214723] [2023-12-16 16:24:21,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:21,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:21,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:21,740 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:21,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 16:24:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:21,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 16:24:21,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 16:24:22,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 16:24:23,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:23,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047214723] [2023-12-16 16:24:23,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047214723] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:23,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:23,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-16 16:24:23,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087180252] [2023-12-16 16:24:23,083 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:23,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 16:24:23,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:23,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 16:24:23,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-12-16 16:24:23,084 INFO L87 Difference]: Start difference. First operand 174 states and 219 transitions. Second operand has 18 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:24:24,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:24,984 INFO L93 Difference]: Finished difference Result 416 states and 568 transitions. [2023-12-16 16:24:24,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-16 16:24:24,985 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 41 [2023-12-16 16:24:24,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:24,987 INFO L225 Difference]: With dead ends: 416 [2023-12-16 16:24:24,987 INFO L226 Difference]: Without dead ends: 294 [2023-12-16 16:24:24,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2023-12-16 16:24:24,988 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 98 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:24:24,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 393 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 16:24:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2023-12-16 16:24:25,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 186. [2023-12-16 16:24:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 165 states have (on average 1.2424242424242424) internal successors, (205), 170 states have internal predecessors, (205), 9 states have call successors, (9), 5 states have call predecessors, (9), 11 states have return successors, (20), 10 states have call predecessors, (20), 9 states have call successors, (20) [2023-12-16 16:24:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 234 transitions. [2023-12-16 16:24:25,007 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 234 transitions. Word has length 41 [2023-12-16 16:24:25,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:25,008 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 234 transitions. [2023-12-16 16:24:25,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-12-16 16:24:25,008 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 234 transitions. [2023-12-16 16:24:25,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-16 16:24:25,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:25,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:25,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-12-16 16:24:25,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:25,212 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:25,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:25,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1119577326, now seen corresponding path program 1 times [2023-12-16 16:24:25,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:25,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628419368] [2023-12-16 16:24:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:25,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:25,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:25,214 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 16:24:25,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-16 16:24:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:24:25,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 16:24:25,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 16:24:25,380 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-12-16 16:24:25,380 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 16:24:25,381 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:24:25,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:25,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 16:24:25,587 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 16:24:25,589 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:24:25,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:24:25 BoogieIcfgContainer [2023-12-16 16:24:25,611 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:24:25,611 INFO L158 Benchmark]: Toolchain (without parser) took 62544.75ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 228.9MB in the beginning and 124.0MB in the end (delta: 104.9MB). Peak memory consumption was 162.0MB. Max. memory is 8.0GB. [2023-12-16 16:24:25,611 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:24:25,611 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.28ms. Allocated memory is still 273.7MB. Free memory was 228.5MB in the beginning and 209.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 16:24:25,612 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.46ms. Allocated memory is still 273.7MB. Free memory was 209.3MB in the beginning and 207.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 16:24:25,612 INFO L158 Benchmark]: Boogie Preprocessor took 46.57ms. Allocated memory is still 273.7MB. Free memory was 207.2MB in the beginning and 203.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 16:24:25,612 INFO L158 Benchmark]: RCFGBuilder took 398.49ms. Allocated memory is still 273.7MB. Free memory was 203.7MB in the beginning and 183.4MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-16 16:24:25,612 INFO L158 Benchmark]: TraceAbstraction took 61758.64ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 182.8MB in the beginning and 124.0MB in the end (delta: 58.7MB). Peak memory consumption was 115.9MB. Max. memory is 8.0GB. [2023-12-16 16:24:25,613 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.10ms. Allocated memory is still 183.5MB. Free memory is still 134.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 303.28ms. Allocated memory is still 273.7MB. Free memory was 228.5MB in the beginning and 209.3MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.46ms. Allocated memory is still 273.7MB. Free memory was 209.3MB in the beginning and 207.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.57ms. Allocated memory is still 273.7MB. Free memory was 207.2MB in the beginning and 203.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 398.49ms. Allocated memory is still 273.7MB. Free memory was 203.7MB in the beginning and 183.4MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 61758.64ms. Allocated memory was 273.7MB in the beginning and 329.3MB in the end (delta: 55.6MB). Free memory was 182.8MB in the beginning and 124.0MB in the end (delta: 58.7MB). Peak memory consumption was 115.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 641]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L627] CALL, EXPR _get_nondet_int(2, 5) VAL [\old(from)=2, \old(until)=5] [L620] int len = from; VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L621] len < until && __VERIFIER_nondet_int() [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=2, \old(until)=5, from=2, len=2, until=5] [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L624] return len; [L627] RET, EXPR _get_nondet_int(2, 5) [L627] const int len = _get_nondet_int(2, 5); [L628] SLL s = sll_create(len); [L628] CALL, EXPR sll_create(len) [L575] SLL head = ((void *)0); VAL [\old(len)=2, head={0:0}, len=2] [L576] EXPR len-- VAL [\old(len)=2, head={0:0}, len=1] [L576] COND TRUE len-- > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE, EXPR !(((void *)0) == new_head) VAL [\old(len)=2, head={0:0}, len=1, new_head={5:0}] [L581] EXPR new_head->next = head [L582] EXPR head = new_head [L576-L583] { SLL new_head = (SLL) malloc(sizeof(struct node)); if(((void *)0) == new_head) { myexit(1); } new_head->next = head; head = new_head; } VAL [\old(len)=2, head={5:0}, len=1] [L576] EXPR len-- VAL [\old(len)=2, head={5:0}, len=0] [L576] COND TRUE len-- > 0 [L577] SLL new_head = (SLL) malloc(sizeof(struct node)); [L578] COND FALSE, EXPR !(((void *)0) == new_head) VAL [\old(len)=2, head={5:0}, len=0, new_head={3:0}] [L581] EXPR new_head->next = head [L582] EXPR head = new_head [L576-L583] { SLL new_head = (SLL) malloc(sizeof(struct node)); if(((void *)0) == new_head) { myexit(1); } new_head->next = head; head = new_head; } VAL [\old(len)=2, head={3:0}, len=0] [L576] EXPR len-- VAL [\old(len)=2, head={3:0}, len=-1] [L576] COND FALSE !(len-- > 0) [L584] return head; [L628] RET, EXPR sll_create(len) [L628] SLL s = sll_create(len); [L629] CALL, EXPR _get_nondet_int(0, len - 1) VAL [\old(from)=0, \old(until)=1] [L620] int len = from; VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L621] len < until && __VERIFIER_nondet_int() [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=0, until=1] [L621] COND TRUE len < until && __VERIFIER_nondet_int() [L622] len++ VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L621] len < until && __VERIFIER_nondet_int() VAL [\old(from)=0, \old(until)=1, from=0, len=1, until=1] [L621] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L624] return len; [L629] RET, EXPR _get_nondet_int(0, len - 1) VAL [len=2, s={10:0}] [L629] const int k = _get_nondet_int(0, len - 1); [L630] int i = 0; VAL [i=0, k=1, len=2, s={10:0}] [L631] i < k && __VERIFIER_nondet_int() [L631] i < k && __VERIFIER_nondet_int() VAL [i=0, k=1, len=2, s={10:0}] [L631] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L636] EXPR \read(s) [L636] CALL, EXPR sll_length(s) [L587] int len = 0; VAL [head={3:0}, head={3:0}, len=0] [L588] COND TRUE \read(head) [L589] len++ [L590] EXPR head->next [L590] head = head->next [L588] COND TRUE \read(head) [L589] len++ [L590] EXPR head->next [L590] head = head->next [L588] COND FALSE !(\read(head)) VAL [head={0:0}, head={3:0}, len=2] [L592] return len; [L636] RET, EXPR sll_length(s) [L636] COND TRUE k + len != sll_length(s) [L641] reach_error() VAL [i=0, k=1, len=2, s={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.7s, OverallIterations: 14, TraceHistogramMax: 6, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 541 SdHoareTripleChecker+Valid, 19.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 527 mSDsluCounter, 4491 SdHoareTripleChecker+Invalid, 18.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3972 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3303 IncrementalHoareTripleChecker+Invalid, 3397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 519 mSDtfsCounter, 3303 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 880 GetRequests, 649 SyntacticMatches, 4 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 32.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=223occurred in iteration=10, InterpolantAutomatonStates: 191, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 540 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 31.3s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 774 ConstructedInterpolants, 37 QuantifiedInterpolants, 7787 SizeOfPredicates, 97 NumberOfNonLiveVariables, 1435 ConjunctsInSsa, 191 ConjunctsInUnsatCore, 22 InterpolantComputations, 4 PerfectInterpolantSequences, 215/421 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-16 16:24:25,664 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...