/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/s12if.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 20:52:28,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 20:52:28,838 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:52:28,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 20:52:28,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 20:52:28,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 20:52:28,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 20:52:28,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 20:52:28,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 20:52:28,866 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 20:52:28,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 20:52:28,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 20:52:28,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 20:52:28,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 20:52:28,867 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 20:52:28,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 20:52:28,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 20:52:28,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 20:52:28,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 20:52:28,868 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 20:52:28,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 20:52:28,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 20:52:28,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 20:52:28,869 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-21 20:52:28,869 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-21 20:52:28,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 20:52:28,870 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-21 20:52:28,870 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 20:52:28,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 20:52:28,870 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 20:52:28,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 20:52:28,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 20:52:28,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 20:52:28,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 20:52:28,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:52:28,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 20:52:28,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 20:52:28,871 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 20:52:28,871 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-21 20:52:28,872 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-21 20:52:28,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 20:52:28,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 20:52:28,872 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 20:52:28,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 20:52:28,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 20:52:28,872 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-21 20:52:28,872 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:52:29,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 20:52:29,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 20:52:29,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 20:52:29,084 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 20:52:29,084 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 20:52:29,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s12if.c [2023-12-21 20:52:30,023 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 20:52:30,183 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 20:52:30,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s12if.c [2023-12-21 20:52:30,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14bd457fc/3f327541ede24a0886cc11fa976f9d36/FLAG33891c5d8 [2023-12-21 20:52:30,200 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14bd457fc/3f327541ede24a0886cc11fa976f9d36 [2023-12-21 20:52:30,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 20:52:30,203 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 20:52:30,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 20:52:30,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 20:52:30,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 20:52:30,212 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,213 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a210d8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30, skipping insertion in model container [2023-12-21 20:52:30,213 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,228 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 20:52:30,343 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/s12if.c[588,601] [2023-12-21 20:52:30,366 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:52:30,376 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 20:52:30,385 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/s12if.c[588,601] [2023-12-21 20:52:30,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 20:52:30,407 INFO L206 MainTranslator]: Completed translation [2023-12-21 20:52:30,407 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30 WrapperNode [2023-12-21 20:52:30,408 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 20:52:30,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 20:52:30,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 20:52:30,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 20:52:30,413 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:52:30" (1/1) ... [2023-12-21 20:52:30,420 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:52:30" (1/1) ... [2023-12-21 20:52:30,434 INFO L138 Inliner]: procedures = 21, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 97 [2023-12-21 20:52:30,434 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 20:52:30,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 20:52:30,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 20:52:30,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 20:52:30,441 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,452 INFO L175 MemorySlicer]: Split 25 memory accesses to 4 slices as follows [2, 8, 9, 6]. 36 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8, 0, 0]. The 6 writes are split as follows [0, 0, 3, 3]. [2023-12-21 20:52:30,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,458 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 20:52:30,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 20:52:30,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 20:52:30,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 20:52:30,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (1/1) ... [2023-12-21 20:52:30,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 20:52:30,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 20:52:30,497 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:52:30,498 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:52:30,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#0 [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#1 [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#2 [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8#3 [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-21 20:52:30,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 20:52:30,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#0 [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#1 [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#2 [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8#3 [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-21 20:52:30,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-21 20:52:30,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-21 20:52:30,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-21 20:52:30,576 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 20:52:30,578 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 20:52:30,876 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 20:52:30,892 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 20:52:30,893 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-21 20:52:30,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:52:30 BoogieIcfgContainer [2023-12-21 20:52:30,893 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 20:52:30,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 20:52:30,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 20:52:30,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 20:52:30,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:52:30" (1/3) ... [2023-12-21 20:52:30,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ede44f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:52:30, skipping insertion in model container [2023-12-21 20:52:30,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:52:30" (2/3) ... [2023-12-21 20:52:30,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ede44f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:52:30, skipping insertion in model container [2023-12-21 20:52:30,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:52:30" (3/3) ... [2023-12-21 20:52:30,899 INFO L112 eAbstractionObserver]: Analyzing ICFG s12if.c [2023-12-21 20:52:30,911 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 20:52:30,911 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 20:52:30,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 20:52:30,944 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;@5493e3f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 20:52:30,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 20:52:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:52:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 20:52:30,952 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:30,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:30,953 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:30,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:30,958 INFO L85 PathProgramCache]: Analyzing trace with hash 845365045, now seen corresponding path program 1 times [2023-12-21 20:52:30,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:30,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179729629] [2023-12-21 20:52:30,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:52:30,966 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:52:30,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:30,968 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:52:30,971 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:52:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:52:31,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 20:52:31,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:31,082 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:52:31,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:52:31,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:52:31,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [179729629] [2023-12-21 20:52:31,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [179729629] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:52:31,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:52:31,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 20:52:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565995305] [2023-12-21 20:52:31,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:52:31,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 20:52:31,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:52:31,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 20:52:31,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 20:52:31,113 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:52:31,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:52:31,134 INFO L93 Difference]: Finished difference Result 37 states and 55 transitions. [2023-12-21 20:52:31,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 20:52:31,136 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-21 20:52:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:52:31,143 INFO L225 Difference]: With dead ends: 37 [2023-12-21 20:52:31,143 INFO L226 Difference]: Without dead ends: 17 [2023-12-21 20:52:31,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:52:31,148 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 20:52:31,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 20:52:31,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-21 20:52:31,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-12-21 20:52:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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:52:31,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2023-12-21 20:52:31,168 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 12 [2023-12-21 20:52:31,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:52:31,168 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2023-12-21 20:52:31,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 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:52:31,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2023-12-21 20:52:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-21 20:52:31,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:31,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:31,172 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:52:31,372 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:52:31,372 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:31,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash 452010334, now seen corresponding path program 1 times [2023-12-21 20:52:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366342049] [2023-12-21 20:52:31,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:52:31,374 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:52:31,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:31,377 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:52:31,404 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:52:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:52:31,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 20:52:31,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:31,566 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:52:31,566 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 20:52:31,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:52:31,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366342049] [2023-12-21 20:52:31,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1366342049] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 20:52:31,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 20:52:31,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 20:52:31,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106709617] [2023-12-21 20:52:31,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 20:52:31,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 20:52:31,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:52:31,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 20:52:31,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-21 20:52:31,576 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:52:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:52:31,775 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2023-12-21 20:52:31,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 20:52:31,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-21 20:52:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:52:31,784 INFO L225 Difference]: With dead ends: 36 [2023-12-21 20:52:31,784 INFO L226 Difference]: Without dead ends: 24 [2023-12-21 20:52:31,784 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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:52:31,785 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:52:31,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 11 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 20:52:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-21 20:52:31,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2023-12-21 20:52:31,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:52:31,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-21 20:52:31,789 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 12 [2023-12-21 20:52:31,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:52:31,789 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-21 20:52:31,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:52:31,789 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-21 20:52:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 20:52:31,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:31,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:31,794 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:52:31,990 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:52:31,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:31,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:31,991 INFO L85 PathProgramCache]: Analyzing trace with hash 678183220, now seen corresponding path program 1 times [2023-12-21 20:52:31,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:31,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43865512] [2023-12-21 20:52:31,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:52:31,992 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:52:31,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:31,993 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:52:31,994 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:52:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:52:32,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 20:52:32,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:32,162 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:52:32,167 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 18 treesize of output 19 [2023-12-21 20:52:32,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 20:52:32,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 20:52:32,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:32,645 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:52:32,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:32,767 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 79 treesize of output 49 [2023-12-21 20:52:32,800 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:52:32,800 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:52:33,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2023-12-21 20:52:33,335 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 102 treesize of output 98 [2023-12-21 20:52:33,760 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:52:33,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:52:33,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43865512] [2023-12-21 20:52:33,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43865512] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:52:33,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:52:33,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-12-21 20:52:33,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798406530] [2023-12-21 20:52:33,761 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:52:33,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 20:52:33,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:52:33,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 20:52:33,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-12-21 20:52:33,763 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 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:52:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:52:37,788 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2023-12-21 20:52:37,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 20:52:37,788 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 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 19 [2023-12-21 20:52:37,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:52:37,790 INFO L225 Difference]: With dead ends: 72 [2023-12-21 20:52:37,790 INFO L226 Difference]: Without dead ends: 61 [2023-12-21 20:52:37,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=212, Invalid=910, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 20:52:37,791 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 68 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:52:37,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 53 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-21 20:52:37,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-21 20:52:37,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2023-12-21 20:52:37,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 34 states have internal predecessors, (46), 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:52:37,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2023-12-21 20:52:37,799 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 19 [2023-12-21 20:52:37,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:52:37,799 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2023-12-21 20:52:37,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 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:52:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2023-12-21 20:52:37,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 20:52:37,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:37,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:37,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-21 20:52:38,004 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:52:38,004 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:38,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:38,005 INFO L85 PathProgramCache]: Analyzing trace with hash 735441522, now seen corresponding path program 1 times [2023-12-21 20:52:38,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:38,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724887071] [2023-12-21 20:52:38,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:52:38,006 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:52:38,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:38,006 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:52:38,008 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:52:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:52:38,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 20:52:38,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:38,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 20:52:38,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 20:52:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:52:38,156 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:52:38,218 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 14 treesize of output 12 [2023-12-21 20:52:38,220 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 18 treesize of output 16 [2023-12-21 20:52:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:52:38,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:52:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724887071] [2023-12-21 20:52:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724887071] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:52:38,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:52:38,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-12-21 20:52:38,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310641851] [2023-12-21 20:52:38,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:52:38,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 20:52:38,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:52:38,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 20:52:38,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-21 20:52:38,236 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:52:38,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:52:38,877 INFO L93 Difference]: Finished difference Result 76 states and 97 transitions. [2023-12-21 20:52:38,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 20:52:38,883 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-21 20:52:38,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:52:38,884 INFO L225 Difference]: With dead ends: 76 [2023-12-21 20:52:38,884 INFO L226 Difference]: Without dead ends: 64 [2023-12-21 20:52:38,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-12-21 20:52:38,885 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:52:38,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 78 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 20:52:38,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-21 20:52:38,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 42. [2023-12-21 20:52:38,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 41 states have internal predecessors, (54), 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:52:38,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2023-12-21 20:52:38,893 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 19 [2023-12-21 20:52:38,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:52:38,893 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2023-12-21 20:52:38,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:52:38,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2023-12-21 20:52:38,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-21 20:52:38,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:38,893 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:38,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-21 20:52:39,097 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:52:39,097 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:39,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:39,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1379247798, now seen corresponding path program 1 times [2023-12-21 20:52:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:39,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856334987] [2023-12-21 20:52:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:52:39,099 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:52:39,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:39,100 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:52:39,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-21 20:52:39,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:52:39,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-21 20:52:39,161 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:39,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-21 20:52:39,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:52:39,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:52:39,226 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 14 treesize of output 12 [2023-12-21 20:52:39,228 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 18 treesize of output 16 [2023-12-21 20:52:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:52:39,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:52:39,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856334987] [2023-12-21 20:52:39,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856334987] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:52:39,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:52:39,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-21 20:52:39,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802026874] [2023-12-21 20:52:39,241 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:52:39,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 20:52:39,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:52:39,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 20:52:39,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-21 20:52:39,242 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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:52:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:52:39,501 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2023-12-21 20:52:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 20:52:39,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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 19 [2023-12-21 20:52:39,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:52:39,508 INFO L225 Difference]: With dead ends: 57 [2023-12-21 20:52:39,508 INFO L226 Difference]: Without dead ends: 45 [2023-12-21 20:52:39,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-21 20:52:39,509 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 7 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:52:39,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 48 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 20:52:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-12-21 20:52:39,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-12-21 20:52:39,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 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:52:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2023-12-21 20:52:39,517 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 19 [2023-12-21 20:52:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:52:39,517 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2023-12-21 20:52:39,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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:52:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2023-12-21 20:52:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-21 20:52:39,518 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:39,518 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:39,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-21 20:52:39,724 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:52:39,724 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:39,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:39,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1950697993, now seen corresponding path program 2 times [2023-12-21 20:52:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:39,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984245595] [2023-12-21 20:52:39,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:52:39,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:52:39,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:39,726 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:52:39,727 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:52:39,786 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:52:39,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:52:39,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 20:52:39,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:52:39,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:52:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:52:40,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:52:40,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984245595] [2023-12-21 20:52:40,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984245595] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:52:40,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:52:40,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-12-21 20:52:40,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945384097] [2023-12-21 20:52:40,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:52:40,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 20:52:40,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:52:40,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 20:52:40,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-21 20:52:40,012 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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:52:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:52:40,361 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2023-12-21 20:52:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 20:52:40,369 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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 20 [2023-12-21 20:52:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:52:40,370 INFO L225 Difference]: With dead ends: 58 [2023-12-21 20:52:40,370 INFO L226 Difference]: Without dead ends: 48 [2023-12-21 20:52:40,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-12-21 20:52:40,371 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 79 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:52:40,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 21 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 20:52:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-12-21 20:52:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2023-12-21 20:52:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 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:52:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2023-12-21 20:52:40,387 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 20 [2023-12-21 20:52:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:52:40,388 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2023-12-21 20:52:40,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 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:52:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2023-12-21 20:52:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-21 20:52:40,388 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:40,388 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:40,391 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:52:40,591 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:52:40,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:40,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:40,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1769185541, now seen corresponding path program 3 times [2023-12-21 20:52:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:40,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23080721] [2023-12-21 20:52:40,592 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:52:40,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:52:40,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:40,593 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:52:40,594 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:52:40,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-21 20:52:40,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:52:40,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-21 20:52:40,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:52:40,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:52:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:52:41,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:52:41,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23080721] [2023-12-21 20:52:41,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23080721] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:52:41,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:52:41,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-21 20:52:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055944544] [2023-12-21 20:52:41,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:52:41,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 20:52:41,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:52:41,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 20:52:41,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-12-21 20:52:41,042 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 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:52:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:52:41,542 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2023-12-21 20:52:41,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 20:52:41,542 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 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 22 [2023-12-21 20:52:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:52:41,543 INFO L225 Difference]: With dead ends: 63 [2023-12-21 20:52:41,543 INFO L226 Difference]: Without dead ends: 35 [2023-12-21 20:52:41,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2023-12-21 20:52:41,544 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 76 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 20:52:41,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 21 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 20:52:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-12-21 20:52:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2023-12-21 20:52:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 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:52:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2023-12-21 20:52:41,550 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 22 [2023-12-21 20:52:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:52:41,550 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-12-21 20:52:41,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.5) internal successors, (40), 16 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:52:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2023-12-21 20:52:41,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 20:52:41,550 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:41,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:41,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-21 20:52:41,754 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:52:41,754 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:41,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:41,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1237862050, now seen corresponding path program 4 times [2023-12-21 20:52:41,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:41,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937049806] [2023-12-21 20:52:41,755 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:52:41,755 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:52:41,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:41,756 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:52:41,756 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:52:41,822 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:52:41,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:52:41,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-21 20:52:41,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:41,857 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:52:41,858 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 18 treesize of output 19 [2023-12-21 20:52:42,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-21 20:52:42,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:42,333 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:52:42,508 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:42,508 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 81 treesize of output 51 [2023-12-21 20:52:42,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:42,587 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 107 treesize of output 77 [2023-12-21 20:52:42,615 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:52:42,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:52:43,571 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 138 treesize of output 130 [2023-12-21 20:52:43,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:52:43,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 223 [2023-12-21 20:52:44,933 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:52:44,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:52:44,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937049806] [2023-12-21 20:52:44,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937049806] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:52:44,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:52:44,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-12-21 20:52:44,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804591529] [2023-12-21 20:52:44,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:52:44,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 20:52:44,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:52:44,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 20:52:44,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2023-12-21 20:52:44,935 INFO L87 Difference]: Start difference. First operand 33 states and 40 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:52:48,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-21 20:52:53,511 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:52:57,536 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:52:59,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:52:59,585 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2023-12-21 20:52:59,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-21 20:52:59,586 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 26 [2023-12-21 20:52:59,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:52:59,586 INFO L225 Difference]: With dead ends: 86 [2023-12-21 20:52:59,586 INFO L226 Difference]: Without dead ends: 69 [2023-12-21 20:52:59,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=416, Invalid=2236, Unknown=0, NotChecked=0, Total=2652 [2023-12-21 20:52:59,588 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 75 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 46 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:52:59,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 70 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 464 Invalid, 2 Unknown, 0 Unchecked, 11.6s Time] [2023-12-21 20:52:59,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-21 20:52:59,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2023-12-21 20:52:59,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:52:59,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2023-12-21 20:52:59,597 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 26 [2023-12-21 20:52:59,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:52:59,597 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2023-12-21 20:52:59,597 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:52:59,597 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2023-12-21 20:52:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 20:52:59,597 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:52:59,597 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:52:59,601 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:52:59,800 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:52:59,801 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:52:59,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:52:59,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1180603748, now seen corresponding path program 1 times [2023-12-21 20:52:59,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:52:59,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [187285695] [2023-12-21 20:52:59,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:52:59,802 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:52:59,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:52:59,803 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:52:59,803 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:52:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:52:59,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 20:52:59,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:52:59,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-21 20:52:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:52:59,981 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:53:00,100 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 29 treesize of output 25 [2023-12-21 20:53:00,107 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:53:00,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2023-12-21 20:53:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-21 20:53:00,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:53:00,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [187285695] [2023-12-21 20:53:00,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [187285695] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:53:00,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:53:00,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-21 20:53:00,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468805289] [2023-12-21 20:53:00,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:53:00,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 20:53:00,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:53:00,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 20:53:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-12-21 20:53:00,147 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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:53:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:53:00,827 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2023-12-21 20:53:00,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 20:53:00,833 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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 26 [2023-12-21 20:53:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:53:00,834 INFO L225 Difference]: With dead ends: 91 [2023-12-21 20:53:00,834 INFO L226 Difference]: Without dead ends: 84 [2023-12-21 20:53:00,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-21 20:53:00,835 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 48 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:53:00,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 87 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 20:53:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-21 20:53:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 62. [2023-12-21 20:53:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 61 states have internal predecessors, (75), 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:53:00,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2023-12-21 20:53:00,844 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 26 [2023-12-21 20:53:00,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:53:00,845 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2023-12-21 20:53:00,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 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:53:00,845 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2023-12-21 20:53:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 20:53:00,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:53:00,845 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:53:00,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-21 20:53:01,049 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:53:01,050 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:53:01,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:53:01,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2045987996, now seen corresponding path program 1 times [2023-12-21 20:53:01,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:53:01,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253179590] [2023-12-21 20:53:01,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:53:01,051 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:53:01,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:53:01,052 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:53:01,053 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:53:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:53:01,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 20:53:01,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:53:01,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 20:53:01,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 20:53:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 20:53:01,209 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:53:01,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-21 20:53:01,262 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 20 treesize of output 16 [2023-12-21 20:53:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 20:53:01,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:53:01,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253179590] [2023-12-21 20:53:01,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253179590] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:53:01,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:53:01,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-21 20:53:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614208723] [2023-12-21 20:53:01,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:53:01,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 20:53:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:53:01,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 20:53:01,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-21 20:53:01,290 INFO L87 Difference]: Start difference. First operand 62 states and 75 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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:53:01,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:53:01,664 INFO L93 Difference]: Finished difference Result 83 states and 101 transitions. [2023-12-21 20:53:01,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 20:53:01,673 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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 26 [2023-12-21 20:53:01,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:53:01,673 INFO L225 Difference]: With dead ends: 83 [2023-12-21 20:53:01,673 INFO L226 Difference]: Without dead ends: 61 [2023-12-21 20:53:01,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-21 20:53:01,674 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 20:53:01,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 61 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 20:53:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-21 20:53:01,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-12-21 20:53:01,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 56 states have internal predecessors, (67), 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:53:01,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2023-12-21 20:53:01,684 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 26 [2023-12-21 20:53:01,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:53:01,686 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2023-12-21 20:53:01,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 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:53:01,686 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2023-12-21 20:53:01,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-21 20:53:01,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:53:01,687 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:53:01,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-21 20:53:01,890 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:53:01,891 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:53:01,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:53:01,891 INFO L85 PathProgramCache]: Analyzing trace with hash -939265221, now seen corresponding path program 5 times [2023-12-21 20:53:01,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:53:01,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054044760] [2023-12-21 20:53:01,891 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:53:01,892 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:53:01,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:53:01,892 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:53:01,893 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:53:01,962 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-12-21 20:53:01,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:53:01,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 20:53:01,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:53:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 20:53:02,119 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:53:02,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 20:53:02,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:53:02,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054044760] [2023-12-21 20:53:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054044760] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:53:02,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:53:02,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2023-12-21 20:53:02,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483489503] [2023-12-21 20:53:02,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:53:02,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 20:53:02,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:53:02,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 20:53:02,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2023-12-21 20:53:02,485 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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:53:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:53:03,982 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2023-12-21 20:53:03,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-21 20:53:03,983 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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 27 [2023-12-21 20:53:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:53:03,983 INFO L225 Difference]: With dead ends: 135 [2023-12-21 20:53:03,984 INFO L226 Difference]: Without dead ends: 108 [2023-12-21 20:53:03,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 20:53:03,984 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 264 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:53:03,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 31 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-21 20:53:03,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-21 20:53:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-12-21 20:53:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.2247191011235956) internal successors, (109), 89 states have internal predecessors, (109), 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:53:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 109 transitions. [2023-12-21 20:53:04,007 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 109 transitions. Word has length 27 [2023-12-21 20:53:04,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:53:04,007 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 109 transitions. [2023-12-21 20:53:04,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 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:53:04,008 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2023-12-21 20:53:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-12-21 20:53:04,008 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:53:04,008 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:53:04,011 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:53:04,211 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:53:04,211 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:53:04,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:53:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash 979910811, now seen corresponding path program 6 times [2023-12-21 20:53:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:53:04,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027556074] [2023-12-21 20:53:04,212 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:53:04,212 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:53:04,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:53:04,213 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:53:04,214 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:53:04,298 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-12-21 20:53:04,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:53:04,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-21 20:53:04,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:53:04,465 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 20:53:04,465 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:53:04,722 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 20:53:04,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:53:04,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027556074] [2023-12-21 20:53:04,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027556074] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:53:04,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:53:04,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-21 20:53:04,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764669456] [2023-12-21 20:53:04,722 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:53:04,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 20:53:04,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:53:04,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 20:53:04,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2023-12-21 20:53:04,724 INFO L87 Difference]: Start difference. First operand 90 states and 109 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:53:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:53:05,391 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2023-12-21 20:53:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 20:53:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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) Word has length 29 [2023-12-21 20:53:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:53:05,392 INFO L225 Difference]: With dead ends: 104 [2023-12-21 20:53:05,392 INFO L226 Difference]: Without dead ends: 81 [2023-12-21 20:53:05,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:53:05,393 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 87 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:53:05,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 27 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 20:53:05,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-21 20:53:05,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2023-12-21 20:53:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 78 states have internal predecessors, (97), 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:53:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2023-12-21 20:53:05,405 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 29 [2023-12-21 20:53:05,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:53:05,405 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2023-12-21 20:53:05,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:53:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2023-12-21 20:53:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-21 20:53:05,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:53:05,406 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:53:05,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-21 20:53:05,609 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:53:05,609 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:53:05,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:53:05,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2065802316, now seen corresponding path program 7 times [2023-12-21 20:53:05,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:53:05,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422567681] [2023-12-21 20:53:05,610 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 20:53:05,610 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:53:05,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:53:05,611 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:53:05,628 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:53:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:53:05,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 39 conjunts are in the unsatisfiable core [2023-12-21 20:53:05,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:53:05,746 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:53:05,747 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 18 treesize of output 19 [2023-12-21 20:53:06,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-21 20:53:06,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:06,383 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:53:06,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:06,626 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 81 treesize of output 51 [2023-12-21 20:53:06,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:06,875 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 109 treesize of output 79 [2023-12-21 20:53:06,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:06,963 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 163 treesize of output 133 [2023-12-21 20:53:06,997 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:53:06,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:53:09,252 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 243 treesize of output 233 [2023-12-21 20:53:09,289 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:09,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 416 treesize of output 426 [2023-12-21 20:53:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:53:12,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:53:12,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422567681] [2023-12-21 20:53:12,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422567681] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:53:12,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:53:12,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 42 [2023-12-21 20:53:12,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741355643] [2023-12-21 20:53:12,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:53:12,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-21 20:53:12,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:53:12,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-21 20:53:12,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1498, Unknown=0, NotChecked=0, Total=1722 [2023-12-21 20:53:12,276 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 42 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:53:21,885 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:53:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:53:25,348 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2023-12-21 20:53:25,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-21 20:53:25,349 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 42 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-21 20:53:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:53:25,349 INFO L225 Difference]: With dead ends: 122 [2023-12-21 20:53:25,349 INFO L226 Difference]: Without dead ends: 116 [2023-12-21 20:53:25,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=598, Invalid=3692, Unknown=0, NotChecked=0, Total=4290 [2023-12-21 20:53:25,351 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 93 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 85 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:53:25,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 96 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 948 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2023-12-21 20:53:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-21 20:53:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 88. [2023-12-21 20:53:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2298850574712643) internal successors, (107), 87 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:53:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 107 transitions. [2023-12-21 20:53:25,382 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 107 transitions. Word has length 33 [2023-12-21 20:53:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:53:25,382 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 107 transitions. [2023-12-21 20:53:25,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 42 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:53:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2023-12-21 20:53:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-21 20:53:25,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:53:25,383 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:53:25,390 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:53:25,583 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:53:25,584 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:53:25,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:53:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2008544014, now seen corresponding path program 2 times [2023-12-21 20:53:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:53:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1563327178] [2023-12-21 20:53:25,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:53:25,585 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:53:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:53:25,587 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:53:25,587 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:53:25,686 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:53:25,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:53:25,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 20:53:25,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:53:25,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-21 20:53:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:53:25,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:53:25,959 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 29 treesize of output 25 [2023-12-21 20:53:25,964 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:53:25,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2023-12-21 20:53:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 20:53:26,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:53:26,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1563327178] [2023-12-21 20:53:26,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1563327178] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:53:26,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:53:26,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-12-21 20:53:26,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862748472] [2023-12-21 20:53:26,022 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:53:26,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 20:53:26,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:53:26,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 20:53:26,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-12-21 20:53:26,022 INFO L87 Difference]: Start difference. First operand 88 states and 107 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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:53:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:53:26,964 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2023-12-21 20:53:26,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 20:53:26,971 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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 33 [2023-12-21 20:53:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:53:26,972 INFO L225 Difference]: With dead ends: 123 [2023-12-21 20:53:26,972 INFO L226 Difference]: Without dead ends: 108 [2023-12-21 20:53:26,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-12-21 20:53:26,973 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 50 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:53:26,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 79 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-21 20:53:26,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-21 20:53:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2023-12-21 20:53:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.2183908045977012) internal successors, (106), 87 states have internal predecessors, (106), 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:53:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 106 transitions. [2023-12-21 20:53:26,987 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 106 transitions. Word has length 33 [2023-12-21 20:53:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:53:26,987 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 106 transitions. [2023-12-21 20:53:26,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 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:53:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 106 transitions. [2023-12-21 20:53:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-21 20:53:26,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:53:26,987 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:53:26,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-21 20:53:27,189 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:53:27,190 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:53:27,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:53:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1807636878, now seen corresponding path program 3 times [2023-12-21 20:53:27,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:53:27,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143614788] [2023-12-21 20:53:27,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:53:27,191 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:53:27,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:53:27,192 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:53:27,192 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:53:27,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-12-21 20:53:27,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:53:27,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 20:53:27,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:53:27,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 20:53:27,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-21 20:53:27,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:27,462 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 30 treesize of output 23 [2023-12-21 20:53:27,534 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-21 20:53:27,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:53:28,245 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 89 treesize of output 81 [2023-12-21 20:53:28,265 INFO L349 Elim1Store]: treesize reduction 33, result has 23.3 percent of original size [2023-12-21 20:53:28,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 424 treesize of output 409 [2023-12-21 20:53:28,338 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 20:53:28,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:53:28,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143614788] [2023-12-21 20:53:28,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143614788] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:53:28,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:53:28,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 26 [2023-12-21 20:53:28,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712327692] [2023-12-21 20:53:28,339 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:53:28,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 20:53:28,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:53:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 20:53:28,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2023-12-21 20:53:28,340 INFO L87 Difference]: Start difference. First operand 88 states and 106 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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:53:39,992 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:53:41,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 20:53:45,937 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:53:49,957 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:53:54,011 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:53:54,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:53:54,153 INFO L93 Difference]: Finished difference Result 197 states and 243 transitions. [2023-12-21 20:53:54,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-21 20:53:54,154 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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 33 [2023-12-21 20:53:54,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:53:54,155 INFO L225 Difference]: With dead ends: 197 [2023-12-21 20:53:54,155 INFO L226 Difference]: Without dead ends: 171 [2023-12-21 20:53:54,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=460, Invalid=1990, Unknown=0, NotChecked=0, Total=2450 [2023-12-21 20:53:54,156 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 152 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 82 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:53:54,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 123 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 598 Invalid, 4 Unknown, 0 Unchecked, 21.9s Time] [2023-12-21 20:53:54,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-21 20:53:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 123. [2023-12-21 20:53:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 1.278688524590164) internal successors, (156), 122 states have internal predecessors, (156), 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:53:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 156 transitions. [2023-12-21 20:53:54,180 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 156 transitions. Word has length 33 [2023-12-21 20:53:54,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:53:54,181 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 156 transitions. [2023-12-21 20:53:54,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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:53:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 156 transitions. [2023-12-21 20:53:54,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-21 20:53:54,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:53:54,181 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:53:54,189 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 (16)] Forceful destruction successful, exit code 0 [2023-12-21 20:53:54,386 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:53:54,387 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:53:54,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:53:54,387 INFO L85 PathProgramCache]: Analyzing trace with hash 640817078, now seen corresponding path program 2 times [2023-12-21 20:53:54,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:53:54,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069880037] [2023-12-21 20:53:54,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:53:54,388 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:53:54,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:53:54,388 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:53:54,390 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:53:54,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:53:54,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:53:54,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-21 20:53:54,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:53:54,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 20:53:54,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 20:53:54,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 20:53:54,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 20:53:54,641 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:53:54,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-21 20:53:54,784 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 20 treesize of output 16 [2023-12-21 20:53:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 20:53:54,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:53:54,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069880037] [2023-12-21 20:53:54,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069880037] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:53:54,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:53:54,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-21 20:53:54,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216381117] [2023-12-21 20:53:54,848 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:53:54,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 20:53:54,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:53:54,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 20:53:54,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-21 20:53:54,849 INFO L87 Difference]: Start difference. First operand 123 states and 156 transitions. Second operand has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:53:55,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:53:55,722 INFO L93 Difference]: Finished difference Result 162 states and 208 transitions. [2023-12-21 20:53:55,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 20:53:55,732 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-12-21 20:53:55,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:53:55,732 INFO L225 Difference]: With dead ends: 162 [2023-12-21 20:53:55,732 INFO L226 Difference]: Without dead ends: 94 [2023-12-21 20:53:55,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-21 20:53:55,733 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:53:55,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 71 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 20:53:55,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-21 20:53:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2023-12-21 20:53:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.2747252747252746) internal successors, (116), 91 states have internal predecessors, (116), 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:53:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2023-12-21 20:53:55,749 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 33 [2023-12-21 20:53:55,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:53:55,749 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2023-12-21 20:53:55,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.4375) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:53:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2023-12-21 20:53:55,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 20:53:55,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:53:55,750 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:53:55,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-21 20:53:55,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:53:55,954 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:53:55,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:53:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash -437010633, now seen corresponding path program 8 times [2023-12-21 20:53:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:53:55,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538606977] [2023-12-21 20:53:55,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:53:55,954 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:53:55,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:53:55,955 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:53:55,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-21 20:53:56,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:53:56,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:53:56,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-21 20:53:56,072 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:53:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 20:53:56,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:53:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-21 20:53:56,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:53:56,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538606977] [2023-12-21 20:53:56,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538606977] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:53:56,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:53:56,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2023-12-21 20:53:56,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284130061] [2023-12-21 20:53:56,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:53:56,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 20:53:56,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:53:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 20:53:56,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2023-12-21 20:53:56,626 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 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:53:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:53:57,516 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2023-12-21 20:53:57,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 20:53:57,521 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 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:53:57,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:53:57,521 INFO L225 Difference]: With dead ends: 101 [2023-12-21 20:53:57,521 INFO L226 Difference]: Without dead ends: 86 [2023-12-21 20:53:57,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=423, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:53:57,522 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 143 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:53:57,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 25 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 20:53:57,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-21 20:53:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2023-12-21 20:53:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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:53:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 108 transitions. [2023-12-21 20:53:57,544 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 108 transitions. Word has length 34 [2023-12-21 20:53:57,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:53:57,544 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 108 transitions. [2023-12-21 20:53:57,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 states have internal predecessors, (47), 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:53:57,544 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 108 transitions. [2023-12-21 20:53:57,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 20:53:57,545 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:53:57,545 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:53:57,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-21 20:53:57,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:53:57,746 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:53:57,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:53:57,746 INFO L85 PathProgramCache]: Analyzing trace with hash 524550494, now seen corresponding path program 9 times [2023-12-21 20:53:57,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:53:57,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030570650] [2023-12-21 20:53:57,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:53:57,746 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:53:57,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:53:57,747 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:53:57,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-21 20:53:57,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-21 20:53:57,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:53:57,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-21 20:53:57,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:53:57,948 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:53:57,948 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 18 treesize of output 19 [2023-12-21 20:53:58,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:58,433 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:53:58,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:58,627 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 81 treesize of output 51 [2023-12-21 20:53:58,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:58,882 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 109 treesize of output 79 [2023-12-21 20:53:59,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:59,185 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 165 treesize of output 135 [2023-12-21 20:53:59,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:53:59,293 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 275 treesize of output 245 [2023-12-21 20:53:59,328 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 20:53:59,328 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:54:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 20:54:02,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:54:02,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030570650] [2023-12-21 20:54:02,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030570650] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:54:02,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:54:02,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2023-12-21 20:54:02,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350581335] [2023-12-21 20:54:02,755 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:54:02,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 20:54:02,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:54:02,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 20:54:02,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 20:54:02,756 INFO L87 Difference]: Start difference. First operand 84 states and 108 transitions. Second operand has 34 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:54:09,324 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:54:16,257 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:54:25,536 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:54:35,838 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:54:46,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:54:46,339 INFO L93 Difference]: Finished difference Result 262 states and 336 transitions. [2023-12-21 20:54:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2023-12-21 20:54:46,341 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-21 20:54:46,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:54:46,342 INFO L225 Difference]: With dead ends: 262 [2023-12-21 20:54:46,342 INFO L226 Difference]: Without dead ends: 201 [2023-12-21 20:54:46,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2226 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=988, Invalid=7568, Unknown=0, NotChecked=0, Total=8556 [2023-12-21 20:54:46,344 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 116 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 1962 mSolverCounterSat, 119 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1962 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:54:46,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 203 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1962 Invalid, 4 Unknown, 0 Unchecked, 24.9s Time] [2023-12-21 20:54:46,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-12-21 20:54:46,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2023-12-21 20:54:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.2781456953642385) internal successors, (193), 151 states have internal predecessors, (193), 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:54:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 193 transitions. [2023-12-21 20:54:46,379 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 193 transitions. Word has length 40 [2023-12-21 20:54:46,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:54:46,379 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 193 transitions. [2023-12-21 20:54:46,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:54:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 193 transitions. [2023-12-21 20:54:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 20:54:46,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:54:46,380 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:54:46,384 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 (19)] Forceful destruction successful, exit code 0 [2023-12-21 20:54:46,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:54:46,584 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:54:46,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:54:46,584 INFO L85 PathProgramCache]: Analyzing trace with hash 581808796, now seen corresponding path program 4 times [2023-12-21 20:54:46,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:54:46,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718709849] [2023-12-21 20:54:46,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:54:46,585 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:54:46,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:54:46,586 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:54:46,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-21 20:54:46,716 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:54:46,716 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:54:46,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 20:54:46,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:54:46,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-21 20:54:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 20:54:46,948 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:54:47,208 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 29 treesize of output 25 [2023-12-21 20:54:47,213 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:54:47,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2023-12-21 20:54:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 20:54:47,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:54:47,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718709849] [2023-12-21 20:54:47,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718709849] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:54:47,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:54:47,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2023-12-21 20:54:47,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970842220] [2023-12-21 20:54:47,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:54:47,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-21 20:54:47,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:54:47,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-21 20:54:47,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2023-12-21 20:54:47,328 INFO L87 Difference]: Start difference. First operand 152 states and 193 transitions. Second operand has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:54:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:54:49,674 INFO L93 Difference]: Finished difference Result 193 states and 241 transitions. [2023-12-21 20:54:49,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 20:54:49,685 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-12-21 20:54:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:54:49,686 INFO L225 Difference]: With dead ends: 193 [2023-12-21 20:54:49,686 INFO L226 Difference]: Without dead ends: 186 [2023-12-21 20:54:49,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:54:49,687 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 53 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-21 20:54:49,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 140 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-21 20:54:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-21 20:54:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 158. [2023-12-21 20:54:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.267515923566879) internal successors, (199), 157 states have internal predecessors, (199), 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:54:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 199 transitions. [2023-12-21 20:54:49,724 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 199 transitions. Word has length 40 [2023-12-21 20:54:49,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:54:49,724 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 199 transitions. [2023-12-21 20:54:49,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.909090909090909) internal successors, (64), 22 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:54:49,724 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 199 transitions. [2023-12-21 20:54:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-21 20:54:49,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:54:49,725 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:54:49,731 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 (20)] Forceful destruction successful, exit code 0 [2023-12-21 20:54:49,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:54:49,931 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:54:49,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:54:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash -235839654, now seen corresponding path program 1 times [2023-12-21 20:54:49,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:54:49,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847198381] [2023-12-21 20:54:49,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 20:54:49,932 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:54:49,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:54:49,933 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:54:49,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-21 20:54:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:54:50,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:54:50,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:54:50,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 20:54:50,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 20:54:50,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 20:54:50,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 20:54:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 20:54:50,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:54:50,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-21 20:54:50,586 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 20 treesize of output 16 [2023-12-21 20:54:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 20:54:50,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:54:50,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847198381] [2023-12-21 20:54:50,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847198381] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:54:50,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:54:50,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-12-21 20:54:50,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276015837] [2023-12-21 20:54:50,688 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:54:50,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 20:54:50,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:54:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 20:54:50,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2023-12-21 20:54:50,689 INFO L87 Difference]: Start difference. First operand 158 states and 199 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 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:54:52,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:54:52,065 INFO L93 Difference]: Finished difference Result 197 states and 250 transitions. [2023-12-21 20:54:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 20:54:52,078 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 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 40 [2023-12-21 20:54:52,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:54:52,078 INFO L225 Difference]: With dead ends: 197 [2023-12-21 20:54:52,078 INFO L226 Difference]: Without dead ends: 113 [2023-12-21 20:54:52,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2023-12-21 20:54:52,079 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 29 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 20:54:52,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 71 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 20:54:52,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-21 20:54:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 109. [2023-12-21 20:54:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 108 states have internal predecessors, (130), 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:54:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 130 transitions. [2023-12-21 20:54:52,103 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 130 transitions. Word has length 40 [2023-12-21 20:54:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:54:52,103 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 130 transitions. [2023-12-21 20:54:52,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 20 states have internal predecessors, (48), 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:54:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2023-12-21 20:54:52,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-21 20:54:52,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:54:52,104 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:54:52,112 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 (21)] Forceful destruction successful, exit code 0 [2023-12-21 20:54:52,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:54:52,310 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:54:52,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:54:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1994181509, now seen corresponding path program 10 times [2023-12-21 20:54:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:54:52,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256926222] [2023-12-21 20:54:52,310 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 20:54:52,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:54:52,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:54:52,312 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:54:52,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-21 20:54:52,419 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 20:54:52,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:54:52,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:54:52,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:54:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 20:54:52,747 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:54:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-21 20:54:53,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:54:53,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256926222] [2023-12-21 20:54:53,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256926222] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:54:53,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:54:53,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 28 [2023-12-21 20:54:53,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802961480] [2023-12-21 20:54:53,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:54:53,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 20:54:53,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:54:53,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 20:54:53,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2023-12-21 20:54:53,493 INFO L87 Difference]: Start difference. First operand 109 states and 130 transitions. Second operand has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 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:54:56,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:54:56,778 INFO L93 Difference]: Finished difference Result 227 states and 279 transitions. [2023-12-21 20:54:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 20:54:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 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 41 [2023-12-21 20:54:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:54:56,779 INFO L225 Difference]: With dead ends: 227 [2023-12-21 20:54:56,779 INFO L226 Difference]: Without dead ends: 173 [2023-12-21 20:54:56,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=356, Invalid=1284, Unknown=0, NotChecked=0, Total=1640 [2023-12-21 20:54:56,780 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 365 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:54:56,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 39 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-21 20:54:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-12-21 20:54:56,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 149. [2023-12-21 20:54:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 148 states have (on average 1.195945945945946) internal successors, (177), 148 states have internal predecessors, (177), 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:54:56,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2023-12-21 20:54:56,813 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 177 transitions. Word has length 41 [2023-12-21 20:54:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:54:56,813 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 177 transitions. [2023-12-21 20:54:56,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 28 states have internal predecessors, (55), 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:54:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 177 transitions. [2023-12-21 20:54:56,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-12-21 20:54:56,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:54:56,814 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:54:56,821 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 (22)] Ended with exit code 0 [2023-12-21 20:54:57,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:54:57,015 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:54:57,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:54:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash -963184485, now seen corresponding path program 11 times [2023-12-21 20:54:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:54:57,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511643021] [2023-12-21 20:54:57,016 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:54:57,016 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:54:57,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:54:57,017 INFO L229 MonitoredProcess]: Starting monitored process 23 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:54:57,018 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 (23)] Waiting until timeout for monitored process [2023-12-21 20:54:57,213 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-21 20:54:57,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:54:57,219 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:54:57,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:54:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 13 proven. 44 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 20:54:57,672 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:54:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 22 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 20:54:58,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:54:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511643021] [2023-12-21 20:54:58,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511643021] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:54:58,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:54:58,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 30 [2023-12-21 20:54:58,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873235025] [2023-12-21 20:54:58,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:54:58,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-21 20:54:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:54:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-21 20:54:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=677, Unknown=0, NotChecked=0, Total=870 [2023-12-21 20:54:58,855 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. Second operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 30 states have internal predecessors, (73), 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:55:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:55:01,170 INFO L93 Difference]: Finished difference Result 172 states and 202 transitions. [2023-12-21 20:55:01,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 20:55:01,171 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 30 states have internal predecessors, (73), 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 43 [2023-12-21 20:55:01,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:55:01,171 INFO L225 Difference]: With dead ends: 172 [2023-12-21 20:55:01,171 INFO L226 Difference]: Without dead ends: 137 [2023-12-21 20:55:01,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 20:55:01,172 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 112 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:55:01,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 29 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-21 20:55:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-21 20:55:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2023-12-21 20:55:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 1.208955223880597) internal successors, (162), 134 states have internal predecessors, (162), 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:55:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 162 transitions. [2023-12-21 20:55:01,205 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 162 transitions. Word has length 43 [2023-12-21 20:55:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:55:01,205 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 162 transitions. [2023-12-21 20:55:01,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 30 states have internal predecessors, (73), 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:55:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 162 transitions. [2023-12-21 20:55:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 20:55:01,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:55:01,205 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:55:01,214 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 (23)] Forceful destruction successful, exit code 0 [2023-12-21 20:55:01,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:55:01,410 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:55:01,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:55:01,410 INFO L85 PathProgramCache]: Analyzing trace with hash 810092084, now seen corresponding path program 12 times [2023-12-21 20:55:01,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:55:01,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836051742] [2023-12-21 20:55:01,410 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:55:01,410 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:55:01,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:55:01,411 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-21 20:55:01,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-21 20:55:01,677 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2023-12-21 20:55:01,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:55:01,684 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 46 conjunts are in the unsatisfiable core [2023-12-21 20:55:01,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:55:01,728 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:55:01,729 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 18 treesize of output 19 [2023-12-21 20:55:02,456 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:02,456 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:55:02,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:02,707 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 81 treesize of output 51 [2023-12-21 20:55:03,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:03,060 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 109 treesize of output 79 [2023-12-21 20:55:03,487 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:03,488 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 165 treesize of output 135 [2023-12-21 20:55:03,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:03,960 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 277 treesize of output 247 [2023-12-21 20:55:04,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:04,222 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 499 treesize of output 469 [2023-12-21 20:55:04,272 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-21 20:55:04,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:55:09,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:55:09,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 21 [2023-12-21 20:55:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-21 20:55:13,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:55:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836051742] [2023-12-21 20:55:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [836051742] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:55:13,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:55:13,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 54 [2023-12-21 20:55:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572009346] [2023-12-21 20:55:13,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:55:13,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-21 20:55:13,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:55:13,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-21 20:55:13,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=2451, Unknown=0, NotChecked=0, Total=2862 [2023-12-21 20:55:13,964 INFO L87 Difference]: Start difference. First operand 135 states and 162 transitions. Second operand has 54 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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:55:32,297 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:55:52,501 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:56:14,110 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:56:28,534 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:56:37,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:56:37,869 INFO L93 Difference]: Finished difference Result 283 states and 332 transitions. [2023-12-21 20:56:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-21 20:56:37,870 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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 47 [2023-12-21 20:56:37,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:56:37,870 INFO L225 Difference]: With dead ends: 283 [2023-12-21 20:56:37,871 INFO L226 Difference]: Without dead ends: 273 [2023-12-21 20:56:37,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3803 ImplicationChecksByTransitivity, 63.7s TimeCoverageRelationStatistics Valid=1934, Invalid=12828, Unknown=0, NotChecked=0, Total=14762 [2023-12-21 20:56:37,873 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 213 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 226 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:56:37,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 304 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 2338 Invalid, 4 Unknown, 0 Unchecked, 29.6s Time] [2023-12-21 20:56:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-21 20:56:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 168. [2023-12-21 20:56:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.2095808383233533) internal successors, (202), 167 states have internal predecessors, (202), 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:56:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 202 transitions. [2023-12-21 20:56:37,916 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 202 transitions. Word has length 47 [2023-12-21 20:56:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:56:37,917 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 202 transitions. [2023-12-21 20:56:37,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 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:56:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 202 transitions. [2023-12-21 20:56:37,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 20:56:37,917 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:56:37,917 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:56:37,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-12-21 20:56:38,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 20:56:38,118 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:56:38,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:56:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 867350386, now seen corresponding path program 5 times [2023-12-21 20:56:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:56:38,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427608996] [2023-12-21 20:56:38,118 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 20:56:38,119 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:56:38,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:56:38,119 INFO L229 MonitoredProcess]: Starting monitored process 25 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:56:38,120 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 (25)] Waiting until timeout for monitored process [2023-12-21 20:56:38,346 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2023-12-21 20:56:38,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:56:38,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:56:38,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:56:38,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-21 20:56:38,616 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 20:56:38,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:56:38,851 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 29 treesize of output 25 [2023-12-21 20:56:38,854 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 20:56:38,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2023-12-21 20:56:39,001 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-21 20:56:39,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:56:39,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427608996] [2023-12-21 20:56:39,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427608996] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:56:39,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:56:39,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-12-21 20:56:39,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449248938] [2023-12-21 20:56:39,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:56:39,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 20:56:39,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:56:39,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 20:56:39,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2023-12-21 20:56:39,003 INFO L87 Difference]: Start difference. First operand 168 states and 202 transitions. Second operand has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:56:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:56:41,268 INFO L93 Difference]: Finished difference Result 208 states and 248 transitions. [2023-12-21 20:56:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 20:56:41,277 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-12-21 20:56:41,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:56:41,278 INFO L225 Difference]: With dead ends: 208 [2023-12-21 20:56:41,278 INFO L226 Difference]: Without dead ends: 182 [2023-12-21 20:56:41,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2023-12-21 20:56:41,279 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 56 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-21 20:56:41,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 195 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-21 20:56:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-21 20:56:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 160. [2023-12-21 20:56:41,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 1.2075471698113207) internal successors, (192), 159 states have internal predecessors, (192), 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:56:41,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 192 transitions. [2023-12-21 20:56:41,319 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 192 transitions. Word has length 47 [2023-12-21 20:56:41,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:56:41,319 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 192 transitions. [2023-12-21 20:56:41,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.769230769230769) internal successors, (72), 26 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 20:56:41,320 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 192 transitions. [2023-12-21 20:56:41,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 20:56:41,320 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:56:41,320 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:56:41,325 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 (25)] Forceful destruction successful, exit code 0 [2023-12-21 20:56:41,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:56:41,521 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:56:41,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:56:41,521 INFO L85 PathProgramCache]: Analyzing trace with hash -938087948, now seen corresponding path program 2 times [2023-12-21 20:56:41,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:56:41,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336499444] [2023-12-21 20:56:41,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 20:56:41,521 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:56:41,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:56:41,522 INFO L229 MonitoredProcess]: Starting monitored process 26 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:56:41,523 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 (26)] Waiting until timeout for monitored process [2023-12-21 20:56:41,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 20:56:41,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:56:41,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 20:56:41,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:56:41,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 20:56:41,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 20:56:41,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 20:56:41,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 20:56:41,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 20:56:41,963 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-21 20:56:41,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:56:42,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-21 20:56:42,176 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 20 treesize of output 16 [2023-12-21 20:56:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 9 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-12-21 20:56:42,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:56:42,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336499444] [2023-12-21 20:56:42,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336499444] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:56:42,296 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:56:42,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2023-12-21 20:56:42,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114704530] [2023-12-21 20:56:42,296 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:56:42,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 20:56:42,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:56:42,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 20:56:42,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2023-12-21 20:56:42,297 INFO L87 Difference]: Start difference. First operand 160 states and 192 transitions. Second operand has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 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:56:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:56:43,964 INFO L93 Difference]: Finished difference Result 200 states and 244 transitions. [2023-12-21 20:56:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 20:56:43,965 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 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 47 [2023-12-21 20:56:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:56:43,965 INFO L225 Difference]: With dead ends: 200 [2023-12-21 20:56:43,965 INFO L226 Difference]: Without dead ends: 104 [2023-12-21 20:56:43,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2023-12-21 20:56:43,966 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-21 20:56:43,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 96 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-21 20:56:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-21 20:56:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2023-12-21 20:56:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.1818181818181819) internal successors, (117), 99 states have internal predecessors, (117), 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:56:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 117 transitions. [2023-12-21 20:56:43,992 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 117 transitions. Word has length 47 [2023-12-21 20:56:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:56:43,993 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 117 transitions. [2023-12-21 20:56:43,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 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:56:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 117 transitions. [2023-12-21 20:56:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-21 20:56:43,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:56:43,993 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:56:43,998 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 (26)] Forceful destruction successful, exit code 0 [2023-12-21 20:56:44,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:56:44,194 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:56:44,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:56:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash -646687941, now seen corresponding path program 3 times [2023-12-21 20:56:44,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:56:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612098691] [2023-12-21 20:56:44,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 20:56:44,194 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:56:44,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:56:44,195 INFO L229 MonitoredProcess]: Starting monitored process 27 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:56:44,196 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 (27)] Waiting until timeout for monitored process [2023-12-21 20:56:44,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-21 20:56:44,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:56:44,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 20:56:44,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:56:44,911 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-21 20:56:44,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:56:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-21 20:56:45,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:56:45,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612098691] [2023-12-21 20:56:45,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612098691] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:56:45,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:56:45,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2023-12-21 20:56:45,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087905512] [2023-12-21 20:56:45,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:56:45,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 20:56:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:56:45,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 20:56:45,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2023-12-21 20:56:45,623 INFO L87 Difference]: Start difference. First operand 100 states and 117 transitions. Second operand has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 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:56:47,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:56:47,852 INFO L93 Difference]: Finished difference Result 255 states and 309 transitions. [2023-12-21 20:56:47,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-21 20:56:47,852 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 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 51 [2023-12-21 20:56:47,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:56:47,853 INFO L225 Difference]: With dead ends: 255 [2023-12-21 20:56:47,853 INFO L226 Difference]: Without dead ends: 189 [2023-12-21 20:56:47,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=400, Invalid=1406, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 20:56:47,854 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 356 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-21 20:56:47,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 41 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-21 20:56:47,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-12-21 20:56:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 136. [2023-12-21 20:56:47,891 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:56:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 159 transitions. [2023-12-21 20:56:47,891 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 159 transitions. Word has length 51 [2023-12-21 20:56:47,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:56:47,891 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 159 transitions. [2023-12-21 20:56:47,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.1875) internal successors, (70), 32 states have internal predecessors, (70), 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:56:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 159 transitions. [2023-12-21 20:56:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-21 20:56:47,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:56:47,892 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:56:47,899 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 (27)] Ended with exit code 0 [2023-12-21 20:56:48,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:56:48,092 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:56:48,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:56:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1755186850, now seen corresponding path program 13 times [2023-12-21 20:56:48,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:56:48,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292284109] [2023-12-21 20:56:48,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 20:56:48,093 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:56:48,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:56:48,094 INFO L229 MonitoredProcess]: Starting monitored process 28 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:56:48,095 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 (28)] Waiting until timeout for monitored process [2023-12-21 20:56:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 20:56:48,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-21 20:56:48,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:56:48,316 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 20:56:48,316 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 18 treesize of output 19 [2023-12-21 20:56:49,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-21 20:56:49,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:56:49,280 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:56:49,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:56:49,543 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 81 treesize of output 51 [2023-12-21 20:56:49,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:56:49,896 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 109 treesize of output 79 [2023-12-21 20:56:50,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:56:50,332 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 165 treesize of output 135 [2023-12-21 20:56:50,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:56:50,932 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 277 treesize of output 247 [2023-12-21 20:56:51,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:56:51,404 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 501 treesize of output 471 [2023-12-21 20:56:51,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:56:51,523 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 947 treesize of output 917 [2023-12-21 20:56:51,586 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:56:51,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:57:00,874 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 1526 treesize of output 1510 [2023-12-21 20:57:00,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:57:00,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 2943 treesize of output 2971 [2023-12-21 20:57:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 20:57:14,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:57:14,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292284109] [2023-12-21 20:57:14,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292284109] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:57:14,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:57:14,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 72 [2023-12-21 20:57:14,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190990015] [2023-12-21 20:57:14,427 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:57:14,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-12-21 20:57:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:57:14,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-12-21 20:57:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=4630, Unknown=0, NotChecked=0, Total=5112 [2023-12-21 20:57:14,428 INFO L87 Difference]: Start difference. First operand 136 states and 159 transitions. Second operand has 72 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 72 states have internal predecessors, (106), 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:58:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 20:58:06,547 INFO L93 Difference]: Finished difference Result 203 states and 237 transitions. [2023-12-21 20:58:06,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-21 20:58:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 72 states have internal predecessors, (106), 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 54 [2023-12-21 20:58:06,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 20:58:06,548 INFO L225 Difference]: With dead ends: 203 [2023-12-21 20:58:06,548 INFO L226 Difference]: Without dead ends: 197 [2023-12-21 20:58:06,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 48.0s TimeCoverageRelationStatistics Valid=1084, Invalid=9422, Unknown=0, NotChecked=0, Total=10506 [2023-12-21 20:58:06,550 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 140 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 3293 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 3465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 3293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2023-12-21 20:58:06,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 183 Invalid, 3465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 3293 Invalid, 0 Unknown, 0 Unchecked, 25.8s Time] [2023-12-21 20:58:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-21 20:58:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 154. [2023-12-21 20:58:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 1.1568627450980393) internal successors, (177), 153 states have internal predecessors, (177), 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:58:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2023-12-21 20:58:06,602 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 54 [2023-12-21 20:58:06,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 20:58:06,602 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2023-12-21 20:58:06,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.4722222222222223) internal successors, (106), 72 states have internal predecessors, (106), 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:58:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2023-12-21 20:58:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-21 20:58:06,603 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 20:58:06,603 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 20:58:06,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-21 20:58:06,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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:58:06,804 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 20:58:06,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 20:58:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1697928548, now seen corresponding path program 6 times [2023-12-21 20:58:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 20:58:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150259031] [2023-12-21 20:58:06,804 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 20:58:06,804 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:58:06,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 20:58:06,805 INFO L229 MonitoredProcess]: Starting monitored process 29 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:58:06,806 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 (29)] Waiting until timeout for monitored process [2023-12-21 20:58:07,105 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2023-12-21 20:58:07,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 20:58:07,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 20:58:07,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 20:58:07,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-21 20:58:07,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 20:58:07,760 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 21 treesize of output 21 [2023-12-21 20:58:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 20:58:08,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 20:58:29,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2023-12-21 20:58:29,620 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-21 20:58:29,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 1 [2023-12-21 20:58:29,621 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-12-21 20:58:29,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 20:58:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150259031] [2023-12-21 20:58:29,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150259031] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 20:58:29,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 20:58:29,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2023-12-21 20:58:29,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850063340] [2023-12-21 20:58:29,622 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 20:58:29,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-21 20:58:29,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 20:58:29,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-21 20:58:29,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=267, Unknown=5, NotChecked=0, Total=342 [2023-12-21 20:58:29,623 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 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:58:46,328 WARN L293 SmtUtils]: Spent 16.16s on a formula simplification. DAG size of input: 47 DAG size of output: 45 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:59:02,469 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 37 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:59:18,693 WARN L293 SmtUtils]: Spent 16.05s on a formula simplification. DAG size of input: 41 DAG size of output: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:59:31,087 WARN L293 SmtUtils]: Spent 12.11s on a formula simplification. DAG size of input: 52 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:59:43,291 WARN L293 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 45 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 20:59:59,515 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification. DAG size of input: 34 DAG size of output: 33 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 21:00:12,126 WARN L293 SmtUtils]: Spent 12.25s on a formula simplification. DAG size of input: 56 DAG size of output: 63 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 21:00:24,615 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 35 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 21:00:37,258 WARN L293 SmtUtils]: Spent 12.40s on a formula simplification. DAG size of input: 52 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 21:00:49,540 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 35 DAG size of output: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 21:01:02,175 WARN L293 SmtUtils]: Spent 12.28s on a formula simplification. DAG size of input: 50 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 21:01:14,677 WARN L293 SmtUtils]: Spent 12.10s on a formula simplification. DAG size of input: 46 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 21:01:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:01:14,801 INFO L93 Difference]: Finished difference Result 225 states and 262 transitions. [2023-12-21 21:01:14,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-21 21:01:14,802 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 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 54 [2023-12-21 21:01:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:01:14,803 INFO L225 Difference]: With dead ends: 225 [2023-12-21 21:01:14,803 INFO L226 Difference]: Without dead ends: 199 [2023-12-21 21:01:14,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 185.2s TimeCoverageRelationStatistics Valid=280, Invalid=1047, Unknown=5, NotChecked=0, Total=1332 [2023-12-21 21:01:14,804 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 76 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 21:01:14,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 39 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 21:01:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-12-21 21:01:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 159. [2023-12-21 21:01:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.1962025316455696) internal successors, (189), 158 states have internal predecessors, (189), 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 21:01:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 189 transitions. [2023-12-21 21:01:14,856 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 189 transitions. Word has length 54 [2023-12-21 21:01:14,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:01:14,856 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 189 transitions. [2023-12-21 21:01:14,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 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 21:01:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 189 transitions. [2023-12-21 21:01:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-21 21:01:14,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:01:14,857 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:01:14,870 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 (29)] Forceful destruction successful, exit code 0 [2023-12-21 21:01:15,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:01:15,062 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:01:15,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:01:15,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1693147236, now seen corresponding path program 3 times [2023-12-21 21:01:15,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:01:15,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342654409] [2023-12-21 21:01:15,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:01:15,063 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 21:01:15,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:01:15,064 INFO L229 MonitoredProcess]: Starting monitored process 30 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 21:01:15,080 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 (30)] Waiting until timeout for monitored process [2023-12-21 21:01:15,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-12-21 21:01:15,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:01:15,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-21 21:01:15,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:01:15,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 21:01:15,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 21:01:15,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:01:15,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:01:15,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:01:15,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:01:15,689 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-21 21:01:15,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:01:15,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-21 21:01:15,960 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 20 treesize of output 16 [2023-12-21 21:01:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 11 proven. 61 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-21 21:01:16,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:01:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342654409] [2023-12-21 21:01:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342654409] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:01:16,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:01:16,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 28 [2023-12-21 21:01:16,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955928019] [2023-12-21 21:01:16,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:01:16,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 21:01:16,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:01:16,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 21:01:16,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2023-12-21 21:01:16,124 INFO L87 Difference]: Start difference. First operand 159 states and 189 transitions. Second operand has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 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 21:01:18,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:01:18,900 INFO L93 Difference]: Finished difference Result 217 states and 265 transitions. [2023-12-21 21:01:18,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 21:01:18,910 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 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 54 [2023-12-21 21:01:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:01:18,911 INFO L225 Difference]: With dead ends: 217 [2023-12-21 21:01:18,911 INFO L226 Difference]: Without dead ends: 126 [2023-12-21 21:01:18,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2023-12-21 21:01:18,911 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-21 21:01:18,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 111 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-21 21:01:18,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-12-21 21:01:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2023-12-21 21:01:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.1864406779661016) internal successors, (140), 118 states have internal predecessors, (140), 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 21:01:18,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2023-12-21 21:01:18,958 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 54 [2023-12-21 21:01:18,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:01:18,958 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2023-12-21 21:01:18,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.25) internal successors, (63), 28 states have internal predecessors, (63), 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 21:01:18,958 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2023-12-21 21:01:18,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-21 21:01:18,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:01:18,959 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:01:18,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-21 21:01:19,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:01:19,164 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:01:19,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:01:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1291389509, now seen corresponding path program 14 times [2023-12-21 21:01:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:01:19,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317827636] [2023-12-21 21:01:19,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:01:19,165 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 21:01:19,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:01:19,166 INFO L229 MonitoredProcess]: Starting monitored process 31 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 21:01:19,166 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 (31)] Waiting until timeout for monitored process [2023-12-21 21:01:19,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:01:19,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:01:19,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-21 21:01:19,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:01:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-21 21:01:19,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:01:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 69 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2023-12-21 21:01:21,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:01:21,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317827636] [2023-12-21 21:01:21,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317827636] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:01:21,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:01:21,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 34 [2023-12-21 21:01:21,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616862299] [2023-12-21 21:01:21,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:01:21,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-21 21:01:21,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:01:21,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-21 21:01:21,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=897, Unknown=0, NotChecked=0, Total=1122 [2023-12-21 21:01:21,029 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 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 21:01:23,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:01:23,814 INFO L93 Difference]: Finished difference Result 141 states and 168 transitions. [2023-12-21 21:01:23,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 21:01:23,815 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 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 55 [2023-12-21 21:01:23,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:01:23,816 INFO L225 Difference]: With dead ends: 141 [2023-12-21 21:01:23,816 INFO L226 Difference]: Without dead ends: 117 [2023-12-21 21:01:23,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=249, Invalid=1011, Unknown=0, NotChecked=0, Total=1260 [2023-12-21 21:01:23,817 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 107 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-21 21:01:23,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 37 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-21 21:01:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-21 21:01:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2023-12-21 21:01:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 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 21:01:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2023-12-21 21:01:23,852 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 55 [2023-12-21 21:01:23,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:01:23,853 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2023-12-21 21:01:23,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.235294117647059) internal successors, (76), 34 states have internal predecessors, (76), 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 21:01:23,853 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2023-12-21 21:01:23,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 21:01:23,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:01:23,853 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:01:23,858 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 (31)] Forceful destruction successful, exit code 0 [2023-12-21 21:01:24,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:01:24,058 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:01:24,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:01:24,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1249919156, now seen corresponding path program 15 times [2023-12-21 21:01:24,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:01:24,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580010461] [2023-12-21 21:01:24,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 21:01:24,059 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 21:01:24,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:01:24,060 INFO L229 MonitoredProcess]: Starting monitored process 32 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 21:01:24,067 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 (32)] Waiting until timeout for monitored process [2023-12-21 21:01:24,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2023-12-21 21:01:24,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:01:24,501 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 57 conjunts are in the unsatisfiable core [2023-12-21 21:01:24,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:01:24,541 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:01:24,542 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 18 treesize of output 19 [2023-12-21 21:01:25,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:01:25,855 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 21:01:26,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:01:26,184 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 81 treesize of output 51 [2023-12-21 21:01:26,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:01:26,569 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 109 treesize of output 79 [2023-12-21 21:01:27,058 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:01:27,058 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 165 treesize of output 135 [2023-12-21 21:01:27,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:01:27,638 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 277 treesize of output 247 [2023-12-21 21:01:28,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:01:28,335 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 501 treesize of output 471 [2023-12-21 21:01:29,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:01:29,118 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 949 treesize of output 919 [2023-12-21 21:01:29,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:01:29,301 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 1843 treesize of output 1813 [2023-12-21 21:01:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:01:29,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:01:50,590 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 8 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-21 21:01:50,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:01:50,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580010461] [2023-12-21 21:01:50,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [580010461] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:01:50,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:01:50,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 68 [2023-12-21 21:01:50,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459843941] [2023-12-21 21:01:50,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:01:50,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-21 21:01:50,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:01:50,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-21 21:01:50,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=4152, Unknown=0, NotChecked=0, Total=4556 [2023-12-21 21:01:50,592 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 68 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 68 states have internal predecessors, (120), 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 21:02:01,867 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 21:02:10,898 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 21:02:28,574 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 21:02:51,189 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 21:03:17,190 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 21:03:46,277 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 21:04:17,956 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 21:04:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:04:35,200 INFO L93 Difference]: Finished difference Result 518 states and 643 transitions. [2023-12-21 21:04:35,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2023-12-21 21:04:35,214 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 68 states have internal predecessors, (120), 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 61 [2023-12-21 21:04:35,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:04:35,215 INFO L225 Difference]: With dead ends: 518 [2023-12-21 21:04:35,215 INFO L226 Difference]: Without dead ends: 443 [2023-12-21 21:04:35,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9096 ImplicationChecksByTransitivity, 113.2s TimeCoverageRelationStatistics Valid=2591, Invalid=27859, Unknown=0, NotChecked=0, Total=30450 [2023-12-21 21:04:35,217 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 388 mSDsluCounter, 625 mSDsCounter, 0 mSdLazyCounter, 6535 mSolverCounterSat, 689 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 7231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 689 IncrementalHoareTripleChecker+Valid, 6535 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.8s IncrementalHoareTripleChecker+Time [2023-12-21 21:04:35,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 644 Invalid, 7231 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [689 Valid, 6535 Invalid, 7 Unknown, 0 Unchecked, 72.8s Time] [2023-12-21 21:04:35,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-12-21 21:04:35,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 228. [2023-12-21 21:04:35,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 1.2202643171806167) internal successors, (277), 227 states have internal predecessors, (277), 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 21:04:35,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 277 transitions. [2023-12-21 21:04:35,307 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 277 transitions. Word has length 61 [2023-12-21 21:04:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:04:35,307 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 277 transitions. [2023-12-21 21:04:35,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 68 states have internal predecessors, (120), 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 21:04:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 277 transitions. [2023-12-21 21:04:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 21:04:35,308 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:04:35,308 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:04:35,316 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 (32)] Forceful destruction successful, exit code 0 [2023-12-21 21:04:35,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:04:35,514 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:04:35,514 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:04:35,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1929977526, now seen corresponding path program 7 times [2023-12-21 21:04:35,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:04:35,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11973083] [2023-12-21 21:04:35,514 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-21 21:04:35,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:04:35,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:04:35,515 INFO L229 MonitoredProcess]: Starting monitored process 33 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 21:04:35,516 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 (33)] Waiting until timeout for monitored process [2023-12-21 21:04:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 21:04:35,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 21:04:35,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:04:35,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2023-12-21 21:04:35,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:04:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 135 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 21:04:36,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:04:36,792 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 37 treesize of output 33 [2023-12-21 21:04:36,798 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 21:04:36,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 118 [2023-12-21 21:04:37,013 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-21 21:04:37,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:04:37,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11973083] [2023-12-21 21:04:37,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11973083] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:04:37,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:04:37,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 33 [2023-12-21 21:04:37,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008198870] [2023-12-21 21:04:37,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:04:37,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-21 21:04:37,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:04:37,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-21 21:04:37,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 21:04:37,014 INFO L87 Difference]: Start difference. First operand 228 states and 277 transitions. Second operand has 33 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 33 states have internal predecessors, (98), 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 21:04:45,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-21 21:04:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:04:46,034 INFO L93 Difference]: Finished difference Result 355 states and 441 transitions. [2023-12-21 21:04:46,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 21:04:46,035 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 33 states have internal predecessors, (98), 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 61 [2023-12-21 21:04:46,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:04:46,036 INFO L225 Difference]: With dead ends: 355 [2023-12-21 21:04:46,036 INFO L226 Difference]: Without dead ends: 336 [2023-12-21 21:04:46,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2023-12-21 21:04:46,037 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 34 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 1272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-12-21 21:04:46,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 125 Invalid, 1272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1237 Invalid, 1 Unknown, 0 Unchecked, 8.7s Time] [2023-12-21 21:04:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2023-12-21 21:04:46,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 277. [2023-12-21 21:04:46,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.2355072463768115) internal successors, (341), 276 states have internal predecessors, (341), 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 21:04:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 341 transitions. [2023-12-21 21:04:46,146 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 341 transitions. Word has length 61 [2023-12-21 21:04:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:04:46,146 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 341 transitions. [2023-12-21 21:04:46,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.9696969696969697) internal successors, (98), 33 states have internal predecessors, (98), 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 21:04:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 341 transitions. [2023-12-21 21:04:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 21:04:46,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:04:46,147 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:04:46,153 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 (33)] Forceful destruction successful, exit code 0 [2023-12-21 21:04:46,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:04:46,353 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:04:46,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:04:46,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1115905650, now seen corresponding path program 8 times [2023-12-21 21:04:46,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:04:46,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963713476] [2023-12-21 21:04:46,353 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 21:04:46,353 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-21 21:04:46,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:04:46,354 INFO L229 MonitoredProcess]: Starting monitored process 34 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 21:04:46,366 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 (34)] Waiting until timeout for monitored process [2023-12-21 21:04:46,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 21:04:46,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:04:46,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-21 21:04:46,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:04:46,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-12-21 21:04:46,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-21 21:04:46,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-21 21:04:46,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-21 21:04:46,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-21 21:04:46,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-21 21:04:46,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-21 21:04:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-12-21 21:04:46,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:04:48,427 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 75 treesize of output 71 [2023-12-21 21:04:49,091 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-12-21 21:04:49,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11265900532 treesize of output 11257511918 [2023-12-21 21:04:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 13 proven. 70 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-12-21 21:04:50,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:04:50,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963713476] [2023-12-21 21:04:50,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963713476] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:04:50,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:04:50,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19] total 28 [2023-12-21 21:04:50,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928201543] [2023-12-21 21:04:50,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:04:50,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-21 21:04:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:04:50,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-21 21:04:50,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=548, Unknown=0, NotChecked=0, Total=756 [2023-12-21 21:04:50,247 INFO L87 Difference]: Start difference. First operand 277 states and 341 transitions. Second operand has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 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 21:04:58,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:04:58,119 INFO L93 Difference]: Finished difference Result 605 states and 757 transitions. [2023-12-21 21:04:58,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 21:04:58,131 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 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 61 [2023-12-21 21:04:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:04:58,132 INFO L225 Difference]: With dead ends: 605 [2023-12-21 21:04:58,132 INFO L226 Difference]: Without dead ends: 460 [2023-12-21 21:04:58,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=244, Invalid=626, Unknown=0, NotChecked=0, Total=870 [2023-12-21 21:04:58,133 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 256 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-12-21 21:04:58,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 116 Invalid, 866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-12-21 21:04:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-12-21 21:04:58,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 277. [2023-12-21 21:04:58,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.2753623188405796) internal successors, (352), 276 states have internal predecessors, (352), 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 21:04:58,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 352 transitions. [2023-12-21 21:04:58,235 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 352 transitions. Word has length 61 [2023-12-21 21:04:58,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:04:58,235 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 352 transitions. [2023-12-21 21:04:58,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 28 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 21:04:58,235 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 352 transitions. [2023-12-21 21:04:58,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-12-21 21:04:58,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:04:58,236 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:04:58,244 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 (34)] Forceful destruction successful, exit code 0 [2023-12-21 21:04:58,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:04:58,441 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:04:58,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:04:58,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1601586444, now seen corresponding path program 4 times [2023-12-21 21:04:58,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:04:58,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364444289] [2023-12-21 21:04:58,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 21:04:58,442 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 21:04:58,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:04:58,443 INFO L229 MonitoredProcess]: Starting monitored process 35 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 21:04:58,444 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 (35)] Waiting until timeout for monitored process [2023-12-21 21:04:58,761 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 21:04:58,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:04:58,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-21 21:04:58,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:04:58,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-21 21:04:58,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-21 21:04:58,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:04:58,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:04:59,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:04:59,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:04:59,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-12-21 21:04:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 13 proven. 85 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-21 21:04:59,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:04:59,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-12-21 21:04:59,589 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 20 treesize of output 16 [2023-12-21 21:04:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 13 proven. 85 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-21 21:04:59,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:04:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364444289] [2023-12-21 21:04:59,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364444289] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:04:59,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:04:59,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2023-12-21 21:04:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104018905] [2023-12-21 21:04:59,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:04:59,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 21:04:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:04:59,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 21:04:59,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2023-12-21 21:04:59,831 INFO L87 Difference]: Start difference. First operand 277 states and 352 transitions. Second operand has 32 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:05:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:05:02,864 INFO L93 Difference]: Finished difference Result 430 states and 553 transitions. [2023-12-21 21:05:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 21:05:02,873 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2023-12-21 21:05:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:05:02,874 INFO L225 Difference]: With dead ends: 430 [2023-12-21 21:05:02,874 INFO L226 Difference]: Without dead ends: 273 [2023-12-21 21:05:02,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=952, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 21:05:02,875 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-21 21:05:02,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 131 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-21 21:05:02,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-12-21 21:05:02,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 249. [2023-12-21 21:05:02,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 1.2661290322580645) internal successors, (314), 248 states have internal predecessors, (314), 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 21:05:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 314 transitions. [2023-12-21 21:05:02,966 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 314 transitions. Word has length 61 [2023-12-21 21:05:02,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:05:02,966 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 314 transitions. [2023-12-21 21:05:02,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.25) internal successors, (72), 32 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 21:05:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 314 transitions. [2023-12-21 21:05:02,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-21 21:05:02,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:05:02,967 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:05:02,973 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 (35)] Forceful destruction successful, exit code 0 [2023-12-21 21:05:03,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:05:03,168 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:05:03,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:05:03,168 INFO L85 PathProgramCache]: Analyzing trace with hash 514158981, now seen corresponding path program 16 times [2023-12-21 21:05:03,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:05:03,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1422127237] [2023-12-21 21:05:03,169 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 21:05:03,169 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 21:05:03,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:05:03,170 INFO L229 MonitoredProcess]: Starting monitored process 36 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 21:05:03,170 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 (36)] Waiting until timeout for monitored process [2023-12-21 21:05:03,357 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 21:05:03,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:05:03,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-21 21:05:03,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:05:03,885 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 22 proven. 98 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-21 21:05:03,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:05:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 22 proven. 98 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-21 21:05:05,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:05:05,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1422127237] [2023-12-21 21:05:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1422127237] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:05:05,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:05:05,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2023-12-21 21:05:05,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922545725] [2023-12-21 21:05:05,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:05:05,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-21 21:05:05,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:05:05,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-21 21:05:05,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1111, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 21:05:05,257 INFO L87 Difference]: Start difference. First operand 249 states and 314 transitions. Second operand has 38 states, 38 states have (on average 2.236842105263158) internal successors, (85), 38 states have internal predecessors, (85), 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 21:05:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:05:09,729 INFO L93 Difference]: Finished difference Result 314 states and 385 transitions. [2023-12-21 21:05:09,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-21 21:05:09,730 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.236842105263158) internal successors, (85), 38 states have internal predecessors, (85), 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 64 [2023-12-21 21:05:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:05:09,730 INFO L225 Difference]: With dead ends: 314 [2023-12-21 21:05:09,730 INFO L226 Difference]: Without dead ends: 236 [2023-12-21 21:05:09,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=594, Invalid=2162, Unknown=0, NotChecked=0, Total=2756 [2023-12-21 21:05:09,731 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 342 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-21 21:05:09,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 51 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-21 21:05:09,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-21 21:05:09,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 222. [2023-12-21 21:05:09,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.2895927601809956) internal successors, (285), 221 states have internal predecessors, (285), 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 21:05:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 285 transitions. [2023-12-21 21:05:09,835 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 285 transitions. Word has length 64 [2023-12-21 21:05:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:05:09,835 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 285 transitions. [2023-12-21 21:05:09,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.236842105263158) internal successors, (85), 38 states have internal predecessors, (85), 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 21:05:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 285 transitions. [2023-12-21 21:05:09,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-21 21:05:09,835 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:05:09,835 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:05:09,843 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 (36)] Forceful destruction successful, exit code 0 [2023-12-21 21:05:10,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:05:10,037 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:05:10,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:05:10,037 INFO L85 PathProgramCache]: Analyzing trace with hash 638371707, now seen corresponding path program 17 times [2023-12-21 21:05:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:05:10,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353038721] [2023-12-21 21:05:10,038 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-21 21:05:10,038 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 21:05:10,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:05:10,039 INFO L229 MonitoredProcess]: Starting monitored process 37 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 21:05:10,040 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 (37)] Waiting until timeout for monitored process [2023-12-21 21:05:10,337 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-12-21 21:05:10,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:05:10,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-21 21:05:10,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:05:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 21:05:11,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:05:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-21 21:05:13,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:05:13,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353038721] [2023-12-21 21:05:13,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353038721] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:05:13,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:05:13,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 23] total 52 [2023-12-21 21:05:13,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284086768] [2023-12-21 21:05:13,675 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:05:13,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-21 21:05:13,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:05:13,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-21 21:05:13,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=2092, Unknown=0, NotChecked=0, Total=2652 [2023-12-21 21:05:13,676 INFO L87 Difference]: Start difference. First operand 222 states and 285 transitions. Second operand has 52 states, 52 states have (on average 2.2884615384615383) internal successors, (119), 52 states have internal predecessors, (119), 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 21:05:18,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 21:05:18,584 INFO L93 Difference]: Finished difference Result 515 states and 662 transitions. [2023-12-21 21:05:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-21 21:05:18,584 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.2884615384615383) internal successors, (119), 52 states have internal predecessors, (119), 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 65 [2023-12-21 21:05:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 21:05:18,585 INFO L225 Difference]: With dead ends: 515 [2023-12-21 21:05:18,585 INFO L226 Difference]: Without dead ends: 332 [2023-12-21 21:05:18,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1265 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=850, Invalid=3182, Unknown=0, NotChecked=0, Total=4032 [2023-12-21 21:05:18,586 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 422 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-12-21 21:05:18,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 53 Invalid, 1867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-12-21 21:05:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-12-21 21:05:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 307. [2023-12-21 21:05:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 1.2450980392156863) internal successors, (381), 306 states have internal predecessors, (381), 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 21:05:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 381 transitions. [2023-12-21 21:05:18,708 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 381 transitions. Word has length 65 [2023-12-21 21:05:18,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 21:05:18,708 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 381 transitions. [2023-12-21 21:05:18,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.2884615384615383) internal successors, (119), 52 states have internal predecessors, (119), 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 21:05:18,708 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 381 transitions. [2023-12-21 21:05:18,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-12-21 21:05:18,709 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 21:05:18,709 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 21:05:18,714 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 (37)] Forceful destruction successful, exit code 0 [2023-12-21 21:05:18,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:05:18,915 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 21:05:18,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 21:05:18,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1155375454, now seen corresponding path program 18 times [2023-12-21 21:05:18,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-21 21:05:18,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892524219] [2023-12-21 21:05:18,915 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-21 21:05:18,916 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 21:05:18,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-21 21:05:18,916 INFO L229 MonitoredProcess]: Starting monitored process 38 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 21:05:18,917 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 (38)] Waiting until timeout for monitored process [2023-12-21 21:05:19,389 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-12-21 21:05:19,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 21:05:19,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-21 21:05:19,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 21:05:19,457 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-21 21:05:19,458 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 18 treesize of output 19 [2023-12-21 21:05:20,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:20,284 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 21:05:20,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:20,539 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 81 treesize of output 51 [2023-12-21 21:05:20,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:20,874 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 109 treesize of output 79 [2023-12-21 21:05:21,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:21,358 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 165 treesize of output 135 [2023-12-21 21:05:21,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:21,932 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 277 treesize of output 247 [2023-12-21 21:05:22,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:22,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 501 treesize of output 471 [2023-12-21 21:05:23,553 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:23,554 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 949 treesize of output 919 [2023-12-21 21:05:24,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:24,518 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 1845 treesize of output 1815 [2023-12-21 21:05:24,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:24,983 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 3635 treesize of output 3605 [2023-12-21 21:05:25,070 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-21 21:05:25,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 21:05:40,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-21 21:05:40,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 104 treesize of output 33 [2023-12-21 21:05:54,531 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-21 21:05:54,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-21 21:05:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892524219] [2023-12-21 21:05:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892524219] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 21:05:54,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 21:05:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39] total 78 [2023-12-21 21:05:54,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982295109] [2023-12-21 21:05:54,532 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 21:05:54,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-12-21 21:05:54,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-21 21:05:54,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-12-21 21:05:54,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=816, Invalid=5190, Unknown=0, NotChecked=0, Total=6006 [2023-12-21 21:05:54,533 INFO L87 Difference]: Start difference. First operand 307 states and 381 transitions. Second operand has 78 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 78 states have internal predecessors, (92), 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 21:06:23,361 WARN L293 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 193 DAG size of output: 180 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-21 21:06:47,494 WARN L293 SmtUtils]: Spent 5.13s on a formula simplification. DAG size of input: 186 DAG size of output: 173 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-21 21:07:05,421 WARN L340 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 (38)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 21:07:05,455 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-21 21:07:05,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2023-12-21 21:07:05,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 86.3s TimeCoverageRelationStatistics Valid=1593, Invalid=10397, Unknown=0, NotChecked=0, Total=11990 [2023-12-21 21:07:05,488 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 278 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 2441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2023-12-21 21:07:05,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 15 Invalid, 2441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 2257 Invalid, 0 Unknown, 0 Unchecked, 13.4s Time] [2023-12-21 21:07:05,489 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 21:07:05,495 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 (38)] Forceful destruction successful, exit code 0 [2023-12-21 21:07:05,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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 21:07:05,690 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (307states) and FLOYD_HOARE automaton (currently 56 states, 78 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 110 known predicates. [2023-12-21 21:07:05,694 INFO L445 BasicCegarLoop]: Path program histogram: [18, 8, 4, 3, 1, 1, 1, 1] [2023-12-21 21:07:05,695 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 21:07:05,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 09:07:05 BoogieIcfgContainer [2023-12-21 21:07:05,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 21:07:05,696 INFO L158 Benchmark]: Toolchain (without parser) took 875493.86ms. Allocated memory was 264.2MB in the beginning and 382.7MB in the end (delta: 118.5MB). Free memory was 219.0MB in the beginning and 211.1MB in the end (delta: 7.9MB). Peak memory consumption was 127.6MB. Max. memory is 8.0GB. [2023-12-21 21:07:05,696 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 21:07:05,696 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.37ms. Allocated memory is still 264.2MB. Free memory was 218.6MB in the beginning and 206.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-21 21:07:05,697 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.70ms. Allocated memory is still 264.2MB. Free memory was 206.4MB in the beginning and 204.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:07:05,697 INFO L158 Benchmark]: Boogie Preprocessor took 29.01ms. Allocated memory is still 264.2MB. Free memory was 204.7MB in the beginning and 202.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 21:07:05,697 INFO L158 Benchmark]: RCFGBuilder took 429.44ms. Allocated memory is still 264.2MB. Free memory was 202.2MB in the beginning and 185.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-21 21:07:05,697 INFO L158 Benchmark]: TraceAbstraction took 874801.37ms. Allocated memory was 264.2MB in the beginning and 382.7MB in the end (delta: 118.5MB). Free memory was 185.1MB in the beginning and 211.1MB in the end (delta: -26.0MB). Peak memory consumption was 94.0MB. Max. memory is 8.0GB. [2023-12-21 21:07:05,697 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 153.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.37ms. Allocated memory is still 264.2MB. Free memory was 218.6MB in the beginning and 206.4MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.70ms. Allocated memory is still 264.2MB. Free memory was 206.4MB in the beginning and 204.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.01ms. Allocated memory is still 264.2MB. Free memory was 204.7MB in the beginning and 202.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 429.44ms. Allocated memory is still 264.2MB. Free memory was 202.2MB in the beginning and 185.8MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 874801.37ms. Allocated memory was 264.2MB in the beginning and 382.7MB in the end (delta: 118.5MB). Free memory was 185.1MB in the beginning and 211.1MB in the end (delta: -26.0MB). Peak memory consumption was 94.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 15). Cancelled while NwaCegarLoop was constructing difference of abstraction (307states) and FLOYD_HOARE automaton (currently 56 states, 78 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 110 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 874.8s, OverallIterations: 37, TraceHistogramMax: 8, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 696.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 23 mSolverCounterUnknown, 4745 SdHoareTripleChecker+Valid, 264.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4745 mSDsluCounter, 3547 SdHoareTripleChecker+Invalid, 248.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3195 mSDsCounter, 2591 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35611 IncrementalHoareTripleChecker+Invalid, 38225 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2591 mSolverCounterUnsat, 352 mSDtfsCounter, 35611 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3363 GetRequests, 1882 SyntacticMatches, 0 SemanticMatches, 1480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29329 ImplicationChecksByTransitivity, 559.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=36, InterpolantAutomatonStates: 940, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 1142 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 162.8s InterpolantComputationTime, 1477 NumberOfCodeBlocks, 1460 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 2858 ConstructedInterpolants, 149 QuantifiedInterpolants, 544511 SizeOfPredicates, 315 NumberOfNonLiveVariables, 4875 ConjunctsInSsa, 866 ConjunctsInUnsatCore, 72 InterpolantComputations, 2 PerfectInterpolantSequences, 2035/5358 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown