/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-sp_file-11.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 19:09:09,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 19:09:09,526 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 19:09:09,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 19:09:09,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 19:09:09,552 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 19:09:09,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 19:09:09,552 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 19:09:09,553 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 19:09:09,556 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 19:09:09,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 19:09:09,556 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 19:09:09,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 19:09:09,558 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 19:09:09,558 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 19:09:09,558 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 19:09:09,558 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 19:09:09,559 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 19:09:09,559 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 19:09:09,559 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 19:09:09,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 19:09:09,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 19:09:09,559 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 19:09:09,560 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 19:09:09,560 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 19:09:09,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 19:09:09,560 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 19:09:09,560 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 19:09:09,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 19:09:09,561 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 19:09:09,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 19:09:09,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 19:09:09,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 19:09:09,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 19:09:09,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 19:09:09,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 19:09:09,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 19:09:09,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 19:09:09,562 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 19:09:09,562 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 19:09:09,562 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 19:09:09,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 19:09:09,563 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 19:09:09,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 19:09:09,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 19:09:09,563 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 19:09:09,563 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 19:09:09,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 19:09:09,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 19:09:09,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 19:09:09,771 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 19:09:09,771 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 19:09:09,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-11.i [2023-12-24 19:09:10,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 19:09:10,842 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 19:09:10,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-11.i [2023-12-24 19:09:10,850 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61128e6a3/5278d13d0d5a479581cc8cec9074f22f/FLAG5a7c87442 [2023-12-24 19:09:10,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61128e6a3/5278d13d0d5a479581cc8cec9074f22f [2023-12-24 19:09:10,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 19:09:10,865 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 19:09:10,867 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 19:09:10,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 19:09:10,870 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 19:09:10,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 07:09:10" (1/1) ... [2023-12-24 19:09:10,871 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485ed8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:10, skipping insertion in model container [2023-12-24 19:09:10,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 07:09:10" (1/1) ... [2023-12-24 19:09:10,905 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 19:09:11,011 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-sp_file-11.i[917,930] [2023-12-24 19:09:11,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 19:09:11,076 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 19:09:11,088 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-sp_file-11.i[917,930] [2023-12-24 19:09:11,115 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 19:09:11,135 INFO L206 MainTranslator]: Completed translation [2023-12-24 19:09:11,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11 WrapperNode [2023-12-24 19:09:11,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 19:09:11,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 19:09:11,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 19:09:11,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 19:09:11,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,183 INFO L138 Inliner]: procedures = 33, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 592 [2023-12-24 19:09:11,184 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 19:09:11,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 19:09:11,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 19:09:11,184 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 19:09:11,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,198 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,225 INFO L175 MemorySlicer]: Split 141 memory accesses to 2 slices as follows [2, 139]. 99 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 19:09:11,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,243 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,255 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 19:09:11,256 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 19:09:11,256 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 19:09:11,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 19:09:11,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (1/1) ... [2023-12-24 19:09:11,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 19:09:11,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 19:09:11,287 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 19:09:11,292 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 19:09:11,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 19:09:11,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 19:09:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 19:09:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 19:09:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 19:09:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 19:09:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 19:09:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 19:09:11,309 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 19:09:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 19:09:11,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 19:09:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 19:09:11,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 19:09:11,420 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 19:09:11,422 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 19:09:29,404 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 19:09:29,460 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 19:09:29,460 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 19:09:29,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 07:09:29 BoogieIcfgContainer [2023-12-24 19:09:29,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 19:09:29,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 19:09:29,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 19:09:29,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 19:09:29,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 07:09:10" (1/3) ... [2023-12-24 19:09:29,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbff1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 07:09:29, skipping insertion in model container [2023-12-24 19:09:29,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 07:09:11" (2/3) ... [2023-12-24 19:09:29,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cbff1e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 07:09:29, skipping insertion in model container [2023-12-24 19:09:29,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 07:09:29" (3/3) ... [2023-12-24 19:09:29,466 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-11.i [2023-12-24 19:09:29,479 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 19:09:29,479 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 19:09:29,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 19:09:29,513 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;@a2a1c27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 19:09:29,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 19:09:29,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 113 states have (on average 1.4955752212389382) internal successors, (169), 114 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 19:09:29,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-24 19:09:29,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:09:29,529 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:29,529 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:09:29,533 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:09:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1611223448, now seen corresponding path program 1 times [2023-12-24 19:09:29,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:09:29,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195729161] [2023-12-24 19:09:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:09:29,544 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 19:09:29,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:09:29,546 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 19:09:29,548 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 19:09:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:09:30,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 19:09:30,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:09:30,522 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2023-12-24 19:09:30,522 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:09:30,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:09:30,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195729161] [2023-12-24 19:09:30,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195729161] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:09:30,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:09:30,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 19:09:30,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505462949] [2023-12-24 19:09:30,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:09:30,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 19:09:30,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:09:30,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 19:09:30,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 19:09:30,547 INFO L87 Difference]: Start difference. First operand has 132 states, 113 states have (on average 1.4955752212389382) internal successors, (169), 114 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 19:09:30,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:09:30,606 INFO L93 Difference]: Finished difference Result 261 states and 416 transitions. [2023-12-24 19:09:30,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 19:09:30,608 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-24 19:09:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:09:30,613 INFO L225 Difference]: With dead ends: 261 [2023-12-24 19:09:30,613 INFO L226 Difference]: Without dead ends: 130 [2023-12-24 19:09:30,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 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 19:09:30,618 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 19:09:30,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 19:09:30,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-12-24 19:09:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2023-12-24 19:09:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.4642857142857142) internal successors, (164), 112 states have internal predecessors, (164), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 19:09:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 196 transitions. [2023-12-24 19:09:30,648 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 196 transitions. Word has length 128 [2023-12-24 19:09:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:09:30,648 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 196 transitions. [2023-12-24 19:09:30,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 19:09:30,649 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 196 transitions. [2023-12-24 19:09:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-24 19:09:30,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:09:30,651 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:30,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 19:09:30,852 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 19:09:30,852 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:09:30,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:09:30,853 INFO L85 PathProgramCache]: Analyzing trace with hash 19231952, now seen corresponding path program 1 times [2023-12-24 19:09:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:09:30,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036207280] [2023-12-24 19:09:30,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:09:30,854 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 19:09:30,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:09:30,855 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 19:09:30,856 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 19:09:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:09:31,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 19:09:31,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:09:31,832 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 19:09:31,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:09:31,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:09:31,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036207280] [2023-12-24 19:09:31,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036207280] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:09:31,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:09:31,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 19:09:31,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642357395] [2023-12-24 19:09:31,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:09:31,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 19:09:31,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:09:31,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 19:09:31,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 19:09:31,835 INFO L87 Difference]: Start difference. First operand 130 states and 196 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:09:32,035 INFO L93 Difference]: Finished difference Result 292 states and 441 transitions. [2023-12-24 19:09:32,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 19:09:32,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-24 19:09:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:09:32,041 INFO L225 Difference]: With dead ends: 292 [2023-12-24 19:09:32,041 INFO L226 Difference]: Without dead ends: 163 [2023-12-24 19:09:32,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:09:32,042 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 71 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 19:09:32,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 553 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 19:09:32,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-24 19:09:32,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 132. [2023-12-24 19:09:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 114 states have (on average 1.456140350877193) internal successors, (166), 114 states have internal predecessors, (166), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 19:09:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 198 transitions. [2023-12-24 19:09:32,060 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 198 transitions. Word has length 128 [2023-12-24 19:09:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:09:32,061 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 198 transitions. [2023-12-24 19:09:32,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 198 transitions. [2023-12-24 19:09:32,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-24 19:09:32,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:09:32,063 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:32,098 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 19:09:32,292 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 19:09:32,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:09:32,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:09:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash 416893036, now seen corresponding path program 1 times [2023-12-24 19:09:32,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:09:32,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087555048] [2023-12-24 19:09:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:09:32,294 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 19:09:32,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:09:32,295 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 19:09:32,296 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 19:09:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:09:33,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 19:09:33,186 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:09:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 19:09:33,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:09:33,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:09:33,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087555048] [2023-12-24 19:09:33,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087555048] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:09:33,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:09:33,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 19:09:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678349815] [2023-12-24 19:09:33,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:09:33,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 19:09:33,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:09:33,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 19:09:33,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:09:33,330 INFO L87 Difference]: Start difference. First operand 132 states and 198 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:09:33,671 INFO L93 Difference]: Finished difference Result 287 states and 431 transitions. [2023-12-24 19:09:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 19:09:33,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-12-24 19:09:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:09:33,673 INFO L225 Difference]: With dead ends: 287 [2023-12-24 19:09:33,673 INFO L226 Difference]: Without dead ends: 156 [2023-12-24 19:09:33,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 19:09:33,675 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 89 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 19:09:33,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 781 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 19:09:33,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-24 19:09:33,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 135. [2023-12-24 19:09:33,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 117 states have internal predecessors, (169), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 19:09:33,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2023-12-24 19:09:33,683 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 130 [2023-12-24 19:09:33,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:09:33,683 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2023-12-24 19:09:33,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:33,683 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2023-12-24 19:09:33,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-24 19:09:33,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:09:33,685 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:33,712 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 19:09:33,900 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 19:09:33,903 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:09:33,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:09:33,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1880407876, now seen corresponding path program 1 times [2023-12-24 19:09:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:09:33,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [834487903] [2023-12-24 19:09:33,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:09:33,904 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 19:09:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:09:33,905 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 19:09:33,909 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 19:09:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:09:34,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 19:09:34,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:09:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 19:09:34,961 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:09:34,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:09:34,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [834487903] [2023-12-24 19:09:34,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [834487903] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:09:34,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:09:34,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 19:09:34,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871311174] [2023-12-24 19:09:34,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:09:34,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 19:09:34,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:09:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 19:09:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 19:09:34,962 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:39,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 19:09:41,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:09:41,304 INFO L93 Difference]: Finished difference Result 341 states and 507 transitions. [2023-12-24 19:09:41,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 19:09:41,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-12-24 19:09:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:09:41,306 INFO L225 Difference]: With dead ends: 341 [2023-12-24 19:09:41,306 INFO L226 Difference]: Without dead ends: 207 [2023-12-24 19:09:41,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:09:41,308 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 111 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-24 19:09:41,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 500 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2023-12-24 19:09:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-24 19:09:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 136. [2023-12-24 19:09:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 118 states have internal predecessors, (170), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 19:09:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2023-12-24 19:09:41,315 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 131 [2023-12-24 19:09:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:09:41,316 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2023-12-24 19:09:41,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2023-12-24 19:09:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-24 19:09:41,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:09:41,317 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:41,342 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 19:09:41,525 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 19:09:41,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:09:41,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:09:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2138573314, now seen corresponding path program 1 times [2023-12-24 19:09:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:09:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553262664] [2023-12-24 19:09:41,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:09:41,527 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 19:09:41,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:09:41,528 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 19:09:41,530 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 19:09:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:09:42,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 19:09:42,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:09:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 19:09:42,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:09:42,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:09:42,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553262664] [2023-12-24 19:09:42,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553262664] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:09:42,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:09:42,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 19:09:42,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953252965] [2023-12-24 19:09:42,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:09:42,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 19:09:42,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:09:42,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 19:09:42,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:09:42,513 INFO L87 Difference]: Start difference. First operand 136 states and 202 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:09:43,228 INFO L93 Difference]: Finished difference Result 342 states and 507 transitions. [2023-12-24 19:09:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 19:09:43,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 131 [2023-12-24 19:09:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:09:43,229 INFO L225 Difference]: With dead ends: 342 [2023-12-24 19:09:43,230 INFO L226 Difference]: Without dead ends: 207 [2023-12-24 19:09:43,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 19:09:43,231 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 120 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 19:09:43,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 816 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 19:09:43,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-24 19:09:43,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 137. [2023-12-24 19:09:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.4369747899159664) internal successors, (171), 119 states have internal predecessors, (171), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 19:09:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 203 transitions. [2023-12-24 19:09:43,243 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 203 transitions. Word has length 131 [2023-12-24 19:09:43,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:09:43,243 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 203 transitions. [2023-12-24 19:09:43,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:43,243 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 203 transitions. [2023-12-24 19:09:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-24 19:09:43,244 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:09:43,244 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:43,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-24 19:09:43,456 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 19:09:43,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:09:43,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:09:43,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1890865815, now seen corresponding path program 1 times [2023-12-24 19:09:43,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:09:43,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903733846] [2023-12-24 19:09:43,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:09:43,458 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 19:09:43,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:09:43,458 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 19:09:43,459 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 19:09:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:09:44,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 19:09:44,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:09:44,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-24 19:09:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 19:09:45,697 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:09:45,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:09:45,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903733846] [2023-12-24 19:09:45,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903733846] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:09:45,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:09:45,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 19:09:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263005630] [2023-12-24 19:09:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:09:45,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 19:09:45,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:09:45,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 19:09:45,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 19:09:45,699 INFO L87 Difference]: Start difference. First operand 137 states and 203 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:50,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 19:09:55,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 19:09:56,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:09:56,322 INFO L93 Difference]: Finished difference Result 429 states and 639 transitions. [2023-12-24 19:09:56,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 19:09:56,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-24 19:09:56,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:09:56,324 INFO L225 Difference]: With dead ends: 429 [2023-12-24 19:09:56,324 INFO L226 Difference]: Without dead ends: 293 [2023-12-24 19:09:56,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:09:56,325 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 217 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 46 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-12-24 19:09:56,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 428 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 157 Invalid, 2 Unknown, 0 Unchecked, 10.5s Time] [2023-12-24 19:09:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-12-24 19:09:56,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 236. [2023-12-24 19:09:56,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 201 states have (on average 1.4228855721393034) internal successors, (286), 201 states have internal predecessors, (286), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 19:09:56,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 350 transitions. [2023-12-24 19:09:56,336 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 350 transitions. Word has length 132 [2023-12-24 19:09:56,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:09:56,337 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 350 transitions. [2023-12-24 19:09:56,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:56,337 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 350 transitions. [2023-12-24 19:09:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-24 19:09:56,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:09:56,338 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:56,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 19:09:56,545 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 19:09:56,545 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:09:56,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:09:56,546 INFO L85 PathProgramCache]: Analyzing trace with hash 442008154, now seen corresponding path program 1 times [2023-12-24 19:09:56,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:09:56,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369273477] [2023-12-24 19:09:56,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:09:56,546 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 19:09:56,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:09:56,547 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 19:09:56,548 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 19:09:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:09:57,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 19:09:57,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:09:57,545 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 19:09:57,546 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:09:57,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:09:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369273477] [2023-12-24 19:09:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369273477] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:09:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:09:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 19:09:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642538059] [2023-12-24 19:09:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:09:57,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 19:09:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:09:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 19:09:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 19:09:57,547 INFO L87 Difference]: Start difference. First operand 236 states and 350 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:57,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:09:57,839 INFO L93 Difference]: Finished difference Result 390 states and 579 transitions. [2023-12-24 19:09:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 19:09:57,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-24 19:09:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:09:57,841 INFO L225 Difference]: With dead ends: 390 [2023-12-24 19:09:57,841 INFO L226 Difference]: Without dead ends: 254 [2023-12-24 19:09:57,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 19:09:57,841 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 97 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 19:09:57,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 723 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 19:09:57,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-12-24 19:09:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 239. [2023-12-24 19:09:57,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 204 states have (on average 1.4166666666666667) internal successors, (289), 204 states have internal predecessors, (289), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 19:09:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 353 transitions. [2023-12-24 19:09:57,851 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 353 transitions. Word has length 132 [2023-12-24 19:09:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:09:57,851 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 353 transitions. [2023-12-24 19:09:57,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:09:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 353 transitions. [2023-12-24 19:09:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 19:09:57,852 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:09:57,853 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:09:57,881 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 19:09:58,053 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 19:09:58,056 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:09:58,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:09:58,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1489714211, now seen corresponding path program 1 times [2023-12-24 19:09:58,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:09:58,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554541829] [2023-12-24 19:09:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:09:58,057 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 19:09:58,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:09:58,059 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 19:09:58,060 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 19:09:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:09:58,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 19:09:58,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:09:59,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:09:59,170 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 173 treesize of output 65 [2023-12-24 19:09:59,287 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 19:09:59,287 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 19:09:59,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:09:59,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554541829] [2023-12-24 19:09:59,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554541829] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 19:09:59,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 19:09:59,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 19:09:59,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562797772] [2023-12-24 19:09:59,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 19:09:59,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 19:09:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:09:59,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 19:09:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 19:09:59,289 INFO L87 Difference]: Start difference. First operand 239 states and 353 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:10:04,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 19:10:08,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 19:10:12,796 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 19:10:16,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 19:10:21,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 19:10:25,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 19:10:29,183 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 19:10:33,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 19:10:37,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 19:10:41,639 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 19:10:45,652 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 19:10:49,659 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 19:10:54,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 19:10:58,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 19:11:02,019 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 19:11:06,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 19:11:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:11:07,015 INFO L93 Difference]: Finished difference Result 483 states and 714 transitions. [2023-12-24 19:11:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 19:11:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-24 19:11:07,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:11:07,025 INFO L225 Difference]: With dead ends: 483 [2023-12-24 19:11:07,025 INFO L226 Difference]: Without dead ends: 251 [2023-12-24 19:11:07,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 19:11:07,026 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 205 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 66.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 67.5s IncrementalHoareTripleChecker+Time [2023-12-24 19:11:07,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 566 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 16 Unknown, 0 Unchecked, 67.5s Time] [2023-12-24 19:11:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-12-24 19:11:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 239. [2023-12-24 19:11:07,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 204 states have (on average 1.4068627450980393) internal successors, (287), 204 states have internal predecessors, (287), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 19:11:07,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 351 transitions. [2023-12-24 19:11:07,035 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 351 transitions. Word has length 133 [2023-12-24 19:11:07,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:11:07,035 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 351 transitions. [2023-12-24 19:11:07,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 19:11:07,035 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 351 transitions. [2023-12-24 19:11:07,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 19:11:07,036 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:11:07,036 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:11:07,063 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 19:11:07,261 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 19:11:07,261 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:11:07,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:11:07,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1534971107, now seen corresponding path program 1 times [2023-12-24 19:11:07,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:11:07,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536958300] [2023-12-24 19:11:07,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:11:07,262 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 19:11:07,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:11:07,263 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 19:11:07,264 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 19:11:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:11:08,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 19:11:08,625 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:11:08,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2023-12-24 19:11:13,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 59 [2023-12-24 19:11:22,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2023-12-24 19:11:24,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2023-12-24 19:11:25,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2023-12-24 19:11:26,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2023-12-24 19:11:27,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2023-12-24 19:11:29,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 95 [2023-12-24 19:11:31,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 98 [2023-12-24 19:11:32,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:11:32,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 97 treesize of output 98 [2023-12-24 19:11:34,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:11:34,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 124 treesize of output 60 [2023-12-24 19:11:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 276 proven. 112 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2023-12-24 19:11:34,534 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:11:34,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:11:34,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536958300] [2023-12-24 19:11:34,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536958300] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:11:34,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1596495876] [2023-12-24 19:11:34,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:11:34,909 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 19:11:34,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 19:11:34,945 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 19:11:34,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-24 19:11:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:11:38,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 19:11:38,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:11:46,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 29 [2023-12-24 19:11:59,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2023-12-24 19:12:17,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 51 [2023-12-24 19:12:30,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2023-12-24 19:12:31,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 54 [2023-12-24 19:12:32,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 62 [2023-12-24 19:12:45,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2023-12-24 19:12:47,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 73 [2023-12-24 19:13:01,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2023-12-24 19:13:02,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 76 [2023-12-24 19:13:04,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 52 [2023-12-24 19:13:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 292 proven. 112 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-24 19:13:04,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:13:04,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1596495876] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:13:04,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 19:13:04,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-24 19:13:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943493833] [2023-12-24 19:13:04,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 19:13:04,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 19:13:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 19:13:04,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 19:13:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=256, Unknown=21, NotChecked=0, Total=380 [2023-12-24 19:13:04,509 INFO L87 Difference]: Start difference. First operand 239 states and 351 transitions. Second operand has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 16 states have internal predecessors, (125), 12 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2023-12-24 19:13:12,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 19:13:16,569 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 [0] [2023-12-24 19:13:20,573 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 [0] [2023-12-24 19:13:24,577 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 [0] [2023-12-24 19:13:28,594 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 [0] [2023-12-24 19:13:32,602 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 [0] [2023-12-24 19:13:36,613 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 [0] [2023-12-24 19:13:40,617 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 [0] [2023-12-24 19:13:44,620 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 [0] [2023-12-24 19:13:48,629 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 [0] [2023-12-24 19:13:52,633 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 [0] [2023-12-24 19:13:56,643 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 [0] [2023-12-24 19:14:00,656 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 [0] [2023-12-24 19:14:04,662 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 [0] [2023-12-24 19:14:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 19:14:09,583 INFO L93 Difference]: Finished difference Result 417 states and 614 transitions. [2023-12-24 19:14:09,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 19:14:09,590 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 16 states have internal predecessors, (125), 12 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) Word has length 135 [2023-12-24 19:14:09,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 19:14:09,591 INFO L225 Difference]: With dead ends: 417 [2023-12-24 19:14:09,591 INFO L226 Difference]: Without dead ends: 243 [2023-12-24 19:14:09,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 322 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 88.8s TimeCoverageRelationStatistics Valid=142, Invalid=299, Unknown=21, NotChecked=0, Total=462 [2023-12-24 19:14:09,592 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 191 mSDsluCounter, 1013 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 115 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.3s IncrementalHoareTripleChecker+Time [2023-12-24 19:14:09,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1172 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 762 Invalid, 14 Unknown, 0 Unchecked, 64.3s Time] [2023-12-24 19:14:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-24 19:14:09,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2023-12-24 19:14:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 206 states have (on average 1.4029126213592233) internal successors, (289), 206 states have internal predecessors, (289), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 19:14:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 353 transitions. [2023-12-24 19:14:09,605 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 353 transitions. Word has length 135 [2023-12-24 19:14:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 19:14:09,606 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 353 transitions. [2023-12-24 19:14:09,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.352941176470588) internal successors, (125), 16 states have internal predecessors, (125), 12 states have call successors, (32), 12 states have call predecessors, (32), 12 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2023-12-24 19:14:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 353 transitions. [2023-12-24 19:14:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-12-24 19:14:09,607 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 19:14:09,607 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 19:14:09,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-24 19:14:09,832 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 19:14:10,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 19:14:10,009 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 19:14:10,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 19:14:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash -469129730, now seen corresponding path program 1 times [2023-12-24 19:14:10,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 19:14:10,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645645826] [2023-12-24 19:14:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:14:10,010 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 19:14:10,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 19:14:10,012 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 19:14:10,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 19:14:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:14:11,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 55 conjunts are in the unsatisfiable core [2023-12-24 19:14:11,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:14:12,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 21 [2023-12-24 19:14:16,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 73 [2023-12-24 19:14:18,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 81 [2023-12-24 19:14:21,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 84 [2023-12-24 19:14:23,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 84 [2023-12-24 19:14:25,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 92 [2023-12-24 19:14:28,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 95 [2023-12-24 19:14:31,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 103 [2023-12-24 19:14:34,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 106 [2023-12-24 19:14:37,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 106 [2023-12-24 19:14:40,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 106 [2023-12-24 19:14:49,505 WARN L293 SmtUtils]: Spent 7.19s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:14:57,974 WARN L293 SmtUtils]: Spent 8.30s 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 19:15:06,286 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:15:14,594 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:15:22,913 WARN L293 SmtUtils]: Spent 8.32s 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 19:15:28,596 WARN L293 SmtUtils]: Spent 5.68s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:15:36,323 WARN L293 SmtUtils]: Spent 7.73s 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 19:15:43,697 WARN L293 SmtUtils]: Spent 7.37s 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 19:15:53,010 WARN L293 SmtUtils]: Spent 8.32s 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 19:16:01,327 WARN L293 SmtUtils]: Spent 8.32s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:16:05,522 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_2_Pointer~0.base))) (let ((.cse1 (let ((.cse5 (concat (select .cse0 (_ bv5 32)) (select .cse0 (_ bv1 32))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_24| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_24|) (select .cse0 (_ bv31 32)))) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (/ 1.0 100000000000000000000.0)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (= c_~WrapperStruct00_var_1_8_Pointer~0.base c_~WrapperStruct00_var_1_2_Pointer~0.base) (= (_ bv1 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (= c_~WrapperStruct00_var_1_14_Pointer~0.base c_~WrapperStruct00_var_1_2_Pointer~0.base) (not (fp.lt (fp.sub c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base) (_ bv18 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_25| (_ BitVec 8))) (= (select .cse0 (_ bv17 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_25|))) (= (_ bv18 32) c_~WrapperStruct00_var_1_8_Pointer~0.offset) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) (let ((.cse4 (select .cse0 (_ bv18 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))) (= (_ bv33 32) c_~WrapperStruct00_var_1_14_Pointer~0.offset) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_25| (_ BitVec 8))) (= (select .cse0 (_ bv34 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_25|))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-24 19:16:13,979 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:16:22,276 WARN L293 SmtUtils]: Spent 8.30s 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 19:16:30,584 WARN L293 SmtUtils]: Spent 8.31s 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 19:16:38,881 WARN L293 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:16:46,274 WARN L293 SmtUtils]: Spent 7.39s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:16:54,560 WARN L293 SmtUtils]: Spent 8.29s 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 19:17:02,776 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:17:09,448 WARN L293 SmtUtils]: Spent 6.67s 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 19:17:17,726 WARN L293 SmtUtils]: Spent 8.28s 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 19:17:26,879 WARN L293 SmtUtils]: Spent 8.32s 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 19:17:35,191 WARN L293 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:18:35,728 WARN L293 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 59 DAG size of output: 13 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 19:18:35,729 INFO L349 Elim1Store]: treesize reduction 91, result has 14.2 percent of original size [2023-12-24 19:18:35,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 21 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 246 treesize of output 175 [2023-12-24 19:18:44,123 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 17 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:18:51,397 WARN L293 SmtUtils]: Spent 6.97s 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 19:18:56,055 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_2_Pointer~0.base))) (let ((.cse1 (let ((.cse5 (concat (select .cse0 (_ bv5 32)) (select .cse0 (_ bv1 32))))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5)))) (.cse3 (let ((.cse4 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base) (_ bv18 32)))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet85#1_24| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet85#1_24|) (select .cse0 (_ bv31 32)))) (exists ((v_arrayElimCell_164 (_ BitVec 32))) (= (select .cse0 (_ bv33 32)) ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_164)))) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0))) (= c_~WrapperStruct00_var_1_8_Pointer~0.base c_~WrapperStruct00_var_1_2_Pointer~0.base) (= (_ bv1 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset) (not (fp.lt (fp.sub c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse3))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet66#1_25| (_ BitVec 8))) (= (select .cse0 (_ bv17 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet66#1_25|))) (= (_ bv18 32) c_~WrapperStruct00_var_1_8_Pointer~0.offset) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse3) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet91#1_25| (_ BitVec 8))) (= (select .cse0 (_ bv34 32)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet91#1_25|))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2023-12-24 19:18:56,385 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 19:18:56,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 276 treesize of output 128 [2023-12-24 19:19:05,077 WARN L293 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:19:13,327 WARN L293 SmtUtils]: Spent 8.25s 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 19:19:21,460 WARN L854 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_168 (_ BitVec 32)) (v_arrayElimCell_171 (_ BitVec 32)) (v_arrayElimCell_174 (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) v_arrayElimCell_174) ((_ extract 30 23) v_arrayElimCell_174) ((_ extract 22 0) v_arrayElimCell_174))) (.cse0 (let ((.cse3 (concat v_arrayElimCell_171 v_arrayElimCell_168))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))))) (and (= .cse0 |c_ULTIMATE.start_property_#t~mem101#1|) (not (fp.lt (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode .cse2))) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) (= |c_ULTIMATE.start_property_#t~mem103#1| .cse2) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 65.0 2.0))) .cse2) (= |c_ULTIMATE.start_property_#t~mem102#1| .cse2) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode 9223372036854776000.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2023-12-24 19:19:21,471 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 151 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-24 19:19:21,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 19:19:29,696 WARN L293 SmtUtils]: Spent 8.22s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:19:33,807 WARN L854 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from false [2023-12-24 19:19:37,921 WARN L876 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem101#1| ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem103#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_property_#t~mem102#1|) ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))))) is different from true [2023-12-24 19:19:46,087 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:19:50,175 WARN L854 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) is different from false [2023-12-24 19:19:54,252 WARN L876 $PredicateComparison]: unable to prove that (not (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse3 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))) is different from true [2023-12-24 19:20:02,438 WARN L293 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:20:06,518 WARN L854 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_16_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_16_Pointer~0.offset (_ BitVec 32))) (not (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset))))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select .cse2 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (select (select .cse2 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))) (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))))) is different from false [2023-12-24 19:20:10,605 WARN L876 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_16_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_16_Pointer~0.offset (_ BitVec 32))) (not (let ((.cse2 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset))))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select .cse2 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse1 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse4 (select (select .cse2 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))) (fp.mul c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))))))))) is different from true [2023-12-24 19:20:18,780 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:20:26,996 WARN L293 SmtUtils]: Spent 8.21s 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 19:20:35,534 WARN L293 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:20:39,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (forall ((~WrapperStruct00_var_1_16_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_16_Pointer~0.offset (_ BitVec 32))) (not (let ((.cse4 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset))))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (let ((.cse3 (select .cse4 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse3 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (select .cse3 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse6 (select (select .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))))) (fp.mul c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse5 .cse1))))))))) is different from false [2023-12-24 19:20:43,829 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem18#1| .cse0) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem20#1|) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_step_#t~mem19#1|) .cse1))) (forall ((~WrapperStruct00_var_1_16_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_16_Pointer~0.offset (_ BitVec 32))) (not (let ((.cse4 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset))))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse2 (let ((.cse3 (select .cse4 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse3 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (select .cse3 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) .cse0) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse6 (select (select .cse4 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))))) (fp.mul c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse5 .cse1))))))))) is different from true [2023-12-24 19:20:52,003 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:21:00,448 WARN L293 SmtUtils]: Spent 8.44s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:21:04,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse3) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse6 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse5)))) (forall ((~WrapperStruct00_var_1_16_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_16_Pointer~0.offset (_ BitVec 32))) (not (let ((.cse9 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset))))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse7 (let ((.cse8 (select .cse9 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse8 .cse2) (select .cse8 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) .cse3) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse11 (select (select .cse9 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))))) (fp.mul c_currentRoundingMode .cse10 (fp.mul c_currentRoundingMode .cse10 .cse5))))))))) is different from false [2023-12-24 19:21:09,051 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0)))) (or (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse3) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse6 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))))) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse4 .cse5)))) (forall ((~WrapperStruct00_var_1_16_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_16_Pointer~0.offset (_ BitVec 32))) (not (let ((.cse9 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset))))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse7 (let ((.cse8 (select .cse9 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse8 .cse2) (select .cse8 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse7) ((_ extract 62 52) .cse7) ((_ extract 51 0) .cse7))) .cse3) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse11 (select (select .cse9 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)))))) (fp.mul c_currentRoundingMode .cse10 (fp.mul c_currentRoundingMode .cse10 .cse5))))))))) is different from true [2023-12-24 19:21:17,567 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:21:26,073 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:21:30,167 WARN L854 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_16_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_16_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_314 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))) (.cse8 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_314)))) (or (not (let ((.cse3 (store .cse8 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse8 ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset))))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select .cse3 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse4) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse7 (select (select .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))) (fp.mul c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse5 .cse6)))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse9 (let ((.cse10 (select .cse8 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse10 .cse2) (select .cse10 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) .cse4) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse12 (select (select .cse8 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))))) (fp.mul c_currentRoundingMode .cse11 (fp.mul c_currentRoundingMode .cse11 .cse6))))))) is different from false [2023-12-24 19:21:34,337 WARN L876 $PredicateComparison]: unable to prove that (forall ((~WrapperStruct00_var_1_16_Pointer~0.base (_ BitVec 32)) (~WrapperStruct00_var_1_16_Pointer~0.offset (_ BitVec 32)) (v_ArrVal_314 (_ BitVec 32))) (let ((.cse2 (bvadd (_ bv4 32) c_~WrapperStruct00_var_1_2_Pointer~0.offset)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 21.0 4.0))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode (/ 997.0 5.0))) (.cse8 (store |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base (store (select |c_#memory_int#1| c_~WrapperStruct00_var_1_11_Pointer~0.base) c_~WrapperStruct00_var_1_11_Pointer~0.offset v_ArrVal_314)))) (or (not (let ((.cse3 (store .cse8 c_~WrapperStruct00_var_1_14_Pointer~0.base (store (select .cse8 c_~WrapperStruct00_var_1_14_Pointer~0.base) c_~WrapperStruct00_var_1_14_Pointer~0.offset ((_ sign_extend 24) ((_ extract 7 0) (select (select .cse8 ~WrapperStruct00_var_1_16_Pointer~0.base) ~WrapperStruct00_var_1_16_Pointer~0.offset))))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse0 (let ((.cse1 (select .cse3 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse1 .cse2) (select .cse1 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) .cse4) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse7 (select (select .cse3 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)))))) (fp.mul c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse5 .cse6)))))) (fp.lt (fp.sub c_currentRoundingMode (let ((.cse9 (let ((.cse10 (select .cse8 c_~WrapperStruct00_var_1_2_Pointer~0.base))) (concat (select .cse10 .cse2) (select .cse10 c_~WrapperStruct00_var_1_2_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))) .cse4) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse12 (select (select .cse8 c_~WrapperStruct00_var_1_8_Pointer~0.base) c_~WrapperStruct00_var_1_8_Pointer~0.offset))) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12)))))) (fp.mul c_currentRoundingMode .cse11 (fp.mul c_currentRoundingMode .cse11 .cse6))))))) is different from true [2023-12-24 19:21:42,812 WARN L293 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:21:51,313 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:21:59,806 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:22:08,288 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:22:16,801 WARN L293 SmtUtils]: Spent 8.51s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:22:25,303 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:22:33,801 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:22:42,296 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:22:50,774 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:22:59,270 WARN L293 SmtUtils]: Spent 8.50s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:23:07,755 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:23:16,206 WARN L293 SmtUtils]: Spent 8.45s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 19:23:16,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 19:23:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645645826] [2023-12-24 19:23:16,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645645826] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 19:23:16,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1032652475] [2023-12-24 19:23:16,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 19:23:16,207 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 19:23:16,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 19:23:16,209 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 19:23:16,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-12-24 19:23:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 19:23:19,886 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-24 19:23:19,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 19:23:21,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 21 [2023-12-24 19:23:35,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 81 [2023-12-24 19:23:45,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 92 Received shutdown request... [2023-12-24 19:23:51,022 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 19:23:51,059 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 (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 19:23:51,059 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 19:23:51,355 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 19:23:51,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-12-24 19:23:51,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 19:23:51,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 19:23:51,757 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 138 with TraceHistMax 16,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-16-1 term,while PolyPacSimplificationTermWalker was simplifying 16 xjuncts wrt. a ATOM-1 context. [2023-12-24 19:23:51,760 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 19:23:51,768 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 19:23:51,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 07:23:51 BoogieIcfgContainer [2023-12-24 19:23:51,774 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 19:23:51,775 INFO L158 Benchmark]: Toolchain (without parser) took 880909.38ms. Allocated memory was 187.7MB in the beginning and 237.0MB in the end (delta: 49.3MB). Free memory was 148.5MB in the beginning and 199.1MB in the end (delta: -50.7MB). Peak memory consumption was 140.1MB. Max. memory is 8.0GB. [2023-12-24 19:23:51,775 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 187.7MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 19:23:51,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.75ms. Allocated memory is still 187.7MB. Free memory was 148.5MB in the beginning and 130.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 19:23:51,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.33ms. Allocated memory is still 187.7MB. Free memory was 130.6MB in the beginning and 127.1MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 19:23:51,776 INFO L158 Benchmark]: Boogie Preprocessor took 71.18ms. Allocated memory is still 187.7MB. Free memory was 126.9MB in the beginning and 121.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 19:23:51,776 INFO L158 Benchmark]: RCFGBuilder took 18205.03ms. Allocated memory was 187.7MB in the beginning and 237.0MB in the end (delta: 49.3MB). Free memory was 121.6MB in the beginning and 193.1MB in the end (delta: -71.5MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. [2023-12-24 19:23:51,776 INFO L158 Benchmark]: TraceAbstraction took 862312.08ms. Allocated memory is still 237.0MB. Free memory was 192.6MB in the beginning and 199.1MB in the end (delta: -6.5MB). Peak memory consumption was 134.5MB. Max. memory is 8.0GB. [2023-12-24 19:23:51,777 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 187.7MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 268.75ms. Allocated memory is still 187.7MB. Free memory was 148.5MB in the beginning and 130.6MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.33ms. Allocated memory is still 187.7MB. Free memory was 130.6MB in the beginning and 127.1MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.18ms. Allocated memory is still 187.7MB. Free memory was 126.9MB in the beginning and 121.6MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 18205.03ms. Allocated memory was 187.7MB in the beginning and 237.0MB in the end (delta: 49.3MB). Free memory was 121.6MB in the beginning and 193.1MB in the end (delta: -71.5MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. * TraceAbstraction took 862312.08ms. Allocated memory is still 237.0MB. Free memory was 192.6MB in the beginning and 199.1MB in the end (delta: -6.5MB). Peak memory consumption was 134.5MB. 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 NwaCegarLoop was analyzing trace of length 138 with TraceHistMax 16,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-16-1 term,while PolyPacSimplificationTermWalker was simplifying 16 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 132 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 862.3s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 151.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 33 mSolverCounterUnknown, 1101 SdHoareTripleChecker+Valid, 149.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1101 mSDsluCounter, 5731 SdHoareTripleChecker+Invalid, 148.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4033 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1429 IncrementalHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 1698 mSDtfsCounter, 1429 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1395 GetRequests, 1340 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 90.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=241occurred in iteration=9, InterpolantAutomatonStates: 47, 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, 9 MinimizatonAttempts, 279 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 10.8s SatisfiabilityAnalysisTime, 114.9s InterpolantComputationTime, 1315 NumberOfCodeBlocks, 1315 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1305 ConstructedInterpolants, 228 QuantifiedInterpolants, 19194 SizeOfPredicates, 34 NumberOfNonLiveVariables, 2945 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 4576/4800 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