/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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 15:56:11,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 15:56:11,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 15:56:11,292 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 15:56:11,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 15:56:11,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 15:56:11,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 15:56:11,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 15:56:11,335 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 15:56:11,338 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 15:56:11,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 15:56:11,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 15:56:11,339 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 15:56:11,340 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 15:56:11,340 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 15:56:11,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 15:56:11,341 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 15:56:11,341 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 15:56:11,341 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 15:56:11,342 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 15:56:11,342 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 15:56:11,342 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 15:56:11,342 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 15:56:11,342 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 15:56:11,342 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 15:56:11,343 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 15:56:11,343 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 15:56:11,343 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 15:56:11,343 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 15:56:11,343 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 15:56:11,346 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 15:56:11,346 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 15:56:11,346 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 15:56:11,346 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 15:56:11,347 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:56:11,347 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 15:56:11,347 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 15:56:11,347 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 15:56:11,347 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 15:56:11,347 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 15:56:11,347 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 15:56:11,347 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 15:56:11,348 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 15:56:11,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 15:56:11,352 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 15:56:11,352 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 15:56:11,352 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 15:56:11,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 15:56:11,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 15:56:11,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 15:56:11,583 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 15:56:11,583 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 15:56:11,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i [2023-12-16 15:56:12,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 15:56:12,914 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 15:56:12,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i [2023-12-16 15:56:12,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/033fa1b51/2c3b1a5bb1cb43709bcbb52da7cdf0ac/FLAG22e1e30ab [2023-12-16 15:56:12,933 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/033fa1b51/2c3b1a5bb1cb43709bcbb52da7cdf0ac [2023-12-16 15:56:12,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 15:56:12,936 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 15:56:12,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 15:56:12,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 15:56:12,943 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 15:56:12,943 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:56:12" (1/1) ... [2023-12-16 15:56:12,944 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72d038e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:12, skipping insertion in model container [2023-12-16 15:56:12,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:56:12" (1/1) ... [2023-12-16 15:56:12,971 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 15:56:13,069 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i[916,929] [2023-12-16 15:56:13,119 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:56:13,139 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 15:56:13,147 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-31.i[916,929] [2023-12-16 15:56:13,183 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:56:13,200 INFO L206 MainTranslator]: Completed translation [2023-12-16 15:56:13,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13 WrapperNode [2023-12-16 15:56:13,201 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 15:56:13,202 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 15:56:13,202 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 15:56:13,202 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 15:56:13,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,259 INFO L138 Inliner]: procedures = 33, calls = 133, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 407 [2023-12-16 15:56:13,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 15:56:13,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 15:56:13,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 15:56:13,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 15:56:13,270 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,270 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,305 INFO L175 MemorySlicer]: Split 110 memory accesses to 2 slices as follows [2, 108]. 98 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10]. The 16 writes are split as follows [0, 16]. [2023-12-16 15:56:13,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,340 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 15:56:13,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 15:56:13,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 15:56:13,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 15:56:13,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (1/1) ... [2023-12-16 15:56:13,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:56:13,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 15:56:13,397 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 15:56:13,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 15:56:13,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 15:56:13,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-16 15:56:13,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-16 15:56:13,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-16 15:56:13,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-16 15:56:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 15:56:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 15:56:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 15:56:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 15:56:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-16 15:56:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-16 15:56:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-16 15:56:13,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-16 15:56:13,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 15:56:13,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 15:56:13,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 15:56:13,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 15:56:13,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 15:56:13,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 15:56:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 15:56:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 15:56:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 15:56:13,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 15:56:13,559 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 15:56:13,561 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 15:56:14,311 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 15:56:14,374 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 15:56:14,374 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 15:56:14,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:56:14 BoogieIcfgContainer [2023-12-16 15:56:14,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 15:56:14,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 15:56:14,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 15:56:14,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 15:56:14,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:56:12" (1/3) ... [2023-12-16 15:56:14,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5788cbf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:56:14, skipping insertion in model container [2023-12-16 15:56:14,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:56:13" (2/3) ... [2023-12-16 15:56:14,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5788cbf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:56:14, skipping insertion in model container [2023-12-16 15:56:14,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:56:14" (3/3) ... [2023-12-16 15:56:14,385 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-31.i [2023-12-16 15:56:14,400 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 15:56:14,400 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 15:56:14,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 15:56:14,452 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;@5dd98524, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 15:56:14,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 15:56:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:56:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 15:56:14,463 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:14,464 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:14,464 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:14,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:14,468 INFO L85 PathProgramCache]: Analyzing trace with hash 61359214, now seen corresponding path program 1 times [2023-12-16 15:56:14,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:14,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1432762343] [2023-12-16 15:56:14,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:14,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:14,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:14,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:14,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 15:56:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:14,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 15:56:14,801 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-16 15:56:14,871 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:14,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:14,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1432762343] [2023-12-16 15:56:14,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1432762343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:14,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:14,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 15:56:14,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340437381] [2023-12-16 15:56:14,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:14,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 15:56:14,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:14,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 15:56:14,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:56:14,912 INFO L87 Difference]: Start difference. First operand has 80 states, 66 states have (on average 1.5) internal successors, (99), 67 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:56:14,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:14,977 INFO L93 Difference]: Finished difference Result 154 states and 246 transitions. [2023-12-16 15:56:14,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 15:56:14,980 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2023-12-16 15:56:14,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:14,988 INFO L225 Difference]: With dead ends: 154 [2023-12-16 15:56:14,988 INFO L226 Difference]: Without dead ends: 75 [2023-12-16 15:56:14,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:56:14,995 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:14,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:56:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-12-16 15:56:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2023-12-16 15:56:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 62 states have (on average 1.403225806451613) internal successors, (87), 62 states have internal predecessors, (87), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:56:15,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2023-12-16 15:56:15,042 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 89 [2023-12-16 15:56:15,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:15,043 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2023-12-16 15:56:15,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:56:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2023-12-16 15:56:15,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 15:56:15,049 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:15,049 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:15,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:15,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:15,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:15,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1228647616, now seen corresponding path program 1 times [2023-12-16 15:56:15,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:15,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911999448] [2023-12-16 15:56:15,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:15,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:15,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:15,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:15,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 15:56:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:15,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:56:15,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 15:56:15,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:15,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911999448] [2023-12-16 15:56:15,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [911999448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:15,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:15,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:56:15,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292428594] [2023-12-16 15:56:15,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:15,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 15:56:15,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:15,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 15:56:15,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:56:15,534 INFO L87 Difference]: Start difference. First operand 75 states and 109 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:56:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:15,645 INFO L93 Difference]: Finished difference Result 155 states and 226 transitions. [2023-12-16 15:56:15,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:56:15,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2023-12-16 15:56:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:15,650 INFO L225 Difference]: With dead ends: 155 [2023-12-16 15:56:15,650 INFO L226 Difference]: Without dead ends: 81 [2023-12-16 15:56:15,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:56:15,652 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 10 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:15,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 308 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:56:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-16 15:56:15,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2023-12-16 15:56:15,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:56:15,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2023-12-16 15:56:15,662 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 89 [2023-12-16 15:56:15,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:15,662 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2023-12-16 15:56:15,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:56:15,663 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2023-12-16 15:56:15,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 15:56:15,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:15,674 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:15,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:15,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:15,884 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:15,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:15,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1143091646, now seen corresponding path program 1 times [2023-12-16 15:56:15,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:15,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273942616] [2023-12-16 15:56:15,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:15,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:15,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:15,889 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:15,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 15:56:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:16,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:56:16,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:16,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-16 15:56:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:16,166 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:16,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:16,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273942616] [2023-12-16 15:56:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273942616] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:16,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:16,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 15:56:16,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011017715] [2023-12-16 15:56:16,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:16,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 15:56:16,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:16,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 15:56:16,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:56:16,168 INFO L87 Difference]: Start difference. First operand 77 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:16,222 INFO L93 Difference]: Finished difference Result 153 states and 221 transitions. [2023-12-16 15:56:16,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 15:56:16,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2023-12-16 15:56:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:16,225 INFO L225 Difference]: With dead ends: 153 [2023-12-16 15:56:16,225 INFO L226 Difference]: Without dead ends: 77 [2023-12-16 15:56:16,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:56:16,226 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:16,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:56:16,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2023-12-16 15:56:16,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2023-12-16 15:56:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 64 states have (on average 1.375) internal successors, (88), 64 states have internal predecessors, (88), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 15:56:16,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 110 transitions. [2023-12-16 15:56:16,234 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 110 transitions. Word has length 89 [2023-12-16 15:56:16,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:16,235 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 110 transitions. [2023-12-16 15:56:16,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:16,235 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 110 transitions. [2023-12-16 15:56:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 15:56:16,236 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:16,237 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:16,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:16,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:16,438 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:16,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:16,438 INFO L85 PathProgramCache]: Analyzing trace with hash 122023292, now seen corresponding path program 1 times [2023-12-16 15:56:16,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:16,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354789643] [2023-12-16 15:56:16,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:16,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:16,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:16,444 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:16,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 15:56:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:16,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 15:56:16,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:16,795 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 8 treesize of output 1 [2023-12-16 15:56:16,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:16,809 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 33 [2023-12-16 15:56:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:16,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:16,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:16,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354789643] [2023-12-16 15:56:16,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354789643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:16,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:16,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:56:16,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693387024] [2023-12-16 15:56:16,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:16,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:56:16,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:16,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:56:16,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:56:16,882 INFO L87 Difference]: Start difference. First operand 77 states and 110 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:17,516 INFO L93 Difference]: Finished difference Result 211 states and 299 transitions. [2023-12-16 15:56:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:56:17,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 89 [2023-12-16 15:56:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:17,518 INFO L225 Difference]: With dead ends: 211 [2023-12-16 15:56:17,518 INFO L226 Difference]: Without dead ends: 135 [2023-12-16 15:56:17,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:56:17,519 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 108 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:17,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 357 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 15:56:17,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-16 15:56:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2023-12-16 15:56:17,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 99 states have internal predecessors, (135), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 15:56:17,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2023-12-16 15:56:17,530 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 89 [2023-12-16 15:56:17,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:17,530 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2023-12-16 15:56:17,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2023-12-16 15:56:17,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 15:56:17,532 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:17,532 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:17,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:17,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:17,740 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:17,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash -522860831, now seen corresponding path program 1 times [2023-12-16 15:56:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:17,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645873389] [2023-12-16 15:56:17,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:17,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:17,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:17,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:17,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 15:56:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:17,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:56:17,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:17,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-16 15:56:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:18,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:18,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:18,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645873389] [2023-12-16 15:56:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645873389] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:18,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:18,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 15:56:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358587866] [2023-12-16 15:56:18,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:18,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 15:56:18,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:18,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 15:56:18,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:56:18,008 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:18,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:18,041 INFO L93 Difference]: Finished difference Result 259 states and 367 transitions. [2023-12-16 15:56:18,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 15:56:18,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-16 15:56:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:18,047 INFO L225 Difference]: With dead ends: 259 [2023-12-16 15:56:18,047 INFO L226 Difference]: Without dead ends: 146 [2023-12-16 15:56:18,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:56:18,050 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 24 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:18,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 201 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:56:18,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-16 15:56:18,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 114. [2023-12-16 15:56:18,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 99 states have internal predecessors, (133), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 15:56:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2023-12-16 15:56:18,061 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 91 [2023-12-16 15:56:18,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:18,062 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2023-12-16 15:56:18,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:18,062 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2023-12-16 15:56:18,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 15:56:18,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:18,063 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:18,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-16 15:56:18,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:18,271 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:18,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash 157197539, now seen corresponding path program 1 times [2023-12-16 15:56:18,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:18,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543736248] [2023-12-16 15:56:18,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:18,272 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:18,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:18,273 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:18,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 15:56:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:18,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-16 15:56:18,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:18,573 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 19 treesize of output 1 [2023-12-16 15:56:18,621 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-16 15:56:18,649 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-16 15:56:18,677 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-16 15:56:18,717 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 30 treesize of output 33 [2023-12-16 15:56:22,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:22,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 59 [2023-12-16 15:56:22,422 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:22,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 77 treesize of output 76 [2023-12-16 15:56:22,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:22,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 89 [2023-12-16 15:56:26,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:26,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 100 treesize of output 94 [2023-12-16 15:56:26,938 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:26,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 147 treesize of output 57 [2023-12-16 15:56:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 106 proven. 24 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2023-12-16 15:56:27,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:56:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:27,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:27,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543736248] [2023-12-16 15:56:27,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [543736248] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:56:27,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:56:27,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 15 [2023-12-16 15:56:27,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852788089] [2023-12-16 15:56:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:27,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:56:27,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:27,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:56:27,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=168, Unknown=2, NotChecked=0, Total=210 [2023-12-16 15:56:27,161 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:27,848 INFO L93 Difference]: Finished difference Result 268 states and 373 transitions. [2023-12-16 15:56:27,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:56:27,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-16 15:56:27,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:27,850 INFO L225 Difference]: With dead ends: 268 [2023-12-16 15:56:27,850 INFO L226 Difference]: Without dead ends: 155 [2023-12-16 15:56:27,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=63, Invalid=277, Unknown=2, NotChecked=0, Total=342 [2023-12-16 15:56:27,851 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 112 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:27,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 348 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 15:56:27,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-12-16 15:56:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 91. [2023-12-16 15:56:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.32) internal successors, (99), 76 states have internal predecessors, (99), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 15:56:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2023-12-16 15:56:27,857 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 91 [2023-12-16 15:56:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:27,858 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2023-12-16 15:56:27,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2023-12-16 15:56:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 15:56:27,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:27,859 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:27,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:28,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:28,070 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:28,071 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1725263178, now seen corresponding path program 1 times [2023-12-16 15:56:28,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:28,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312428814] [2023-12-16 15:56:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:28,071 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:28,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:28,077 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:28,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-16 15:56:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:28,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 15:56:28,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:28,260 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:28,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:28,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312428814] [2023-12-16 15:56:28,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312428814] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:28,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:28,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 15:56:28,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010383886] [2023-12-16 15:56:28,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:28,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 15:56:28,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 15:56:28,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:56:28,262 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:28,285 INFO L93 Difference]: Finished difference Result 178 states and 245 transitions. [2023-12-16 15:56:28,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 15:56:28,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-16 15:56:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:28,286 INFO L225 Difference]: With dead ends: 178 [2023-12-16 15:56:28,286 INFO L226 Difference]: Without dead ends: 92 [2023-12-16 15:56:28,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:56:28,287 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:28,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:56:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-16 15:56:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-16 15:56:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 77 states have internal predecessors, (100), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 15:56:28,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2023-12-16 15:56:28,296 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 91 [2023-12-16 15:56:28,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:28,297 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2023-12-16 15:56:28,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:28,297 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2023-12-16 15:56:28,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 15:56:28,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:28,298 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:28,328 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:28,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:28,499 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:28,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:28,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1467097740, now seen corresponding path program 1 times [2023-12-16 15:56:28,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:28,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [464111612] [2023-12-16 15:56:28,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:28,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:28,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:28,501 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:28,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 15:56:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:28,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:56:28,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:28,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:28,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:28,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [464111612] [2023-12-16 15:56:28,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [464111612] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:28,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:28,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:56:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120458817] [2023-12-16 15:56:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:28,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:56:28,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:56:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:56:28,713 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:29,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:29,105 INFO L93 Difference]: Finished difference Result 227 states and 309 transitions. [2023-12-16 15:56:29,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:56:29,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 91 [2023-12-16 15:56:29,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:29,108 INFO L225 Difference]: With dead ends: 227 [2023-12-16 15:56:29,108 INFO L226 Difference]: Without dead ends: 140 [2023-12-16 15:56:29,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:56:29,109 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:29,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 373 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:56:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-16 15:56:29,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 92. [2023-12-16 15:56:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 77 states have internal predecessors, (99), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 15:56:29,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2023-12-16 15:56:29,116 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 91 [2023-12-16 15:56:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:29,117 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2023-12-16 15:56:29,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2023-12-16 15:56:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-16 15:56:29,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:29,119 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:29,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:29,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:29,341 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:29,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:29,341 INFO L85 PathProgramCache]: Analyzing trace with hash -584223820, now seen corresponding path program 1 times [2023-12-16 15:56:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:29,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [682048329] [2023-12-16 15:56:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:29,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:29,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:29,343 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:29,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-16 15:56:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:29,565 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-16 15:56:29,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:29,573 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 8 treesize of output 1 [2023-12-16 15:56:29,608 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 31 treesize of output 15 [2023-12-16 15:56:29,636 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 26 treesize of output 25 [2023-12-16 15:56:29,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:29,726 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 41 treesize of output 28 [2023-12-16 15:56:29,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:29,805 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 36 treesize of output 38 [2023-12-16 15:56:29,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:29,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 51 [2023-12-16 15:56:33,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:33,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 65 [2023-12-16 15:56:33,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:33,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 92 [2023-12-16 15:56:33,395 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:33,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 102 treesize of output 108 [2023-12-16 15:56:36,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:36,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 113 treesize of output 116 [2023-12-16 15:56:36,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:36,831 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 108 treesize of output 48 [2023-12-16 15:56:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 160 proven. 27 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-12-16 15:56:36,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:56:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:37,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:37,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [682048329] [2023-12-16 15:56:37,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [682048329] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:56:37,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:56:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2023-12-16 15:56:37,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896943836] [2023-12-16 15:56:37,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:37,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:56:37,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:37,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:56:37,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=231, Unknown=2, NotChecked=0, Total=306 [2023-12-16 15:56:37,026 INFO L87 Difference]: Start difference. First operand 92 states and 125 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:37,267 INFO L93 Difference]: Finished difference Result 202 states and 272 transitions. [2023-12-16 15:56:37,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:56:37,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2023-12-16 15:56:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:37,269 INFO L225 Difference]: With dead ends: 202 [2023-12-16 15:56:37,269 INFO L226 Difference]: Without dead ends: 115 [2023-12-16 15:56:37,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=78, Invalid=262, Unknown=2, NotChecked=0, Total=342 [2023-12-16 15:56:37,270 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 90 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:37,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 242 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:56:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-16 15:56:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 92. [2023-12-16 15:56:37,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 77 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-16 15:56:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 124 transitions. [2023-12-16 15:56:37,276 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 124 transitions. Word has length 92 [2023-12-16 15:56:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:37,276 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 124 transitions. [2023-12-16 15:56:37,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:37,276 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 124 transitions. [2023-12-16 15:56:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-16 15:56:37,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:37,277 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:37,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:37,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:37,485 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:37,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:37,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1474188056, now seen corresponding path program 1 times [2023-12-16 15:56:37,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:37,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426242979] [2023-12-16 15:56:37,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:37,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:37,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:37,487 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:37,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 15:56:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:37,859 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-16 15:56:37,862 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:37,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-16 15:56:37,883 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 25 treesize of output 10 [2023-12-16 15:56:39,668 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_51| (_ BitVec 64))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_51|) (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv28 32) |c_~#WrapperStruct00~0.offset|)))) is different from true [2023-12-16 15:56:39,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:39,702 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 32 treesize of output 34 [2023-12-16 15:56:39,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:39,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 60 [2023-12-16 15:56:39,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:39,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 84 treesize of output 63 [2023-12-16 15:56:39,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:39,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 63 [2023-12-16 15:56:39,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:39,969 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 102 treesize of output 42 [2023-12-16 15:56:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 15:56:39,997 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:39,997 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:39,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426242979] [2023-12-16 15:56:39,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426242979] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:39,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:39,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-16 15:56:39,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426487784] [2023-12-16 15:56:39,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:39,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 15:56:39,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:39,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 15:56:39,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2023-12-16 15:56:39,999 INFO L87 Difference]: Start difference. First operand 92 states and 124 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:56:45,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-16 15:56:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:45,276 INFO L93 Difference]: Finished difference Result 269 states and 360 transitions. [2023-12-16 15:56:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 15:56:45,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2023-12-16 15:56:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:45,281 INFO L225 Difference]: With dead ends: 269 [2023-12-16 15:56:45,282 INFO L226 Difference]: Without dead ends: 182 [2023-12-16 15:56:45,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=41, Invalid=72, Unknown=1, NotChecked=18, Total=132 [2023-12-16 15:56:45,282 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 204 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 21 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:45,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 394 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 257 Invalid, 1 Unknown, 273 Unchecked, 5.1s Time] [2023-12-16 15:56:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-16 15:56:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 171. [2023-12-16 15:56:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 145 states have internal predecessors, (184), 22 states have call successors, (22), 5 states have call predecessors, (22), 5 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 15:56:45,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 228 transitions. [2023-12-16 15:56:45,298 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 228 transitions. Word has length 93 [2023-12-16 15:56:45,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:45,298 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 228 transitions. [2023-12-16 15:56:45,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 15:56:45,299 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 228 transitions. [2023-12-16 15:56:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 15:56:45,299 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:45,299 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:45,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:45,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:45,507 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:45,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:45,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1335615676, now seen corresponding path program 1 times [2023-12-16 15:56:45,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:45,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346500738] [2023-12-16 15:56:45,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:45,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:45,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:45,508 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:45,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-16 15:56:45,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:45,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 15:56:45,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:45,732 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:45,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:45,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346500738] [2023-12-16 15:56:45,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346500738] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:45,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:45,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:56:45,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482572778] [2023-12-16 15:56:45,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:45,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:56:45,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:45,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:56:45,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:56:45,733 INFO L87 Difference]: Start difference. First operand 171 states and 228 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:46,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:46,068 INFO L93 Difference]: Finished difference Result 485 states and 640 transitions. [2023-12-16 15:56:46,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 15:56:46,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-16 15:56:46,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:46,070 INFO L225 Difference]: With dead ends: 485 [2023-12-16 15:56:46,070 INFO L226 Difference]: Without dead ends: 319 [2023-12-16 15:56:46,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:56:46,070 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 107 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:46,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 324 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 15:56:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-16 15:56:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 266. [2023-12-16 15:56:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 226 states have (on average 1.261061946902655) internal successors, (285), 230 states have internal predecessors, (285), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 15:56:46,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 345 transitions. [2023-12-16 15:56:46,082 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 345 transitions. Word has length 94 [2023-12-16 15:56:46,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:46,083 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 345 transitions. [2023-12-16 15:56:46,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:46,083 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 345 transitions. [2023-12-16 15:56:46,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 15:56:46,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:46,083 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:46,089 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 (12)] Ended with exit code 0 [2023-12-16 15:56:46,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:46,284 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:46,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:46,285 INFO L85 PathProgramCache]: Analyzing trace with hash -2000121604, now seen corresponding path program 1 times [2023-12-16 15:56:46,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:46,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959563615] [2023-12-16 15:56:46,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:46,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:46,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:46,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:46,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-16 15:56:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:46,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:56:46,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:46,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:46,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:46,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959563615] [2023-12-16 15:56:46,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959563615] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:46,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:46,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:56:46,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596430873] [2023-12-16 15:56:46,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:46,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:56:46,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:46,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:56:46,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:56:46,448 INFO L87 Difference]: Start difference. First operand 266 states and 345 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:46,500 INFO L93 Difference]: Finished difference Result 568 states and 736 transitions. [2023-12-16 15:56:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:56:46,500 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-16 15:56:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:46,502 INFO L225 Difference]: With dead ends: 568 [2023-12-16 15:56:46,502 INFO L226 Difference]: Without dead ends: 307 [2023-12-16 15:56:46,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:56:46,503 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 52 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:46,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 438 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:56:46,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-12-16 15:56:46,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 264. [2023-12-16 15:56:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 224 states have (on average 1.2455357142857142) internal successors, (279), 228 states have internal predecessors, (279), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 15:56:46,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 339 transitions. [2023-12-16 15:56:46,521 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 339 transitions. Word has length 94 [2023-12-16 15:56:46,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:46,523 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 339 transitions. [2023-12-16 15:56:46,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 339 transitions. [2023-12-16 15:56:46,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 15:56:46,524 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:46,524 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:46,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:46,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:46,728 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:46,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:46,729 INFO L85 PathProgramCache]: Analyzing trace with hash -658419588, now seen corresponding path program 1 times [2023-12-16 15:56:46,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:46,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028792506] [2023-12-16 15:56:46,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:46,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:46,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:46,752 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:46,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-16 15:56:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:46,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-16 15:56:46,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:46,977 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 8 treesize of output 1 [2023-12-16 15:56:46,979 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 17 treesize of output 17 [2023-12-16 15:56:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:47,010 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:47,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:47,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028792506] [2023-12-16 15:56:47,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028792506] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:47,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:47,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:56:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427188003] [2023-12-16 15:56:47,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:47,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:56:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:47,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:56:47,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:56:47,011 INFO L87 Difference]: Start difference. First operand 264 states and 339 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:47,354 INFO L93 Difference]: Finished difference Result 651 states and 832 transitions. [2023-12-16 15:56:47,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 15:56:47,360 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-16 15:56:47,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:47,362 INFO L225 Difference]: With dead ends: 651 [2023-12-16 15:56:47,362 INFO L226 Difference]: Without dead ends: 392 [2023-12-16 15:56:47,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:56:47,364 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 94 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:47,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 572 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 15:56:47,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-12-16 15:56:47,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 272. [2023-12-16 15:56:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 232 states have (on average 1.2543103448275863) internal successors, (291), 236 states have internal predecessors, (291), 30 states have call successors, (30), 9 states have call predecessors, (30), 9 states have return successors, (30), 26 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 15:56:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 351 transitions. [2023-12-16 15:56:47,380 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 351 transitions. Word has length 94 [2023-12-16 15:56:47,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:47,380 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 351 transitions. [2023-12-16 15:56:47,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:47,380 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 351 transitions. [2023-12-16 15:56:47,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 15:56:47,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:47,381 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:47,398 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-16 15:56:47,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:47,588 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:47,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:47,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1938283266, now seen corresponding path program 1 times [2023-12-16 15:56:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703404929] [2023-12-16 15:56:47,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:47,589 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:47,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:47,590 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 15:56:47,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-16 15:56:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:47,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 15:56:47,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:47,806 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:47,806 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:56:47,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:47,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703404929] [2023-12-16 15:56:47,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703404929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:56:47,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:56:47,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:56:47,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518058264] [2023-12-16 15:56:47,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:47,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:56:47,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:47,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:56:47,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:56:47,807 INFO L87 Difference]: Start difference. First operand 272 states and 351 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:56:48,223 INFO L93 Difference]: Finished difference Result 650 states and 828 transitions. [2023-12-16 15:56:48,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:56:48,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2023-12-16 15:56:48,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:56:48,239 INFO L225 Difference]: With dead ends: 650 [2023-12-16 15:56:48,239 INFO L226 Difference]: Without dead ends: 383 [2023-12-16 15:56:48,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:56:48,240 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 69 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-16 15:56:48,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 384 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-16 15:56:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-12-16 15:56:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 256. [2023-12-16 15:56:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 218 states have (on average 1.2431192660550459) internal successors, (271), 221 states have internal predecessors, (271), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 15:56:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 327 transitions. [2023-12-16 15:56:48,257 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 327 transitions. Word has length 94 [2023-12-16 15:56:48,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:56:48,258 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 327 transitions. [2023-12-16 15:56:48,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:56:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 327 transitions. [2023-12-16 15:56:48,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 15:56:48,258 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:56:48,258 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:56:48,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-16 15:56:48,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:48,465 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:56:48,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:56:48,466 INFO L85 PathProgramCache]: Analyzing trace with hash -635167137, now seen corresponding path program 1 times [2023-12-16 15:56:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:56:48,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605118482] [2023-12-16 15:56:48,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:56:48,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 15:56:48,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:56:48,481 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-16 15:56:48,482 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-16 15:56:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:56:48,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-16 15:56:48,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:56:48,807 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:48,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-12-16 15:56:48,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2023-12-16 15:56:49,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:49,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 61 [2023-12-16 15:56:49,523 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:49,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 64 [2023-12-16 15:56:49,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:49,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 74 [2023-12-16 15:56:50,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:50,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 84 treesize of output 87 [2023-12-16 15:56:53,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:53,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 117 treesize of output 110 [2023-12-16 15:56:53,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:53,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 145 treesize of output 130 [2023-12-16 15:56:53,924 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:53,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 140 treesize of output 134 [2023-12-16 15:56:54,346 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:56:54,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 143 treesize of output 59 [2023-12-16 15:56:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 162 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-12-16 15:56:54,439 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:56:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 15:56:56,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:56:56,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605118482] [2023-12-16 15:56:56,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605118482] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:56:56,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:56:56,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 22 [2023-12-16 15:56:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257225629] [2023-12-16 15:56:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:56:56,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:56:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:56:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:56:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=363, Unknown=1, NotChecked=0, Total=462 [2023-12-16 15:56:56,285 INFO L87 Difference]: Start difference. First operand 256 states and 327 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 15:57:02,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-16 15:57:06,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-16 15:57:10,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-16 15:57:14,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-16 15:57:18,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-16 15:57:22,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-16 15:57:26,775 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] Received shutdown request... [2023-12-16 15:57:28,377 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-16 15:57:28,378 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 (16)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 15:57:29,387 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-16 15:57:29,577 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 15:57:29,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=108, Invalid=397, Unknown=1, NotChecked=0, Total=506 [2023-12-16 15:57:29,587 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 4 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:57:29,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 205 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 121 Invalid, 7 Unknown, 0 Unchecked, 30.2s Time] [2023-12-16 15:57:29,588 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 15:57:29,588 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-16 15:57:29,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-16 15:57:29,618 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:57:29,619 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 15:57:29,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:57:29 BoogieIcfgContainer [2023-12-16 15:57:29,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 15:57:29,627 INFO L158 Benchmark]: Toolchain (without parser) took 76691.13ms. Allocated memory was 252.7MB in the beginning and 304.1MB in the end (delta: 51.4MB). Free memory was 199.8MB in the beginning and 264.3MB in the end (delta: -64.5MB). Peak memory consumption was 161.3MB. Max. memory is 8.0GB. [2023-12-16 15:57:29,628 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 202.4MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 15:57:29,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.96ms. Allocated memory is still 252.7MB. Free memory was 199.8MB in the beginning and 184.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 15:57:29,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.44ms. Allocated memory is still 252.7MB. Free memory was 184.1MB in the beginning and 180.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 15:57:29,629 INFO L158 Benchmark]: Boogie Preprocessor took 95.03ms. Allocated memory is still 252.7MB. Free memory was 180.4MB in the beginning and 176.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 15:57:29,630 INFO L158 Benchmark]: RCFGBuilder took 1019.70ms. Allocated memory is still 252.7MB. Free memory was 176.2MB in the beginning and 139.6MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-16 15:57:29,631 INFO L158 Benchmark]: TraceAbstraction took 75249.30ms. Allocated memory was 252.7MB in the beginning and 304.1MB in the end (delta: 51.4MB). Free memory was 139.0MB in the beginning and 264.3MB in the end (delta: -125.3MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. [2023-12-16 15:57:29,632 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.14ms. Allocated memory is still 202.4MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.96ms. Allocated memory is still 252.7MB. Free memory was 199.8MB in the beginning and 184.1MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.44ms. Allocated memory is still 252.7MB. Free memory was 184.1MB in the beginning and 180.4MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 95.03ms. Allocated memory is still 252.7MB. Free memory was 180.4MB in the beginning and 176.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1019.70ms. Allocated memory is still 252.7MB. Free memory was 176.2MB in the beginning and 139.6MB in the end (delta: 36.7MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 75249.30ms. Allocated memory was 252.7MB in the beginning and 304.1MB in the end (delta: 51.4MB). Free memory was 139.0MB in the beginning and 264.3MB in the end (delta: -125.3MB). Peak memory consumption was 100.4MB. 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: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 75.2s, OverallIterations: 15, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 42.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 969 SdHoareTripleChecker+Valid, 38.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 968 mSDsluCounter, 4654 SdHoareTripleChecker+Invalid, 37.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 273 IncrementalHoareTripleChecker+Unchecked, 3063 mSDsCounter, 54 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1572 IncrementalHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 54 mSolverCounterUnsat, 1591 mSDtfsCounter, 1572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1659 GetRequests, 1554 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 21.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272occurred in iteration=13, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 546 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 26.4s InterpolantComputationTime, 1375 NumberOfCodeBlocks, 1375 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1634 ConstructedInterpolants, 194 QuantifiedInterpolants, 12662 SizeOfPredicates, 71 NumberOfNonLiveVariables, 3008 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 3885/3960 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