/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-24.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 17:44:57,687 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 17:44:57,731 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-24 17:44:57,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 17:44:57,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 17:44:57,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 17:44:57,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 17:44:57,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 17:44:57,771 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 17:44:57,771 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 17:44:57,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 17:44:57,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 17:44:57,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 17:44:57,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 17:44:57,772 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 17:44:57,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 17:44:57,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 17:44:57,773 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 17:44:57,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 17:44:57,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 17:44:57,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 17:44:57,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 17:44:57,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 17:44:57,774 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 17:44:57,774 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 17:44:57,774 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 17:44:57,774 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 17:44:57,775 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 17:44:57,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 17:44:57,775 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 17:44:57,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 17:44:57,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 17:44:57,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 17:44:57,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 17:44:57,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 17:44:57,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 17:44:57,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 17:44:57,776 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 17:44:57,777 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 17:44:57,777 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 17:44:57,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 17:44:57,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 17:44:57,777 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 17:44:57,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 17:44:57,778 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 17:44:57,778 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 17:44:57,778 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-24 17:44:57,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 17:44:57,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 17:44:57,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 17:44:57,975 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 17:44:57,976 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 17:44:57,977 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-24.i [2023-12-24 17:44:58,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 17:44:59,080 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 17:44:59,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-24.i [2023-12-24 17:44:59,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537f99fe6/929b98ec53234ae8a4937347e113a02e/FLAG09d7967b0 [2023-12-24 17:44:59,098 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537f99fe6/929b98ec53234ae8a4937347e113a02e [2023-12-24 17:44:59,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 17:44:59,100 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 17:44:59,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 17:44:59,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 17:44:59,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 17:44:59,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,105 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54a00031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59, skipping insertion in model container [2023-12-24 17:44:59,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,127 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 17:44:59,220 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-24.i[916,929] [2023-12-24 17:44:59,256 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 17:44:59,265 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 17:44:59,272 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-24.i[916,929] [2023-12-24 17:44:59,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 17:44:59,311 INFO L206 MainTranslator]: Completed translation [2023-12-24 17:44:59,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59 WrapperNode [2023-12-24 17:44:59,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 17:44:59,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 17:44:59,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 17:44:59,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 17:44:59,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,389 INFO L138 Inliner]: procedures = 33, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 452 [2023-12-24 17:44:59,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 17:44:59,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 17:44:59,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 17:44:59,390 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 17:44:59,398 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,417 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 17 writes are split as follows [0, 17]. [2023-12-24 17:44:59,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,450 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 17:44:59,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 17:44:59,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 17:44:59,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 17:44:59,475 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (1/1) ... [2023-12-24 17:44:59,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 17:44:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 17:44:59,524 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-24 17:44:59,558 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-24 17:44:59,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 17:44:59,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 17:44:59,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 17:44:59,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 17:44:59,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 17:44:59,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 17:44:59,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 17:44:59,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 17:44:59,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 17:44:59,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 17:44:59,565 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 17:44:59,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 17:44:59,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 17:44:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 17:44:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 17:44:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 17:44:59,566 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 17:44:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 17:44:59,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 17:44:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 17:44:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 17:44:59,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 17:44:59,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 17:44:59,684 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 17:44:59,686 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 17:45:18,898 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 17:45:18,928 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 17:45:18,928 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 17:45:18,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:45:18 BoogieIcfgContainer [2023-12-24 17:45:18,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 17:45:18,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 17:45:18,931 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 17:45:18,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 17:45:18,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 05:44:59" (1/3) ... [2023-12-24 17:45:18,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17624cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:45:18, skipping insertion in model container [2023-12-24 17:45:18,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:44:59" (2/3) ... [2023-12-24 17:45:18,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17624cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:45:18, skipping insertion in model container [2023-12-24 17:45:18,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:45:18" (3/3) ... [2023-12-24 17:45:18,935 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-24.i [2023-12-24 17:45:18,948 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 17:45:18,948 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 17:45:18,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 17:45:18,987 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;@14893a7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 17:45:18,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 17:45:18,991 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 17:45:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 17:45:19,005 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:45:19,005 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 17:45:19,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:45:19,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:45:19,010 INFO L85 PathProgramCache]: Analyzing trace with hash -90317922, now seen corresponding path program 1 times [2023-12-24 17:45:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:45:19,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165106371] [2023-12-24 17:45:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:45:19,020 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-24 17:45:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:45:19,022 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-24 17:45:19,025 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-24 17:45:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:45:20,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 17:45:20,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:45:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-12-24 17:45:20,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:45:20,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:45:20,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165106371] [2023-12-24 17:45:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165106371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:45:20,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:45:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 17:45:20,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222382942] [2023-12-24 17:45:20,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:45:20,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 17:45:20,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:45:20,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 17:45:20,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 17:45:20,132 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 17:45:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:45:20,235 INFO L93 Difference]: Finished difference Result 185 states and 291 transitions. [2023-12-24 17:45:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 17:45:20,238 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-12-24 17:45:20,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:45:20,243 INFO L225 Difference]: With dead ends: 185 [2023-12-24 17:45:20,244 INFO L226 Difference]: Without dead ends: 92 [2023-12-24 17:45:20,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 118 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-24 17:45:20,249 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 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.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:45:20,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 17:45:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-24 17:45:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-24 17:45:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 17:45:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2023-12-24 17:45:20,296 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2023-12-24 17:45:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:45:20,296 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2023-12-24 17:45:20,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-24 17:45:20,297 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2023-12-24 17:45:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 17:45:20,300 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:45:20,300 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 17:45:20,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 17:45:20,512 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-24 17:45:20,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:45:20,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:45:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2157560, now seen corresponding path program 1 times [2023-12-24 17:45:20,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:45:20,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682527402] [2023-12-24 17:45:20,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:45:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:45:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:45:20,515 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-24 17:45:20,518 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-24 17:45:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:45:21,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 17:45:21,516 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:45:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 17:45:21,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:45:21,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:45:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682527402] [2023-12-24 17:45:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682527402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:45:21,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:45:21,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 17:45:21,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638300185] [2023-12-24 17:45:21,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:45:21,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 17:45:21,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:45:21,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 17:45:21,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 17:45:21,630 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:45:21,865 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2023-12-24 17:45:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 17:45:21,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-24 17:45:21,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:45:21,867 INFO L225 Difference]: With dead ends: 184 [2023-12-24 17:45:21,867 INFO L226 Difference]: Without dead ends: 93 [2023-12-24 17:45:21,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 17:45:21,869 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 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.2s IncrementalHoareTripleChecker+Time [2023-12-24 17:45:21,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 17:45:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-24 17:45:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-24 17:45:21,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 17:45:21,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2023-12-24 17:45:21,877 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 119 [2023-12-24 17:45:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:45:21,878 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2023-12-24 17:45:21,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2023-12-24 17:45:21,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 17:45:21,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:45:21,882 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 17:45:21,907 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-24 17:45:22,084 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-24 17:45:22,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:45:22,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:45:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash 221012278, now seen corresponding path program 1 times [2023-12-24 17:45:22,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:45:22,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388269038] [2023-12-24 17:45:22,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:45:22,086 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-24 17:45:22,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:45:22,087 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-24 17:45:22,090 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-24 17:45:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:45:23,011 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 17:45:23,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:45:23,099 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 17:45:23,100 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:45:23,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:45:23,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388269038] [2023-12-24 17:45:23,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388269038] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:45:23,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:45:23,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 17:45:23,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077405524] [2023-12-24 17:45:23,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:45:23,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 17:45:23,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:45:23,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 17:45:23,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 17:45:23,101 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:23,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:45:23,325 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2023-12-24 17:45:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 17:45:23,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-24 17:45:23,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:45:23,327 INFO L225 Difference]: With dead ends: 205 [2023-12-24 17:45:23,327 INFO L226 Difference]: Without dead ends: 113 [2023-12-24 17:45:23,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 17:45:23,328 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 40 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 17:45:23,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 269 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 17:45:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-24 17:45:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2023-12-24 17:45:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 17:45:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2023-12-24 17:45:23,337 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 119 [2023-12-24 17:45:23,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:45:23,337 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2023-12-24 17:45:23,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:23,337 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2023-12-24 17:45:23,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 17:45:23,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:45:23,338 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 17:45:23,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 17:45:23,539 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-24 17:45:23,539 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:45:23,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:45:23,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1058851400, now seen corresponding path program 1 times [2023-12-24 17:45:23,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:45:23,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2041154155] [2023-12-24 17:45:23,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:45:23,541 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-24 17:45:23,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:45:23,545 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-24 17:45:23,546 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-24 17:45:24,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:45:24,463 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 17:45:24,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:45:24,822 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 17:45:24,822 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:45:24,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:45:24,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2041154155] [2023-12-24 17:45:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2041154155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:45:24,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:45:24,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 17:45:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248593104] [2023-12-24 17:45:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:45:24,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:45:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:45:24,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:45:24,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 17:45:24,824 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:25,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:45:25,738 INFO L93 Difference]: Finished difference Result 208 states and 301 transitions. [2023-12-24 17:45:25,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 17:45:25,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-24 17:45:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:45:25,740 INFO L225 Difference]: With dead ends: 208 [2023-12-24 17:45:25,740 INFO L226 Difference]: Without dead ends: 115 [2023-12-24 17:45:25,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 17:45:25,741 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 46 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 17:45:25,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 498 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 17:45:25,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-24 17:45:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 98. [2023-12-24 17:45:25,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 17:45:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2023-12-24 17:45:25,755 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 119 [2023-12-24 17:45:25,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:45:25,756 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2023-12-24 17:45:25,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:25,756 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2023-12-24 17:45:25,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 17:45:25,757 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:45:25,757 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 17:45:25,780 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-24 17:45:25,964 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-24 17:45:25,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:45:25,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:45:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1868198026, now seen corresponding path program 1 times [2023-12-24 17:45:25,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:45:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95897026] [2023-12-24 17:45:25,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:45:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 17:45:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:45:25,967 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-24 17:45:25,973 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-24 17:45:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:45:26,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 17:45:26,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:45:27,410 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 17:45:27,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:45:27,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:45:27,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95897026] [2023-12-24 17:45:27,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95897026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:45:27,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:45:27,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 17:45:27,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639349727] [2023-12-24 17:45:27,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:45:27,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 17:45:27,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:45:27,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 17:45:27,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 17:45:27,412 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:29,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:45:29,010 INFO L93 Difference]: Finished difference Result 215 states and 306 transitions. [2023-12-24 17:45:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 17:45:29,013 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-24 17:45:29,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:45:29,014 INFO L225 Difference]: With dead ends: 215 [2023-12-24 17:45:29,014 INFO L226 Difference]: Without dead ends: 118 [2023-12-24 17:45:29,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 17:45:29,015 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 49 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-24 17:45:29,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 616 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-24 17:45:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-24 17:45:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 100. [2023-12-24 17:45:29,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 17:45:29,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2023-12-24 17:45:29,024 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 119 [2023-12-24 17:45:29,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:45:29,024 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2023-12-24 17:45:29,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2023-12-24 17:45:29,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 17:45:29,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:45:29,025 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 17:45:29,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 17:45:29,241 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-24 17:45:29,242 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:45:29,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:45:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1810939724, now seen corresponding path program 1 times [2023-12-24 17:45:29,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:45:29,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089088344] [2023-12-24 17:45:29,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:45:29,243 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-24 17:45:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:45:29,244 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-24 17:45:29,246 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-24 17:45:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:45:30,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 17:45:30,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:45:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 17:45:30,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:45:30,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:45:30,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089088344] [2023-12-24 17:45:30,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089088344] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:45:30,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:45:30,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 17:45:30,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159955177] [2023-12-24 17:45:30,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:45:30,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 17:45:30,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:45:30,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 17:45:30,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 17:45:30,889 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:45:33,345 INFO L93 Difference]: Finished difference Result 218 states and 306 transitions. [2023-12-24 17:45:33,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 17:45:33,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-24 17:45:33,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:45:33,347 INFO L225 Difference]: With dead ends: 218 [2023-12-24 17:45:33,347 INFO L226 Difference]: Without dead ends: 119 [2023-12-24 17:45:33,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-24 17:45:33,348 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 40 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-24 17:45:33,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 728 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-24 17:45:33,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-24 17:45:33,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2023-12-24 17:45:33,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-24 17:45:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2023-12-24 17:45:33,355 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 119 [2023-12-24 17:45:33,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:45:33,355 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2023-12-24 17:45:33,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:45:33,356 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2023-12-24 17:45:33,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 17:45:33,356 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:45:33,357 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 17:45:33,378 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 (7)] Ended with exit code 0 [2023-12-24 17:45:33,571 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-24 17:45:33,572 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:45:33,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:45:33,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1810880142, now seen corresponding path program 1 times [2023-12-24 17:45:33,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:45:33,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789368100] [2023-12-24 17:45:33,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:45:33,573 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-24 17:45:33,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:45:33,574 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-24 17:45:33,575 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-24 17:45:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:45:35,430 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 17:45:35,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:45:44,432 WARN L293 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:45:53,026 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:46:02,140 WARN L293 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:46:06,302 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-24 17:46:10,598 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-24 17:46:19,628 WARN L293 SmtUtils]: Spent 9.03s on a formula simplification that was a NOOP. DAG size: 13 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:46:27,967 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:46:36,539 WARN L293 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:46:45,628 WARN L293 SmtUtils]: Spent 9.09s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:46:49,805 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= .cse2 |c_ULTIMATE.start_step_#t~mem35#1|) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2023-12-24 17:46:54,111 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse3 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= .cse2 |c_ULTIMATE.start_step_#t~mem35#1|) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2023-12-24 17:47:02,714 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:47:11,303 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:47:19,956 WARN L293 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:47:24,134 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (not (fp.geq .cse0 .cse1)) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2023-12-24 17:47:28,457 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (not (fp.geq .cse0 .cse1)) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-24 17:47:37,077 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:47:45,704 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:47:54,333 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:47:54,383 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 192 treesize of output 84 [2023-12-24 17:48:07,182 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:48:15,804 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:48:24,410 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:48:37,660 WARN L293 SmtUtils]: Spent 9.06s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:48:46,025 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:48:53,678 WARN L293 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 12 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:48:57,847 WARN L854 $PredicateComparison]: unable to prove that (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2)))))))) is different from false [2023-12-24 17:49:01,954 WARN L876 $PredicateComparison]: unable to prove that (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2)))))))) is different from true [2023-12-24 17:49:14,717 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:49:23,333 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:49:31,935 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:49:36,097 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2))))))) is different from false [2023-12-24 17:49:40,204 WARN L876 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2))))))) is different from true [2023-12-24 17:49:52,971 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:50:01,573 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:50:10,166 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:50:22,945 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:50:31,550 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:50:40,147 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:50:52,914 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:51:01,541 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:51:10,150 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:51:22,917 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:51:31,523 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:51:40,128 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:51:52,913 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:52:01,520 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:52:10,117 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:52:22,890 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:52:31,506 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:52:40,114 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:52:52,897 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:53:01,516 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:53:10,132 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:53:22,919 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:53:31,541 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:53:40,163 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:53:52,926 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:54:01,545 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:54:10,150 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:54:22,929 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:54:31,550 WARN L293 SmtUtils]: Spent 8.62s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:54:40,161 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:54:52,943 WARN L293 SmtUtils]: Spent 8.61s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:55:01,571 WARN L293 SmtUtils]: Spent 8.63s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:55:10,161 WARN L293 SmtUtils]: Spent 8.59s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:55:22,929 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:55:31,586 WARN L293 SmtUtils]: Spent 8.66s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:55:40,185 WARN L293 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 17:55:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 17:55:40,186 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 17:55:40,186 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:55:40,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789368100] [2023-12-24 17:55:40,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789368100] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 17:55:40,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 17:55:40,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 17:55:40,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832683574] [2023-12-24 17:55:40,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:55:40,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 17:55:40,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:55:40,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 17:55:40,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=6, Unknown=10, NotChecked=40, Total=72 [2023-12-24 17:55:40,188 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:55:46,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:55:50,769 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= .cse0 |c_ULTIMATE.start_step_#t~mem31#1|) (= |c_ULTIMATE.start_step_#t~ite34#1| .cse1) (fp.gt .cse1 (fp.div c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= .cse0 |c_ULTIMATE.start_step_#t~mem30#1|) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2023-12-24 17:55:55,072 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (let ((.cse3 (select (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|) (bvadd (_ bv13 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse0))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= .cse0 |c_ULTIMATE.start_step_#t~mem31#1|) (= |c_ULTIMATE.start_step_#t~ite34#1| .cse1) (fp.gt .cse1 (fp.div c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= .cse0 |c_ULTIMATE.start_step_#t~mem30#1|) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from true [2023-12-24 17:56:00,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:56:07,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:56:12,011 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 [] [2023-12-24 17:56:17,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:56:21,532 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 [] [2023-12-24 17:56:27,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:56:31,552 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 [] [2023-12-24 17:56:37,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:56:41,102 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 [] [2023-12-24 17:56:47,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.87s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:56:51,668 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 [] [2023-12-24 17:56:57,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:57:01,645 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 [] [2023-12-24 17:57:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:57:02,544 INFO L93 Difference]: Finished difference Result 222 states and 310 transitions. [2023-12-24 17:57:02,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 17:57:02,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-24 17:57:02,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:57:02,551 INFO L225 Difference]: With dead ends: 222 [2023-12-24 17:57:02,551 INFO L226 Difference]: Without dead ends: 220 [2023-12-24 17:57:02,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.0s TimeCoverageRelationStatistics Valid=18, Invalid=6, Unknown=12, NotChecked=54, Total=90 [2023-12-24 17:57:02,552 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 76 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 1658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 1493 IncrementalHoareTripleChecker+Unchecked, 73.5s IncrementalHoareTripleChecker+Time [2023-12-24 17:57:02,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 304 Invalid, 1658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 14 Unknown, 1493 Unchecked, 73.5s Time] [2023-12-24 17:57:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-12-24 17:57:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2023-12-24 17:57:02,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 185 states have (on average 1.335135135135135) internal successors, (247), 185 states have internal predecessors, (247), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-24 17:57:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 307 transitions. [2023-12-24 17:57:02,567 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 307 transitions. Word has length 119 [2023-12-24 17:57:02,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:57:02,567 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 307 transitions. [2023-12-24 17:57:02,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:57:02,567 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 307 transitions. [2023-12-24 17:57:02,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-24 17:57:02,568 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:57:02,568 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 17:57:02,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 17:57:02,769 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-24 17:57:02,770 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:57:02,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:57:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash 795143412, now seen corresponding path program 1 times [2023-12-24 17:57:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:57:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108690477] [2023-12-24 17:57:02,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:57:02,771 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-24 17:57:02,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:57:02,772 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-24 17:57:02,772 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-24 17:57:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:57:06,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-24 17:57:06,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:57:06,609 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-24 17:57:07,389 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-24 17:57:07,804 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-24 17:57:08,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:57:08,921 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-24 17:57:11,066 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:57:11,067 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 46 treesize of output 51 [2023-12-24 17:57:13,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:57:13,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2023-12-24 17:57:14,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:57:14,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 54 [2023-12-24 17:57:16,084 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 100 treesize of output 76 [2023-12-24 17:57:16,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 17:57:16,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:57:16,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 76 treesize of output 138 [2023-12-24 17:57:16,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 58 [2023-12-24 17:57:17,657 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:57:17,657 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 170 treesize of output 129 [2023-12-24 17:57:19,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:57:19,306 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 163 treesize of output 141 [2023-12-24 17:57:23,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:57:23,611 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 203 treesize of output 89 [2023-12-24 17:57:24,373 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 318 proven. 36 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-12-24 17:57:24,373 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:57:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 17:57:25,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:57:25,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108690477] [2023-12-24 17:57:25,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108690477] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 17:57:25,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 17:57:25,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 16 [2023-12-24 17:57:25,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986471610] [2023-12-24 17:57:25,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 17:57:25,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 17:57:25,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:57:25,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 17:57:25,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-24 17:57:25,734 INFO L87 Difference]: Start difference. First operand 218 states and 307 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:57:31,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:57:35,398 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 [] [2023-12-24 17:57:39,403 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 [] [2023-12-24 17:57:45,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:57:49,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:57:53,440 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 [] [2023-12-24 17:57:58,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:58:04,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:58:13,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:58:18,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:58:24,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:58:30,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:58:36,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:58:40,699 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 [] [2023-12-24 17:58:46,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:58:50,241 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 [] [2023-12-24 17:58:52,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 17:58:52,002 INFO L93 Difference]: Finished difference Result 606 states and 845 transitions. [2023-12-24 17:58:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 17:58:52,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-24 17:58:52,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 17:58:52,005 INFO L225 Difference]: With dead ends: 606 [2023-12-24 17:58:52,005 INFO L226 Difference]: Without dead ends: 389 [2023-12-24 17:58:52,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-12-24 17:58:52,006 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 120 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 80.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.6s IncrementalHoareTripleChecker+Time [2023-12-24 17:58:52,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 440 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 16 Unknown, 0 Unchecked, 85.6s Time] [2023-12-24 17:58:52,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-12-24 17:58:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 332. [2023-12-24 17:58:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 293 states have (on average 1.341296928327645) internal successors, (393), 295 states have internal predecessors, (393), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-24 17:58:52,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 461 transitions. [2023-12-24 17:58:52,017 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 461 transitions. Word has length 119 [2023-12-24 17:58:52,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 17:58:52,018 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 461 transitions. [2023-12-24 17:58:52,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-24 17:58:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 461 transitions. [2023-12-24 17:58:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-24 17:58:52,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 17:58:52,019 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 17:58:52,052 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-24 17:58:52,230 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-24 17:58:52,231 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 17:58:52,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 17:58:52,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1992958857, now seen corresponding path program 1 times [2023-12-24 17:58:52,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 17:58:52,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1350306788] [2023-12-24 17:58:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 17:58:52,232 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-24 17:58:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 17:58:52,233 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-24 17:58:52,236 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-24 17:58:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 17:58:55,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 17:58:55,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 17:58:55,884 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-24 17:58:57,812 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 42 treesize of output 20 [2023-12-24 17:58:58,482 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 81 treesize of output 61 [2023-12-24 17:58:58,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 17:58:58,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2023-12-24 17:58:59,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 17:58:59,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 30 [2023-12-24 17:58:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 138 proven. 6 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-24 17:58:59,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 17:59:02,707 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 72 proven. 6 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2023-12-24 17:59:02,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 17:59:02,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1350306788] [2023-12-24 17:59:02,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1350306788] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 17:59:02,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 17:59:02,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2023-12-24 17:59:02,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419100667] [2023-12-24 17:59:02,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 17:59:02,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 17:59:02,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 17:59:02,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 17:59:02,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2023-12-24 17:59:02,709 INFO L87 Difference]: Start difference. First operand 332 states and 461 transitions. Second operand has 17 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 17 states have internal predecessors, (69), 7 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 7 states have call successors, (18) [2023-12-24 17:59:19,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:59:23,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:59:27,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:59:31,249 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:59:35,262 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 [] [2023-12-24 17:59:39,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 17:59:43,285 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 [] Received shutdown request... [2023-12-24 17:59:44,079 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-24 17:59:44,105 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 (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 17:59:45,144 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-24 17:59:45,280 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-24 17:59:45,424 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-24 17:59:45,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 17:59:45,425 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 188 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 279 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.8s IncrementalHoareTripleChecker+Time [2023-12-24 17:59:45,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 97 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 471 Invalid, 7 Unknown, 0 Unchecked, 36.8s Time] [2023-12-24 17:59:45,426 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 17:59:45,426 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-24 17:59:45,429 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 17:59:45,431 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 17:59:45,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 05:59:45 BoogieIcfgContainer [2023-12-24 17:59:45,432 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 17:59:45,432 INFO L158 Benchmark]: Toolchain (without parser) took 886332.41ms. Allocated memory was 222.3MB in the beginning and 291.5MB in the end (delta: 69.2MB). Free memory was 158.3MB in the beginning and 226.5MB in the end (delta: -68.2MB). Peak memory consumption was 1.5MB. Max. memory is 8.0GB. [2023-12-24 17:59:45,432 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 222.3MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 17:59:45,433 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.40ms. Allocated memory was 222.3MB in the beginning and 291.5MB in the end (delta: 69.2MB). Free memory was 158.3MB in the beginning and 259.1MB in the end (delta: -100.8MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. [2023-12-24 17:59:45,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.59ms. Allocated memory is still 291.5MB. Free memory was 259.1MB in the beginning and 255.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 17:59:45,433 INFO L158 Benchmark]: Boogie Preprocessor took 84.43ms. Allocated memory is still 291.5MB. Free memory was 255.7MB in the beginning and 250.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 17:59:45,433 INFO L158 Benchmark]: RCFGBuilder took 19453.90ms. Allocated memory is still 291.5MB. Free memory was 250.5MB in the beginning and 215.3MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2023-12-24 17:59:45,433 INFO L158 Benchmark]: TraceAbstraction took 866501.41ms. Allocated memory is still 291.5MB. Free memory was 214.3MB in the beginning and 226.5MB in the end (delta: -12.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 17:59:45,434 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.13ms. Allocated memory is still 222.3MB. Free memory is still 173.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.40ms. Allocated memory was 222.3MB in the beginning and 291.5MB in the end (delta: 69.2MB). Free memory was 158.3MB in the beginning and 259.1MB in the end (delta: -100.8MB). Peak memory consumption was 23.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.59ms. Allocated memory is still 291.5MB. Free memory was 259.1MB in the beginning and 255.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 84.43ms. Allocated memory is still 291.5MB. Free memory was 255.7MB in the beginning and 250.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 19453.90ms. Allocated memory is still 291.5MB. Free memory was 250.5MB in the beginning and 215.3MB in the end (delta: 35.1MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. * TraceAbstraction took 866501.41ms. Allocated memory is still 291.5MB. Free memory was 214.3MB in the beginning and 226.5MB in the end (delta: -12.2MB). There was no memory consumed. 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, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 866.5s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 217.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 37 mSolverCounterUnknown, 571 SdHoareTripleChecker+Valid, 199.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 559 mSDsluCounter, 3335 SdHoareTripleChecker+Invalid, 190.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1493 IncrementalHoareTripleChecker+Unchecked, 2251 mSDsCounter, 293 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1026 IncrementalHoareTripleChecker+Invalid, 2850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 293 mSolverCounterUnsat, 1084 mSDtfsCounter, 1026 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1340 GetRequests, 1250 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 67.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=8, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 130 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 13.7s SatisfiabilityAnalysisTime, 633.1s InterpolantComputationTime, 1072 NumberOfCodeBlocks, 1072 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1300 ConstructedInterpolants, 82 QuantifiedInterpolants, 7655 SizeOfPredicates, 35 NumberOfNonLiveVariables, 2168 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 4572/4620 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