/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-tiling/poly2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 17:44:48,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 17:44:48,466 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-21 17:44:48,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 17:44:48,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 17:44:48,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 17:44:48,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 17:44:48,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 17:44:48,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 17:44:48,498 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 17:44:48,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 17:44:48,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 17:44:48,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 17:44:48,501 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 17:44:48,501 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 17:44:48,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 17:44:48,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 17:44:48,502 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 17:44:48,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 17:44:48,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 17:44:48,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 17:44:48,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 17:44:48,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 17:44:48,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 17:44:48,503 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 17:44:48,503 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 17:44:48,503 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 17:44:48,503 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 17:44:48,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 17:44:48,503 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 17:44:48,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 17:44:48,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 17:44:48,505 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 17:44:48,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 17:44:48,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:44:48,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 17:44:48,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 17:44:48,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 17:44:48,505 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 17:44:48,505 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 17:44:48,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 17:44:48,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 17:44:48,506 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 17:44:48,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 17:44:48,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 17:44:48,506 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 17:44:48,507 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-21 17:44:48,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 17:44:48,687 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 17:44:48,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 17:44:48,689 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 17:44:48,690 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 17:44:48,691 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/poly2.c [2023-12-21 17:44:49,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 17:44:49,884 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 17:44:49,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly2.c [2023-12-21 17:44:49,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1aaf544/9b7db69c748849dea56d6434894c0287/FLAG87ada778c [2023-12-21 17:44:49,904 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be1aaf544/9b7db69c748849dea56d6434894c0287 [2023-12-21 17:44:49,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 17:44:49,908 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 17:44:49,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 17:44:49,912 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 17:44:49,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 17:44:49,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:44:49" (1/1) ... [2023-12-21 17:44:49,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bbfbf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:49, skipping insertion in model container [2023-12-21 17:44:49,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:44:49" (1/1) ... [2023-12-21 17:44:49,933 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 17:44:50,038 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly2.c[396,409] [2023-12-21 17:44:50,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:44:50,061 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 17:44:50,073 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly2.c[396,409] [2023-12-21 17:44:50,081 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 17:44:50,092 INFO L206 MainTranslator]: Completed translation [2023-12-21 17:44:50,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50 WrapperNode [2023-12-21 17:44:50,093 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 17:44:50,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 17:44:50,094 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 17:44:50,094 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 17:44:50,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,125 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 66 [2023-12-21 17:44:50,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 17:44:50,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 17:44:50,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 17:44:50,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 17:44:50,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,147 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 8, 4]. 57 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 2 writes are split as follows [0, 0, 2]. [2023-12-21 17:44:50,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 17:44:50,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 17:44:50,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 17:44:50,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 17:44:50,158 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (1/1) ... [2023-12-21 17:44:50,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 17:44:50,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 17:44:50,209 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 17:44:50,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 17:44:50,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 17:44:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 17:44:50,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 17:44:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 17:44:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 17:44:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 17:44:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 17:44:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 17:44:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 17:44:50,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 17:44:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 17:44:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 17:44:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 17:44:50,351 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 17:44:50,352 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 17:44:50,662 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 17:44:50,713 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 17:44:50,713 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 17:44:50,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:44:50 BoogieIcfgContainer [2023-12-21 17:44:50,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 17:44:50,715 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 17:44:50,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 17:44:50,717 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 17:44:50,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:44:49" (1/3) ... [2023-12-21 17:44:50,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21eb29cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:44:50, skipping insertion in model container [2023-12-21 17:44:50,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:44:50" (2/3) ... [2023-12-21 17:44:50,718 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21eb29cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:44:50, skipping insertion in model container [2023-12-21 17:44:50,718 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:44:50" (3/3) ... [2023-12-21 17:44:50,719 INFO L112 eAbstractionObserver]: Analyzing ICFG poly2.c [2023-12-21 17:44:50,736 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 17:44:50,736 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 17:44:50,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 17:44:50,774 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;@1d56ab8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 17:44:50,774 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 17:44:50,785 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 17:44:50,790 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:44:50,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:44:50,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:44:50,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:44:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1857965342, now seen corresponding path program 1 times [2023-12-21 17:44:50,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:44:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [456611852] [2023-12-21 17:44:50,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:44:50,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:50,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:44:50,808 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:44:50,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-21 17:44:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:44:50,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 17:44:50,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:44:50,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:44:50,903 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:44:50,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:44:50,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [456611852] [2023-12-21 17:44:50,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [456611852] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:44:50,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:44:50,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 17:44:50,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36094097] [2023-12-21 17:44:50,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:44:50,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 17:44:50,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:44:50,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 17:44:50,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 17:44:50,931 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:51,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:44:51,015 INFO L93 Difference]: Finished difference Result 25 states and 36 transitions. [2023-12-21 17:44:51,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 17:44:51,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 17:44:51,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:44:51,022 INFO L225 Difference]: With dead ends: 25 [2023-12-21 17:44:51,022 INFO L226 Difference]: Without dead ends: 11 [2023-12-21 17:44:51,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-21 17:44:51,029 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12 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.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:44:51,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:44:51,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-21 17:44:51,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-21 17:44:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2023-12-21 17:44:51,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 9 [2023-12-21 17:44:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:44:51,053 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2023-12-21 17:44:51,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2023-12-21 17:44:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-21 17:44:51,054 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:44:51,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:44:51,060 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-21 17:44:51,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:51,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:44:51,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:44:51,258 INFO L85 PathProgramCache]: Analyzing trace with hash 827910552, now seen corresponding path program 1 times [2023-12-21 17:44:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:44:51,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192476772] [2023-12-21 17:44:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:44:51,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:51,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:44:51,261 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:44:51,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-21 17:44:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:44:51,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 17:44:51,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:44:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:44:51,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:44:51,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:44:51,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192476772] [2023-12-21 17:44:51,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192476772] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:44:51,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:44:51,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-21 17:44:51,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302384112] [2023-12-21 17:44:51,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:44:51,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 17:44:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:44:51,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 17:44:51,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 17:44:51,414 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:44:51,568 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2023-12-21 17:44:51,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 17:44:51,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-21 17:44:51,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:44:51,575 INFO L225 Difference]: With dead ends: 20 [2023-12-21 17:44:51,576 INFO L226 Difference]: Without dead ends: 12 [2023-12-21 17:44:51,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-21 17:44:51,577 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:44:51,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 11 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 17:44:51,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-21 17:44:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-21 17:44:51,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2023-12-21 17:44:51,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2023-12-21 17:44:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:44:51,581 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2023-12-21 17:44:51,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2023-12-21 17:44:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-21 17:44:51,582 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:44:51,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:44:51,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-21 17:44:51,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:51,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:44:51,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:44:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -790291495, now seen corresponding path program 1 times [2023-12-21 17:44:51,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:44:51,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851358082] [2023-12-21 17:44:51,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:44:51,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:51,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:44:51,787 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:44:51,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-21 17:44:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:44:51,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 17:44:51,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:44:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:44:52,008 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:44:52,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:44:52,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:44:52,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851358082] [2023-12-21 17:44:52,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851358082] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:44:52,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:44:52,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-12-21 17:44:52,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165351972] [2023-12-21 17:44:52,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:44:52,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 17:44:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:44:52,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 17:44:52,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:44:52,087 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:44:52,368 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2023-12-21 17:44:52,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 17:44:52,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-21 17:44:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:44:52,369 INFO L225 Difference]: With dead ends: 21 [2023-12-21 17:44:52,369 INFO L226 Difference]: Without dead ends: 13 [2023-12-21 17:44:52,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-21 17:44:52,370 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:44:52,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 17 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:44:52,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-21 17:44:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-21 17:44:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2023-12-21 17:44:52,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2023-12-21 17:44:52,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:44:52,374 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2023-12-21 17:44:52,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2023-12-21 17:44:52,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-12-21 17:44:52,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:44:52,375 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:44:52,395 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-21 17:44:52,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:52,581 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:44:52,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:44:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash 585052600, now seen corresponding path program 2 times [2023-12-21 17:44:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:44:52,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207559360] [2023-12-21 17:44:52,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:44:52,582 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:52,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:44:52,583 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:44:52,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-21 17:44:52,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-21 17:44:52,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:44:52,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 17:44:52,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:44:52,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 17:44:52,731 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 17:44:52,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:44:52,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207559360] [2023-12-21 17:44:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207559360] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 17:44:52,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 17:44:52,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 17:44:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233734641] [2023-12-21 17:44:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 17:44:52,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 17:44:52,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:44:52,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 17:44:52,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 17:44:52,733 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:44:52,941 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2023-12-21 17:44:52,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 17:44:52,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-12-21 17:44:52,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:44:52,951 INFO L225 Difference]: With dead ends: 25 [2023-12-21 17:44:52,952 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 17:44:52,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-21 17:44:52,953 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 37 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 17:44:52,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 8 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 17:44:52,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 17:44:52,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2023-12-21 17:44:52,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:52,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-21 17:44:52,956 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 11 [2023-12-21 17:44:52,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:44:52,956 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-21 17:44:52,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-21 17:44:52,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 17:44:52,956 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:44:52,956 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:44:52,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-21 17:44:53,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:53,165 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:44:53,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:44:53,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2057523480, now seen corresponding path program 1 times [2023-12-21 17:44:53,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:44:53,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046691744] [2023-12-21 17:44:53,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:44:53,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:53,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:44:53,168 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:44:53,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 17:44:53,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:44:53,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 17:44:53,339 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:44:53,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:44:53,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:44:53,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:44:53,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:44:53,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046691744] [2023-12-21 17:44:53,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046691744] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:44:53,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:44:53,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-21 17:44:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489681485] [2023-12-21 17:44:53,713 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:44:53,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 17:44:53,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:44:53,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 17:44:53,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2023-12-21 17:44:53,714 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:54,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:44:54,374 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2023-12-21 17:44:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 17:44:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-21 17:44:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:44:54,383 INFO L225 Difference]: With dead ends: 45 [2023-12-21 17:44:54,383 INFO L226 Difference]: Without dead ends: 36 [2023-12-21 17:44:54,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552 [2023-12-21 17:44:54,384 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 152 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 17:44:54,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 28 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 17:44:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-21 17:44:54,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2023-12-21 17:44:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-12-21 17:44:54,389 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 12 [2023-12-21 17:44:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:44:54,390 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-12-21 17:44:54,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:44:54,390 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-12-21 17:44:54,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 17:44:54,390 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:44:54,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:44:54,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 17:44:54,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:54,591 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:44:54,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:44:54,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1921963960, now seen corresponding path program 2 times [2023-12-21 17:44:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:44:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107854463] [2023-12-21 17:44:54,593 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:44:54,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:44:54,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:44:54,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:44:54,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-21 17:44:54,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:44:54,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:44:54,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 17:44:54,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:44:54,892 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 16 treesize of output 17 [2023-12-21 17:44:54,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:44:54,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2023-12-21 17:44:55,064 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 17:44:55,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:44:55,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 61 treesize of output 57 [2023-12-21 17:44:55,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:44:55,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 74 treesize of output 53 [2023-12-21 17:44:55,247 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:44:55,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 45 [2023-12-21 17:44:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:44:55,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:44:59,801 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 299 treesize of output 291 [2023-12-21 17:44:59,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:44:59,943 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 1123820 treesize of output 1111020 [2023-12-21 17:45:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:45:18,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:45:18,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107854463] [2023-12-21 17:45:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107854463] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:45:18,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:45:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-12-21 17:45:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016384131] [2023-12-21 17:45:18,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:45:18,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 17:45:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:45:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 17:45:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-12-21 17:45:18,993 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:45:27,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 17:45:33,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:45:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:45:36,861 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2023-12-21 17:45:36,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 17:45:36,861 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 17:45:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:45:36,864 INFO L225 Difference]: With dead ends: 59 [2023-12-21 17:45:36,866 INFO L226 Difference]: Without dead ends: 57 [2023-12-21 17:45:36,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2023-12-21 17:45:36,867 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:45:36,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 68 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 163 Invalid, 2 Unknown, 0 Unchecked, 13.1s Time] [2023-12-21 17:45:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-12-21 17:45:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2023-12-21 17:45:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:45:36,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-12-21 17:45:36,891 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 13 [2023-12-21 17:45:36,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:45:36,892 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-12-21 17:45:36,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:45:36,892 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-12-21 17:45:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 17:45:36,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:45:36,892 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:45:36,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-21 17:45:37,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:45:37,093 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:45:37,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:45:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash 695472088, now seen corresponding path program 3 times [2023-12-21 17:45:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:45:37,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1650737862] [2023-12-21 17:45:37,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 17:45:37,094 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:45:37,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:45:37,100 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:45:37,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-21 17:45:37,475 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 17:45:37,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:45:37,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 17:45:37,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:45:37,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:45:37,781 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:45:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:45:38,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:45:38,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1650737862] [2023-12-21 17:45:38,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1650737862] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:45:38,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:45:38,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-12-21 17:45:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260144114] [2023-12-21 17:45:38,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:45:38,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 17:45:38,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:45:38,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 17:45:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-12-21 17:45:38,610 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:45:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:45:40,597 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-12-21 17:45:40,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 17:45:40,597 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 17:45:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:45:40,598 INFO L225 Difference]: With dead ends: 112 [2023-12-21 17:45:40,598 INFO L226 Difference]: Without dead ends: 100 [2023-12-21 17:45:40,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=374, Invalid=1186, Unknown=0, NotChecked=0, Total=1560 [2023-12-21 17:45:40,599 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 260 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 17:45:40,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 299 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 17:45:40,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-21 17:45:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 50. [2023-12-21 17:45:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:45:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2023-12-21 17:45:40,614 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 15 [2023-12-21 17:45:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:45:40,614 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2023-12-21 17:45:40,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:45:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2023-12-21 17:45:40,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 17:45:40,615 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:45:40,615 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:45:40,624 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-21 17:45:40,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:45:40,816 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:45:40,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:45:40,816 INFO L85 PathProgramCache]: Analyzing trace with hash 617600839, now seen corresponding path program 4 times [2023-12-21 17:45:40,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:45:40,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748326568] [2023-12-21 17:45:40,823 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 17:45:40,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:45:40,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:45:40,825 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:45:40,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-21 17:45:41,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 17:45:41,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:45:41,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 17:45:41,250 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:45:41,264 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 16 treesize of output 17 [2023-12-21 17:45:41,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:45:41,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2023-12-21 17:45:41,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:45:41,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 65 [2023-12-21 17:45:41,541 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 17:45:41,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:45:41,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 79 treesize of output 81 [2023-12-21 17:45:41,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:45:41,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 92 treesize of output 77 [2023-12-21 17:45:41,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:45:41,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 70 [2023-12-21 17:45:41,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:45:41,915 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 95 treesize of output 53 [2023-12-21 17:45:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:45:41,954 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:45:58,317 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 455 treesize of output 447 [2023-12-21 17:45:58,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:45:58,575 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 71171200 treesize of output 70974592 [2023-12-21 17:46:08,595 WARN L293 SmtUtils]: Spent 5.93s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 17:46:36,282 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 17:47:14,277 WARN L293 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 54 DAG size of output: 48 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:47:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:47:14,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:47:14,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748326568] [2023-12-21 17:47:14,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748326568] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:47:14,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:47:14,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-12-21 17:47:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382211446] [2023-12-21 17:47:14,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:47:14,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 17:47:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:47:14,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 17:47:14,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=383, Unknown=1, NotChecked=0, Total=462 [2023-12-21 17:47:14,282 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:47:25,931 WARN L293 SmtUtils]: Spent 9.04s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 17:47:32,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:47:37,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:47:40,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 17:47:50,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:48:03,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 17:48:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:48:06,574 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2023-12-21 17:48:06,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-21 17:48:06,574 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-21 17:48:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:48:06,575 INFO L225 Difference]: With dead ends: 117 [2023-12-21 17:48:06,575 INFO L226 Difference]: Without dead ends: 115 [2023-12-21 17:48:06,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 57.9s TimeCoverageRelationStatistics Valid=256, Invalid=1383, Unknown=1, NotChecked=0, Total=1640 [2023-12-21 17:48:06,576 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 21 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2023-12-21 17:48:06,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 121 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 370 Invalid, 2 Unknown, 0 Unchecked, 29.1s Time] [2023-12-21 17:48:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-21 17:48:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 60. [2023-12-21 17:48:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:48:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2023-12-21 17:48:06,603 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 15 [2023-12-21 17:48:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:48:06,604 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2023-12-21 17:48:06,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:48:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2023-12-21 17:48:06,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 17:48:06,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:48:06,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:48:06,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-21 17:48:06,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:48:06,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:48:06,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:48:06,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1024533829, now seen corresponding path program 1 times [2023-12-21 17:48:06,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:48:06,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580346189] [2023-12-21 17:48:06,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 17:48:06,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:48:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:48:06,817 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:48:06,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-21 17:48:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 17:48:07,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 17:48:07,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:48:07,238 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 18 treesize of output 19 [2023-12-21 17:48:07,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:48:07,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 56 treesize of output 37 [2023-12-21 17:48:07,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:48:07,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:48:07,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 50 [2023-12-21 17:48:07,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:48:07,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 45 [2023-12-21 17:48:07,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:48:07,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:48:13,377 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 36 treesize of output 34 [2023-12-21 17:48:13,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 79 treesize of output 75 [2023-12-21 17:48:13,669 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 31 treesize of output 29 [2023-12-21 17:48:13,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 61 treesize of output 57 [2023-12-21 17:48:17,496 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:48:17,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:48:17,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580346189] [2023-12-21 17:48:17,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580346189] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:48:17,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:48:17,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2023-12-21 17:48:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76001293] [2023-12-21 17:48:17,497 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:48:17,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 17:48:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:48:17,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 17:48:17,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-12-21 17:48:17,498 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:48:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:48:23,122 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2023-12-21 17:48:23,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 17:48:23,127 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-21 17:48:23,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:48:23,128 INFO L225 Difference]: With dead ends: 75 [2023-12-21 17:48:23,128 INFO L226 Difference]: Without dead ends: 63 [2023-12-21 17:48:23,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2023-12-21 17:48:23,129 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-12-21 17:48:23,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 74 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2023-12-21 17:48:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-12-21 17:48:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2023-12-21 17:48:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.2307692307692308) internal successors, (64), 52 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:48:23,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2023-12-21 17:48:23,148 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 16 [2023-12-21 17:48:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:48:23,148 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2023-12-21 17:48:23,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 19 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:48:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2023-12-21 17:48:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 17:48:23,151 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:48:23,151 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:48:23,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-21 17:48:23,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:48:23,352 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:48:23,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:48:23,353 INFO L85 PathProgramCache]: Analyzing trace with hash 232908968, now seen corresponding path program 5 times [2023-12-21 17:48:23,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:48:23,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141489956] [2023-12-21 17:48:23,353 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 17:48:23,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:48:23,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:48:23,354 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:48:23,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-21 17:48:24,140 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-12-21 17:48:24,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:48:24,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 17:48:24,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:48:24,658 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:48:24,658 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:48:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:48:26,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:48:26,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141489956] [2023-12-21 17:48:26,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141489956] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:48:26,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:48:26,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-21 17:48:26,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949793370] [2023-12-21 17:48:26,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:48:26,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-21 17:48:26,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:48:26,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-21 17:48:26,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=537, Unknown=0, NotChecked=0, Total=702 [2023-12-21 17:48:26,299 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:48:30,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:48:30,479 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2023-12-21 17:48:30,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-21 17:48:30,480 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-21 17:48:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:48:30,481 INFO L225 Difference]: With dead ends: 163 [2023-12-21 17:48:30,481 INFO L226 Difference]: Without dead ends: 151 [2023-12-21 17:48:30,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=613, Invalid=2357, Unknown=0, NotChecked=0, Total=2970 [2023-12-21 17:48:30,482 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 493 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-21 17:48:30,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 420 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-21 17:48:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-21 17:48:30,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 71. [2023-12-21 17:48:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.2428571428571429) internal successors, (87), 70 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:48:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2023-12-21 17:48:30,510 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 18 [2023-12-21 17:48:30,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:48:30,511 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2023-12-21 17:48:30,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:48:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2023-12-21 17:48:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 17:48:30,511 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:48:30,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:48:30,526 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-21 17:48:30,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:48:30,712 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:48:30,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:48:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash -688076970, now seen corresponding path program 2 times [2023-12-21 17:48:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:48:30,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724130437] [2023-12-21 17:48:30,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 17:48:30,719 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:48:30,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:48:30,720 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 17:48:30,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-21 17:48:31,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 17:48:31,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:48:31,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 17:48:31,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:48:31,196 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 18 treesize of output 19 [2023-12-21 17:48:31,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:48:31,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2023-12-21 17:48:31,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:48:31,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 74 treesize of output 61 [2023-12-21 17:48:31,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 17:48:31,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:48:31,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 74 [2023-12-21 17:48:31,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:48:31,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 70 [2023-12-21 17:48:32,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:48:32,124 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 99 treesize of output 53 [2023-12-21 17:48:32,185 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:48:32,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:48:45,385 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 303 treesize of output 295 [2023-12-21 17:48:45,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:48:45,558 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 34292684 treesize of output 33768396 [2023-12-21 17:48:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:48:55,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 17:48:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724130437] [2023-12-21 17:48:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724130437] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 17:48:55,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 17:48:55,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2023-12-21 17:48:55,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019683283] [2023-12-21 17:48:55,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 17:48:55,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 17:48:55,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 17:48:55,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 17:48:55,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2023-12-21 17:48:55,933 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:49:03,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:49:05,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 17:49:15,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 17:49:20,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 17:49:24,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 17:49:28,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 17:49:30,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 17:49:30,877 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2023-12-21 17:49:30,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-21 17:49:30,877 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-12-21 17:49:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 17:49:30,878 INFO L225 Difference]: With dead ends: 141 [2023-12-21 17:49:30,879 INFO L226 Difference]: Without dead ends: 139 [2023-12-21 17:49:30,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=303, Invalid=1859, Unknown=0, NotChecked=0, Total=2162 [2023-12-21 17:49:30,880 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 176 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2023-12-21 17:49:30,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 95 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 230 Invalid, 1 Unknown, 0 Unchecked, 21.4s Time] [2023-12-21 17:49:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-12-21 17:49:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 80. [2023-12-21 17:49:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 79 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:49:30,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2023-12-21 17:49:30,915 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 18 [2023-12-21 17:49:30,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 17:49:30,915 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2023-12-21 17:49:30,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 17:49:30,915 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2023-12-21 17:49:30,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 17:49:30,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 17:49:30,916 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 17:49:30,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-21 17:49:31,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:49:31,117 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 17:49:31,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 17:49:31,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1908900441, now seen corresponding path program 6 times [2023-12-21 17:49:31,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 17:49:31,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649181961] [2023-12-21 17:49:31,118 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 17:49:31,118 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 17:49:31,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 17:49:31,120 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-21 17:49:31,121 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-21 17:49:31,847 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-21 17:49:31,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 17:49:31,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-21 17:49:31,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 17:49:31,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-12-21 17:49:31,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:31,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 35 [2023-12-21 17:49:32,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:32,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 55 [2023-12-21 17:49:32,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:32,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 29 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 57 treesize of output 75 [2023-12-21 17:49:32,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:32,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 46 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 71 treesize of output 95 [2023-12-21 17:49:32,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 17:49:32,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:32,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 95 treesize of output 111 [2023-12-21 17:49:32,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:32,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 104 treesize of output 109 [2023-12-21 17:49:32,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:32,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 102 treesize of output 104 [2023-12-21 17:49:32,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:32,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 100 treesize of output 99 [2023-12-21 17:49:33,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:33,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 98 treesize of output 94 [2023-12-21 17:49:33,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 17:49:33,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 69 [2023-12-21 17:49:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 17:49:33,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 17:50:21,092 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 767 treesize of output 759