/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-fpi/indp2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 20:31:58,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 20:31:58,886 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 20:31:58,889 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 20:31:58,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 20:31:58,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 20:31:58,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 20:31:58,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 20:31:58,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 20:31:58,907 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 20:31:58,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 20:31:58,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 20:31:58,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 20:31:58,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 20:31:58,908 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 20:31:58,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 20:31:58,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 20:31:58,909 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 20:31:58,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 20:31:58,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 20:31:58,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 20:31:58,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 20:31:58,911 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 20:31:58,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 20:31:58,911 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 20:31:58,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 20:31:58,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 20:31:58,912 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 20:31:58,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 20:31:58,912 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 20:31:58,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 20:31:58,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 20:31:58,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 20:31:58,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 20:31:58,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:31:58,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 20:31:58,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 20:31:58,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 20:31:58,915 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 20:31:58,915 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 20:31:58,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 20:31:58,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 20:31:58,916 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 20:31:58,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 20:31:58,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 20:31:58,916 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 20:31:58,916 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 20:31:59,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 20:31:59,089 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 20:31:59,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 20:31:59,092 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 20:31:59,092 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 20:31:59,094 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/indp2.c [2023-12-21 20:32:00,105 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 20:32:00,267 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 20:32:00,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/indp2.c [2023-12-21 20:32:00,273 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf4d4565/c50a8c7449bd41ce94fe940447db6c7c/FLAG58fb8666c [2023-12-21 20:32:00,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecf4d4565/c50a8c7449bd41ce94fe940447db6c7c [2023-12-21 20:32:00,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 20:32:00,700 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 20:32:00,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 20:32:00,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 20:32:00,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 20:32:00,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,705 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6928a3a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00, skipping insertion in model container [2023-12-21 20:32:00,705 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,725 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 20:32:00,831 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-fpi/indp2.c[588,601] [2023-12-21 20:32:00,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:32:00,856 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 20:32:00,865 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-fpi/indp2.c[588,601] [2023-12-21 20:32:00,871 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:32:00,880 INFO L206 MainTranslator]: Completed translation [2023-12-21 20:32:00,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00 WrapperNode [2023-12-21 20:32:00,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 20:32:00,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 20:32:00,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 20:32:00,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 20:32:00,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,906 INFO L138 Inliner]: procedures = 18, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2023-12-21 20:32:00,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 20:32:00,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 20:32:00,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 20:32:00,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 20:32:00,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,926 INFO L175 MemorySlicer]: Split 16 memory accesses to 3 slices as follows [2, 8, 6]. 50 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0]. The 3 writes are split as follows [0, 0, 3]. [2023-12-21 20:32:00,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,931 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 20:32:00,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 20:32:00,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 20:32:00,937 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 20:32:00,938 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (1/1) ... [2023-12-21 20:32:00,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:32:00,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 20:32:00,960 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 20:32:00,967 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 20:32:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 20:32:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 20:32:00,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 20:32:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 20:32:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 20:32:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 20:32:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 20:32:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 20:32:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 20:32:00,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 20:32:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 20:32:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 20:32:00,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 20:32:01,050 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 20:32:01,052 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 20:32:01,238 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 20:32:01,277 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 20:32:01,277 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-21 20:32:01,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:32:01 BoogieIcfgContainer [2023-12-21 20:32:01,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 20:32:01,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 20:32:01,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 20:32:01,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 20:32:01,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:32:00" (1/3) ... [2023-12-21 20:32:01,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613da74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:32:01, skipping insertion in model container [2023-12-21 20:32:01,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:32:00" (2/3) ... [2023-12-21 20:32:01,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613da74e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:32:01, skipping insertion in model container [2023-12-21 20:32:01,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:32:01" (3/3) ... [2023-12-21 20:32:01,284 INFO L112 eAbstractionObserver]: Analyzing ICFG indp2.c [2023-12-21 20:32:01,296 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 20:32:01,296 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 20:32:01,329 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 20:32:01,334 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;@f1df6e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 20:32:01,335 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 20:32:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 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 20:32:01,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 20:32:01,346 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:32:01,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:32:01,347 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:32:01,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:32:01,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1482130284, now seen corresponding path program 1 times [2023-12-21 20:32:01,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:32:01,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936249949] [2023-12-21 20:32:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:32:01,367 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 20:32:01,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:32:01,386 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 20:32:01,388 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 20:32:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:32:01,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 20:32:01,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:32:01,468 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 20:32:01,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:32:01,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:32:01,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936249949] [2023-12-21 20:32:01,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936249949] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:32:01,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:32:01,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 20:32:01,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714268304] [2023-12-21 20:32:01,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:32:01,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 20:32:01,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:32:01,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 20:32:01,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:32:01,492 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.75) internal successors, (28), 17 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) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 20:32:01,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:32:01,532 INFO L93 Difference]: Finished difference Result 33 states and 51 transitions. [2023-12-21 20:32:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 20:32:01,534 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 20:32:01,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:32:01,538 INFO L225 Difference]: With dead ends: 33 [2023-12-21 20:32:01,538 INFO L226 Difference]: Without dead ends: 15 [2023-12-21 20:32:01,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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 20:32:01,542 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:32:01,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:32:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-21 20:32:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-21 20:32:01,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:32:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-21 20:32:01,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 13 [2023-12-21 20:32:01,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:32:01,561 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-21 20:32:01,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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 20:32:01,562 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-21 20:32:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-21 20:32:01,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:32:01,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:32:01,580 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 20:32:01,764 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 20:32:01,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:32:01,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:32:01,765 INFO L85 PathProgramCache]: Analyzing trace with hash -781065706, now seen corresponding path program 1 times [2023-12-21 20:32:01,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:32:01,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791848806] [2023-12-21 20:32:01,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:32:01,766 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 20:32:01,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:32:01,768 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 20:32:01,771 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 20:32:01,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:32:01,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 20:32:01,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:32:01,973 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 20:32:01,973 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:32:01,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:32:01,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791848806] [2023-12-21 20:32:01,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791848806] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:32:01,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:32:01,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 20:32:01,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310962920] [2023-12-21 20:32:01,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:32:01,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 20:32:01,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:32:01,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 20:32:01,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 20:32:01,982 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:32:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:32:02,101 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2023-12-21 20:32:02,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 20:32:02,101 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-12-21 20:32:02,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:32:02,102 INFO L225 Difference]: With dead ends: 33 [2023-12-21 20:32:02,102 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 20:32:02,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-21 20:32:02,103 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:32:02,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 16 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 20:32:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 20:32:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2023-12-21 20:32:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 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 20:32:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-12-21 20:32:02,108 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2023-12-21 20:32:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:32:02,108 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-12-21 20:32:02,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:32:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-12-21 20:32:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-21 20:32:02,109 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:32:02,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:32:02,113 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 20:32:02,309 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 20:32:02,310 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:32:02,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:32:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -389034316, now seen corresponding path program 1 times [2023-12-21 20:32:02,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:32:02,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635673440] [2023-12-21 20:32:02,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:32:02,311 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 20:32:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:32:02,329 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 20:32:02,379 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 20:32:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:32:02,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 20:32:02,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:32:02,500 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:32:02,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-21 20:32:02,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:02,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 71 treesize of output 41 [2023-12-21 20:32:02,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:02,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 37 [2023-12-21 20:32:02,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:02,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 45 [2023-12-21 20:32:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:32:02,714 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:32:03,087 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 42 treesize of output 40 [2023-12-21 20:32:03,109 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 194 treesize of output 186 [2023-12-21 20:32:03,155 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 40 treesize of output 38 [2023-12-21 20:32:03,159 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 96 treesize of output 94 [2023-12-21 20:32:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:32:03,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:32:03,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635673440] [2023-12-21 20:32:03,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635673440] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:32:03,191 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:32:03,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-21 20:32:03,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464266550] [2023-12-21 20:32:03,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:32:03,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 20:32:03,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:32:03,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 20:32:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-21 20:32:03,192 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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 20:32:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:32:04,453 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2023-12-21 20:32:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 20:32:04,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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 20:32:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:32:04,453 INFO L225 Difference]: With dead ends: 42 [2023-12-21 20:32:04,453 INFO L226 Difference]: Without dead ends: 40 [2023-12-21 20:32:04,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-12-21 20:32:04,455 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:32:04,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 71 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-21 20:32:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-21 20:32:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 23. [2023-12-21 20:32:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 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 20:32:04,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2023-12-21 20:32:04,460 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 16 [2023-12-21 20:32:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:32:04,460 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2023-12-21 20:32:04,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 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 20:32:04,460 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2023-12-21 20:32:04,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 20:32:04,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:32:04,461 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:32:04,467 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 20:32:04,661 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 20:32:04,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:32:04,662 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:32:04,662 INFO L85 PathProgramCache]: Analyzing trace with hash -906786412, now seen corresponding path program 2 times [2023-12-21 20:32:04,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:32:04,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826900458] [2023-12-21 20:32:04,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:32:04,662 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 20:32:04,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:32:04,664 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 20:32:04,667 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 20:32:04,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:32:04,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:32:04,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 20:32:04,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:32:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 20:32:04,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:32:04,935 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 20:32:04,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:32:04,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826900458] [2023-12-21 20:32:04,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826900458] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:32:04,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:32:04,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-21 20:32:04,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671568989] [2023-12-21 20:32:04,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:32:04,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 20:32:04,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:32:04,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 20:32:04,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-12-21 20:32:04,937 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 20:32:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:32:05,194 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2023-12-21 20:32:05,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 20:32:05,194 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 18 [2023-12-21 20:32:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:32:05,195 INFO L225 Difference]: With dead ends: 61 [2023-12-21 20:32:05,195 INFO L226 Difference]: Without dead ends: 35 [2023-12-21 20:32:05,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-21 20:32:05,196 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:32:05,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 52 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 20:32:05,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-21 20:32:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2023-12-21 20:32:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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 20:32:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-12-21 20:32:05,201 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 18 [2023-12-21 20:32:05,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:32:05,202 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-12-21 20:32:05,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 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 20:32:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-12-21 20:32:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 20:32:05,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:32:05,202 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:32:05,217 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 20:32:05,403 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 20:32:05,403 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:32:05,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:32:05,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1236756649, now seen corresponding path program 3 times [2023-12-21 20:32:05,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:32:05,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74398798] [2023-12-21 20:32:05,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:32:05,404 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 20:32:05,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:32:05,406 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 20:32:05,436 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 20:32:05,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:32:05,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:32:05,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 20:32:05,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:32:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:32:05,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:32:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:32:05,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:32:05,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74398798] [2023-12-21 20:32:05,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74398798] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:32:05,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:32:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-21 20:32:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998034227] [2023-12-21 20:32:05,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:32:05,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 20:32:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:32:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 20:32:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-12-21 20:32:05,972 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 20:32:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:32:06,416 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2023-12-21 20:32:06,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 20:32:06,417 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 20 [2023-12-21 20:32:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:32:06,417 INFO L225 Difference]: With dead ends: 68 [2023-12-21 20:32:06,417 INFO L226 Difference]: Without dead ends: 51 [2023-12-21 20:32:06,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2023-12-21 20:32:06,418 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 87 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 20:32:06,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 76 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 20:32:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-21 20:32:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2023-12-21 20:32:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 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 20:32:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2023-12-21 20:32:06,425 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 20 [2023-12-21 20:32:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:32:06,425 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2023-12-21 20:32:06,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 18 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 20:32:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2023-12-21 20:32:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 20:32:06,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:32:06,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:32:06,431 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 20:32:06,632 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 20:32:06,633 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:32:06,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:32:06,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1799832222, now seen corresponding path program 1 times [2023-12-21 20:32:06,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:32:06,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449355195] [2023-12-21 20:32:06,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:32:06,634 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 20:32:06,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:32:06,635 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 20:32:06,636 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 20:32:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:32:06,852 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-21 20:32:06,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:32:06,867 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:32:06,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:32:06,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:06,922 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 60 treesize of output 45 [2023-12-21 20:32:06,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:06,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 95 treesize of output 62 [2023-12-21 20:32:07,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:07,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 83 treesize of output 57 [2023-12-21 20:32:07,127 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:07,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 93 treesize of output 57 [2023-12-21 20:32:07,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:07,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 31 [2023-12-21 20:32:07,259 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:32:07,260 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:32:09,061 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 42 treesize of output 40 [2023-12-21 20:32:09,064 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 194 treesize of output 186 [2023-12-21 20:32:09,137 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 42 treesize of output 40 [2023-12-21 20:32:09,157 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 194 treesize of output 186 [2023-12-21 20:32:09,685 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:32:09,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:32:09,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449355195] [2023-12-21 20:32:09,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449355195] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:32:09,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:32:09,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-12-21 20:32:09,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755953257] [2023-12-21 20:32:09,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:32:09,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 20:32:09,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:32:09,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 20:32:09,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2023-12-21 20:32:09,687 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 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 20:32:13,975 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 20:32:18,772 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 20:32:23,269 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 20:32:27,325 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 20:32:31,901 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 20:32:34,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:32:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:32:34,924 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2023-12-21 20:32:34,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 20:32:34,925 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 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 22 [2023-12-21 20:32:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:32:34,925 INFO L225 Difference]: With dead ends: 65 [2023-12-21 20:32:34,925 INFO L226 Difference]: Without dead ends: 49 [2023-12-21 20:32:34,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2023-12-21 20:32:34,926 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 13 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:32:34,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 124 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 261 Invalid, 5 Unknown, 0 Unchecked, 24.6s Time] [2023-12-21 20:32:34,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-21 20:32:34,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2023-12-21 20:32:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 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 20:32:34,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2023-12-21 20:32:34,935 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 22 [2023-12-21 20:32:34,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:32:34,935 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2023-12-21 20:32:34,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 22 states have internal predecessors, (38), 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 20:32:34,935 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2023-12-21 20:32:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 20:32:34,936 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:32:34,936 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:32:34,941 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 20:32:35,141 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 20:32:35,144 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:32:35,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:32:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2140844940, now seen corresponding path program 4 times [2023-12-21 20:32:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:32:35,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [845513655] [2023-12-21 20:32:35,145 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:32:35,145 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 20:32:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:32:35,147 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 20:32:35,147 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 20:32:35,444 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:32:35,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:32:35,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-21 20:32:35,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:32:35,468 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:32:35,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-21 20:32:35,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:35,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 27 [2023-12-21 20:32:35,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:35,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 27 [2023-12-21 20:32:35,582 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:35,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 71 treesize of output 41 [2023-12-21 20:32:35,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:35,602 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 64 treesize of output 43 [2023-12-21 20:32:35,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:35,638 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 64 treesize of output 43 [2023-12-21 20:32:35,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:35,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 37 [2023-12-21 20:32:35,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:35,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 41 [2023-12-21 20:32:35,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:35,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 41 [2023-12-21 20:32:35,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:32:35,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 45 [2023-12-21 20:32:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:32:35,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:32:43,084 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 134 treesize of output 124 [2023-12-21 20:32:43,366 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2023-12-21 20:32:43,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 20070382 treesize of output 15466502 [2023-12-21 20:32:43,715 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 136 treesize of output 126 [2023-12-21 20:32:43,924 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2023-12-21 20:32:43,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 320864206 treesize of output 1 [2023-12-21 20:32:43,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:32:43,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:32:43,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [845513655] [2023-12-21 20:32:43,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [845513655] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:32:43,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:32:43,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2023-12-21 20:32:43,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406908521] [2023-12-21 20:32:43,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:32:43,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-21 20:32:43,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:32:43,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-21 20:32:43,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-12-21 20:32:43,983 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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 20:32:46,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:32:50,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:32:53,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:32:58,093 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 20:33:01,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:33:04,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:33:04,070 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2023-12-21 20:33:04,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-21 20:33:04,071 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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 22 [2023-12-21 20:33:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:33:04,073 INFO L225 Difference]: With dead ends: 97 [2023-12-21 20:33:04,073 INFO L226 Difference]: Without dead ends: 95 [2023-12-21 20:33:04,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=160, Invalid=770, Unknown=0, NotChecked=0, Total=930 [2023-12-21 20:33:04,074 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 114 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:33:04,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 113 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 240 Invalid, 2 Unknown, 0 Unchecked, 18.2s Time] [2023-12-21 20:33:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-21 20:33:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 46. [2023-12-21 20:33:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 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 20:33:04,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2023-12-21 20:33:04,096 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 22 [2023-12-21 20:33:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:33:04,096 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2023-12-21 20:33:04,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 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 20:33:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2023-12-21 20:33:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 20:33:04,097 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:33:04,097 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:33:04,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-21 20:33:04,303 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 20:33:04,303 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:33:04,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:33:04,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1374986327, now seen corresponding path program 2 times [2023-12-21 20:33:04,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:33:04,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844694914] [2023-12-21 20:33:04,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:33:04,304 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 20:33:04,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:33:04,305 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 20:33:04,306 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 20:33:04,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:33:04,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:33:04,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 20:33:04,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:33:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 20:33:04,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:33:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 20:33:05,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:33:05,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844694914] [2023-12-21 20:33:05,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844694914] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:33:05,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:33:05,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2023-12-21 20:33:05,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436119554] [2023-12-21 20:33:05,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:33:05,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-21 20:33:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:33:05,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-21 20:33:05,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2023-12-21 20:33:05,043 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 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 20:33:05,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:33:05,698 INFO L93 Difference]: Finished difference Result 107 states and 128 transitions. [2023-12-21 20:33:05,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 20:33:05,698 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 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 24 [2023-12-21 20:33:05,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:33:05,699 INFO L225 Difference]: With dead ends: 107 [2023-12-21 20:33:05,699 INFO L226 Difference]: Without dead ends: 71 [2023-12-21 20:33:05,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=273, Invalid=849, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 20:33:05,700 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 241 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 20:33:05,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 124 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 20:33:05,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-12-21 20:33:05,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 52. [2023-12-21 20:33:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2156862745098038) internal successors, (62), 51 states have internal predecessors, (62), 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 20:33:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2023-12-21 20:33:05,724 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 24 [2023-12-21 20:33:05,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:33:05,725 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2023-12-21 20:33:05,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 23 states have internal predecessors, (40), 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 20:33:05,725 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2023-12-21 20:33:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-21 20:33:05,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:33:05,728 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:33:05,736 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 20:33:05,933 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 20:33:05,934 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:33:05,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:33:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1936981952, now seen corresponding path program 3 times [2023-12-21 20:33:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:33:05,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42800641] [2023-12-21 20:33:05,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:33:05,935 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 20:33:05,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:33:05,943 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 20:33:06,002 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 20:33:06,322 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:33:06,322 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:33:06,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 20:33:06,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:33:06,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:33:06,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2023-12-21 20:33:06,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:06,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 29 [2023-12-21 20:33:06,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:06,434 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 60 treesize of output 45 [2023-12-21 20:33:06,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:06,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 95 treesize of output 62 [2023-12-21 20:33:06,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:06,526 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 100 treesize of output 82 [2023-12-21 20:33:06,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:06,707 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 99 treesize of output 76 [2023-12-21 20:33:06,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:06,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 109 treesize of output 76 [2023-12-21 20:33:06,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:06,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 29 [2023-12-21 20:33:06,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:06,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 31 [2023-12-21 20:33:07,002 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:33:07,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:33:10,369 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 58 treesize of output 56 [2023-12-21 20:33:10,371 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 1314 treesize of output 1298 [2023-12-21 20:33:10,462 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 58 treesize of output 56 [2023-12-21 20:33:10,480 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 690 treesize of output 682 [2023-12-21 20:33:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:33:10,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:33:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42800641] [2023-12-21 20:33:10,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42800641] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:33:10,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:33:10,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 26 [2023-12-21 20:33:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538298973] [2023-12-21 20:33:10,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:33:10,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 20:33:10,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:33:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 20:33:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=555, Unknown=0, NotChecked=0, Total=650 [2023-12-21 20:33:10,938 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 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 20:33:15,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.35s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:33:19,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:33:23,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:33:23,771 INFO L93 Difference]: Finished difference Result 135 states and 157 transitions. [2023-12-21 20:33:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-21 20:33:23,771 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 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 25 [2023-12-21 20:33:23,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:33:23,772 INFO L225 Difference]: With dead ends: 135 [2023-12-21 20:33:23,772 INFO L226 Difference]: Without dead ends: 133 [2023-12-21 20:33:23,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=206, Invalid=1276, Unknown=0, NotChecked=0, Total=1482 [2023-12-21 20:33:23,773 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 88 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:33:23,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 169 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2023-12-21 20:33:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-21 20:33:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 86. [2023-12-21 20:33:23,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 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 20:33:23,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2023-12-21 20:33:23,821 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 25 [2023-12-21 20:33:23,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:33:23,821 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2023-12-21 20:33:23,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 26 states have internal predecessors, (44), 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 20:33:23,821 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2023-12-21 20:33:23,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 20:33:23,822 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:33:23,822 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:33:23,831 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 20:33:24,031 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 20:33:24,032 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:33:24,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:33:24,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1738462988, now seen corresponding path program 4 times [2023-12-21 20:33:24,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:33:24,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425318861] [2023-12-21 20:33:24,033 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:33:24,033 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 20:33:24,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:33:24,034 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 20:33:24,035 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 20:33:24,349 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:33:24,349 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:33:24,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-21 20:33:24,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:33:24,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:33:24,396 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 22 treesize of output 23 [2023-12-21 20:33:24,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:24,455 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 60 treesize of output 45 [2023-12-21 20:33:24,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:24,504 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 82 treesize of output 64 [2023-12-21 20:33:24,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:24,580 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 111 treesize of output 81 [2023-12-21 20:33:24,762 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:24,762 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 99 treesize of output 76 [2023-12-21 20:33:24,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:24,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 87 treesize of output 57 [2023-12-21 20:33:24,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:24,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 93 treesize of output 57 [2023-12-21 20:33:25,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:33:25,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2023-12-21 20:33:25,247 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:33:25,247 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:33:30,791 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 42 treesize of output 40 [2023-12-21 20:33:30,793 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 194 treesize of output 186 [2023-12-21 20:33:30,872 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 42 treesize of output 40 [2023-12-21 20:33:30,887 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 90 treesize of output 86 [2023-12-21 20:33:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:33:31,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:33:31,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425318861] [2023-12-21 20:33:31,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425318861] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:33:31,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:33:31,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2023-12-21 20:33:31,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637461557] [2023-12-21 20:33:31,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:33:31,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 20:33:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:33:31,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 20:33:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2023-12-21 20:33:31,891 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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 20:33:35,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 20:33:38,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 20:33:41,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-21 20:33:48,114 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 20:33:52,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:33:56,236 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 20:33:57,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:33:57,027 INFO L93 Difference]: Finished difference Result 119 states and 139 transitions. [2023-12-21 20:33:57,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 20:33:57,028 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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 28 [2023-12-21 20:33:57,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:33:57,028 INFO L225 Difference]: With dead ends: 119 [2023-12-21 20:33:57,028 INFO L226 Difference]: Without dead ends: 98 [2023-12-21 20:33:57,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=165, Invalid=1317, Unknown=0, NotChecked=0, Total=1482 [2023-12-21 20:33:57,029 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 18 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:33:57,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 249 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 477 Invalid, 3 Unknown, 0 Unchecked, 23.2s Time] [2023-12-21 20:33:57,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-21 20:33:57,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 81. [2023-12-21 20:33:57,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2625) internal successors, (101), 80 states have internal predecessors, (101), 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 20:33:57,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2023-12-21 20:33:57,051 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 101 transitions. Word has length 28 [2023-12-21 20:33:57,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:33:57,051 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 101 transitions. [2023-12-21 20:33:57,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5625) internal successors, (50), 32 states have internal predecessors, (50), 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 20:33:57,052 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 101 transitions. [2023-12-21 20:33:57,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 20:33:57,052 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:33:57,052 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:33:57,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-12-21 20:33:57,267 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 20:33:57,267 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:33:57,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:33:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1514070647, now seen corresponding path program 5 times [2023-12-21 20:33:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:33:57,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088464610] [2023-12-21 20:33:57,268 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:33:57,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:33:57,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:33:57,269 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 20:33:57,275 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 20:33:57,838 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-12-21 20:33:57,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:33:57,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 20:33:57,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:33:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 20:33:58,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:33:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 20:33:58,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:33:58,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088464610] [2023-12-21 20:33:58,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088464610] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:33:58,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:33:58,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-12-21 20:33:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218970419] [2023-12-21 20:33:58,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:33:58,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 20:33:58,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:33:58,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 20:33:58,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2023-12-21 20:33:58,925 INFO L87 Difference]: Start difference. First operand 81 states and 101 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 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 20:34:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:34:00,857 INFO L93 Difference]: Finished difference Result 252 states and 296 transitions. [2023-12-21 20:34:00,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 20:34:00,858 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 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 28 [2023-12-21 20:34:00,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:34:00,859 INFO L225 Difference]: With dead ends: 252 [2023-12-21 20:34:00,859 INFO L226 Difference]: Without dead ends: 200 [2023-12-21 20:34:00,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=482, Invalid=1588, Unknown=0, NotChecked=0, Total=2070 [2023-12-21 20:34:00,860 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 642 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:34:00,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 274 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 20:34:00,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-12-21 20:34:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 128. [2023-12-21 20:34:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.2440944881889764) internal successors, (158), 127 states have internal predecessors, (158), 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 20:34:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 158 transitions. [2023-12-21 20:34:00,915 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 158 transitions. Word has length 28 [2023-12-21 20:34:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:34:00,915 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 158 transitions. [2023-12-21 20:34:00,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 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 20:34:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 158 transitions. [2023-12-21 20:34:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 20:34:00,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:34:00,917 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:34:00,928 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 20:34:01,125 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 20:34:01,126 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:34:01,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:34:01,126 INFO L85 PathProgramCache]: Analyzing trace with hash -595462555, now seen corresponding path program 5 times [2023-12-21 20:34:01,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:34:01,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972019497] [2023-12-21 20:34:01,127 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:34:01,128 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 20:34:01,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:34:01,130 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 20:34:01,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-21 20:34:01,691 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-21 20:34:01,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:34:01,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:34:01,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:34:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 20:34:01,928 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:34:02,515 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 20:34:02,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:34:02,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972019497] [2023-12-21 20:34:02,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [972019497] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:34:02,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:34:02,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2023-12-21 20:34:02,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359811949] [2023-12-21 20:34:02,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:34:02,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 20:34:02,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:34:02,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 20:34:02,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:34:02,517 INFO L87 Difference]: Start difference. First operand 128 states and 158 transitions. Second operand has 24 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:34:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:34:03,218 INFO L93 Difference]: Finished difference Result 178 states and 207 transitions. [2023-12-21 20:34:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-21 20:34:03,219 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-12-21 20:34:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:34:03,219 INFO L225 Difference]: With dead ends: 178 [2023-12-21 20:34:03,219 INFO L226 Difference]: Without dead ends: 151 [2023-12-21 20:34:03,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=802, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 20:34:03,222 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 343 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 20:34:03,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 155 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 20:34:03,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-12-21 20:34:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2023-12-21 20:34:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.209090909090909) internal successors, (133), 110 states have internal predecessors, (133), 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 20:34:03,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 133 transitions. [2023-12-21 20:34:03,255 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 133 transitions. Word has length 29 [2023-12-21 20:34:03,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:34:03,255 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 133 transitions. [2023-12-21 20:34:03,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:34:03,255 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 133 transitions. [2023-12-21 20:34:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 20:34:03,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:34:03,255 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:34:03,262 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 (13)] Ended with exit code 0 [2023-12-21 20:34:03,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:34:03,462 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:34:03,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:34:03,463 INFO L85 PathProgramCache]: Analyzing trace with hash 54720150, now seen corresponding path program 6 times [2023-12-21 20:34:03,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:34:03,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645024159] [2023-12-21 20:34:03,464 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:34:03,464 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 20:34:03,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:34:03,476 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:34:03,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-21 20:34:03,792 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-12-21 20:34:03,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:34:03,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-21 20:34:03,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:34:03,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:34:03,827 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 22 treesize of output 23 [2023-12-21 20:34:03,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:03,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 29 [2023-12-21 20:34:03,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:03,922 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 60 treesize of output 45 [2023-12-21 20:34:03,985 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:03,985 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 82 treesize of output 64 [2023-12-21 20:34:04,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:04,067 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 111 treesize of output 81 [2023-12-21 20:34:04,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:04,160 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 116 treesize of output 101 [2023-12-21 20:34:04,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:04,449 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 115 treesize of output 95 [2023-12-21 20:34:04,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:04,578 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 103 treesize of output 76 [2023-12-21 20:34:05,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:05,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 109 treesize of output 76 [2023-12-21 20:34:05,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:05,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 119 treesize of output 89 [2023-12-21 20:34:05,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:05,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2023-12-21 20:34:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:34:05,676 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:34:14,057 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 58 treesize of output 56 [2023-12-21 20:34:14,059 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 318 treesize of output 314 [2023-12-21 20:34:14,133 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 58 treesize of output 56 [2023-12-21 20:34:14,151 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 1314 treesize of output 1298 [2023-12-21 20:34:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:34:15,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:34:15,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645024159] [2023-12-21 20:34:15,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645024159] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:34:15,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:34:15,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 38 [2023-12-21 20:34:15,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253308373] [2023-12-21 20:34:15,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:34:15,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-21 20:34:15,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:34:15,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-21 20:34:15,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 20:34:15,117 INFO L87 Difference]: Start difference. First operand 111 states and 133 transitions. Second operand has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 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 20:34:31,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:34:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:34:32,661 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2023-12-21 20:34:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-21 20:34:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 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 31 [2023-12-21 20:34:32,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:34:32,663 INFO L225 Difference]: With dead ends: 195 [2023-12-21 20:34:32,663 INFO L226 Difference]: Without dead ends: 193 [2023-12-21 20:34:32,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=267, Invalid=2385, Unknown=0, NotChecked=0, Total=2652 [2023-12-21 20:34:32,664 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 72 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:34:32,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 280 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-12-21 20:34:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-21 20:34:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 149. [2023-12-21 20:34:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.1824324324324325) internal successors, (175), 148 states have internal predecessors, (175), 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 20:34:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 175 transitions. [2023-12-21 20:34:32,715 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 175 transitions. Word has length 31 [2023-12-21 20:34:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:34:32,715 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 175 transitions. [2023-12-21 20:34:32,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 38 states have internal predecessors, (56), 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 20:34:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 175 transitions. [2023-12-21 20:34:32,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-21 20:34:32,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:34:32,716 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:34:32,724 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 (14)] Forceful destruction successful, exit code 0 [2023-12-21 20:34:32,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:34:32,924 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:34:32,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:34:32,924 INFO L85 PathProgramCache]: Analyzing trace with hash -991377105, now seen corresponding path program 7 times [2023-12-21 20:34:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:34:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861610955] [2023-12-21 20:34:32,925 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 20:34:32,925 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 20:34:32,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:34:32,926 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:34:32,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-21 20:34:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:34:33,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-21 20:34:33,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:34:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 20:34:33,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:34:34,550 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 20:34:34,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:34:34,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861610955] [2023-12-21 20:34:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861610955] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:34:34,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:34:34,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-12-21 20:34:34,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142341056] [2023-12-21 20:34:34,551 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:34:34,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 20:34:34,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:34:34,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 20:34:34,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=758, Unknown=0, NotChecked=0, Total=992 [2023-12-21 20:34:34,552 INFO L87 Difference]: Start difference. First operand 149 states and 175 transitions. Second operand has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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 20:34:36,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:34:36,572 INFO L93 Difference]: Finished difference Result 317 states and 364 transitions. [2023-12-21 20:34:36,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-21 20:34:36,572 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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 31 [2023-12-21 20:34:36,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:34:36,573 INFO L225 Difference]: With dead ends: 317 [2023-12-21 20:34:36,573 INFO L226 Difference]: Without dead ends: 237 [2023-12-21 20:34:36,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=512, Invalid=1840, Unknown=0, NotChecked=0, Total=2352 [2023-12-21 20:34:36,576 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 384 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-21 20:34:36,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 664 Invalid, 1564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-21 20:34:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-21 20:34:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 157. [2023-12-21 20:34:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.1602564102564104) internal successors, (181), 156 states have internal predecessors, (181), 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 20:34:36,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 181 transitions. [2023-12-21 20:34:36,634 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 181 transitions. Word has length 31 [2023-12-21 20:34:36,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:34:36,634 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 181 transitions. [2023-12-21 20:34:36,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 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 20:34:36,634 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 181 transitions. [2023-12-21 20:34:36,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 20:34:36,634 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:34:36,634 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:34:36,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-21 20:34:36,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:34:36,842 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:34:36,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:34:36,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1914336546, now seen corresponding path program 8 times [2023-12-21 20:34:36,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:34:36,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120367438] [2023-12-21 20:34:36,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:34:36,843 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 20:34:36,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:34:36,846 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:34:36,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-21 20:34:37,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:34:37,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:34:37,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-21 20:34:37,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:34:37,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-21 20:34:37,344 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 22 treesize of output 23 [2023-12-21 20:34:37,400 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:37,401 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 60 treesize of output 45 [2023-12-21 20:34:37,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:37,471 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 82 treesize of output 64 [2023-12-21 20:34:37,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:37,578 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 98 treesize of output 83 [2023-12-21 20:34:37,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:37,691 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 127 treesize of output 100 [2023-12-21 20:34:37,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:37,978 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 115 treesize of output 95 [2023-12-21 20:34:38,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:38,112 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 103 treesize of output 76 [2023-12-21 20:34:38,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:38,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 87 treesize of output 57 [2023-12-21 20:34:38,317 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:38,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 93 treesize of output 57 [2023-12-21 20:34:38,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:34:38,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 81 [2023-12-21 20:34:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:34:38,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:34:50,969 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 42 treesize of output 40 [2023-12-21 20:34:50,971 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 90 treesize of output 86 [2023-12-21 20:34:51,039 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 42 treesize of output 40 [2023-12-21 20:34:51,056 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 194 treesize of output 186 [2023-12-21 20:34:52,613 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:34:52,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:34:52,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120367438] [2023-12-21 20:34:52,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120367438] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:34:52,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:34:52,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 40 [2023-12-21 20:34:52,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630921306] [2023-12-21 20:34:52,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:34:52,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-21 20:34:52,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:34:52,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-21 20:34:52,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1411, Unknown=1, NotChecked=0, Total=1560 [2023-12-21 20:34:52,615 INFO L87 Difference]: Start difference. First operand 157 states and 181 transitions. Second operand has 40 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 20:34:58,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-21 20:35:02,077 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 [0, 1] [2023-12-21 20:35:16,166 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 20:35:21,002 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 20:35:24,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:35:27,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:35:27,145 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2023-12-21 20:35:27,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-21 20:35:27,146 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 34 [2023-12-21 20:35:27,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:35:27,146 INFO L225 Difference]: With dead ends: 192 [2023-12-21 20:35:27,147 INFO L226 Difference]: Without dead ends: 166 [2023-12-21 20:35:27,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=226, Invalid=2223, Unknown=1, NotChecked=0, Total=2450 [2023-12-21 20:35:27,149 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 41 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 37 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:35:27,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 368 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 732 Invalid, 3 Unknown, 0 Unchecked, 25.6s Time] [2023-12-21 20:35:27,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-21 20:35:27,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 136. [2023-12-21 20:35:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.1777777777777778) internal successors, (159), 135 states have internal predecessors, (159), 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 20:35:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2023-12-21 20:35:27,208 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 34 [2023-12-21 20:35:27,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:35:27,208 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2023-12-21 20:35:27,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.55) internal successors, (62), 40 states have internal predecessors, (62), 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 20:35:27,208 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2023-12-21 20:35:27,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 20:35:27,209 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:35:27,209 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:35:27,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-12-21 20:35:27,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:35:27,417 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:35:27,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:35:27,417 INFO L85 PathProgramCache]: Analyzing trace with hash 219772916, now seen corresponding path program 6 times [2023-12-21 20:35:27,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:35:27,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154802446] [2023-12-21 20:35:27,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:35:27,417 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 20:35:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:35:27,418 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:35:27,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-21 20:35:28,006 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-12-21 20:35:28,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:35:28,033 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-21 20:35:28,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:35:28,053 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:35:28,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2023-12-21 20:35:28,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 27 [2023-12-21 20:35:28,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 27 [2023-12-21 20:35:28,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 27 [2023-12-21 20:35:28,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 27 [2023-12-21 20:35:28,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 27 [2023-12-21 20:35:28,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 51 treesize of output 27 [2023-12-21 20:35:28,307 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 71 treesize of output 41 [2023-12-21 20:35:28,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,329 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 64 treesize of output 43 [2023-12-21 20:35:28,414 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,414 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 64 treesize of output 43 [2023-12-21 20:35:28,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,476 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 64 treesize of output 43 [2023-12-21 20:35:28,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,536 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 64 treesize of output 43 [2023-12-21 20:35:28,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,603 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 64 treesize of output 43 [2023-12-21 20:35:28,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,655 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 64 treesize of output 43 [2023-12-21 20:35:28,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 67 treesize of output 37 [2023-12-21 20:35:28,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 41 [2023-12-21 20:35:28,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 41 [2023-12-21 20:35:28,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 41 [2023-12-21 20:35:28,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 41 [2023-12-21 20:35:28,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:28,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 41 [2023-12-21 20:35:29,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:29,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 65 treesize of output 41 [2023-12-21 20:35:29,130 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:35:29,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 45 [2023-12-21 20:35:29,195 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:35:29,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:37:33,411 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 324 treesize of output 298