/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_fillercode_fillercodestructure_filler-pe-co_file-29.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 11:59:51,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 11:59:51,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 11:59:51,720 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 11:59:51,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 11:59:51,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 11:59:51,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 11:59:51,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 11:59:51,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 11:59:51,749 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 11:59:51,750 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 11:59:51,750 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 11:59:51,751 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 11:59:51,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 11:59:51,752 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 11:59:51,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 11:59:51,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 11:59:51,752 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 11:59:51,753 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 11:59:51,753 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 11:59:51,753 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 11:59:51,753 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 11:59:51,753 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 11:59:51,753 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 11:59:51,754 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 11:59:51,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 11:59:51,754 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 11:59:51,754 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 11:59:51,754 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 11:59:51,754 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 11:59:51,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 11:59:51,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 11:59:51,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 11:59:51,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 11:59:51,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 11:59:51,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 11:59:51,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 11:59:51,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 11:59:51,756 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 11:59:51,756 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 11:59:51,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 11:59:51,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 11:59:51,756 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 11:59:51,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 11:59:51,757 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 11:59:51,757 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 11:59:51,757 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 11:59:51,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 11:59:51,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 11:59:51,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 11:59:51,939 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 11:59:51,939 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 11:59:51,940 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-29.i [2023-12-16 11:59:52,889 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 11:59:53,060 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 11:59:53,060 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-29.i [2023-12-16 11:59:53,066 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971d30230/25458f5d2d2746ff978bb4d8d9ba2fbe/FLAGb9a007c48 [2023-12-16 11:59:53,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/971d30230/25458f5d2d2746ff978bb4d8d9ba2fbe [2023-12-16 11:59:53,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 11:59:53,077 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 11:59:53,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 11:59:53,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 11:59:53,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 11:59:53,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7471cba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53, skipping insertion in model container [2023-12-16 11:59:53,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,112 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 11:59:53,212 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_fillercode_fillercodestructure_filler-pe-co_file-29.i[919,932] [2023-12-16 11:59:53,267 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 11:59:53,283 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 11:59:53,291 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_fillercode_fillercodestructure_filler-pe-co_file-29.i[919,932] [2023-12-16 11:59:53,325 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 11:59:53,337 INFO L206 MainTranslator]: Completed translation [2023-12-16 11:59:53,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53 WrapperNode [2023-12-16 11:59:53,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 11:59:53,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 11:59:53,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 11:59:53,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 11:59:53,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,350 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,371 INFO L138 Inliner]: procedures = 27, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 233 [2023-12-16 11:59:53,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 11:59:53,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 11:59:53,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 11:59:53,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 11:59:53,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,386 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,395 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 11:59:53,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 11:59:53,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 11:59:53,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 11:59:53,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 11:59:53,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (1/1) ... [2023-12-16 11:59:53,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 11:59:53,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 11:59:53,455 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 11:59:53,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 11:59:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 11:59:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 11:59:53,486 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 11:59:53,487 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 11:59:53,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 11:59:53,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 11:59:53,558 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 11:59:53,560 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 11:59:55,177 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 11:59:55,211 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 11:59:55,211 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 11:59:55,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:59:55 BoogieIcfgContainer [2023-12-16 11:59:55,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 11:59:55,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 11:59:55,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 11:59:55,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 11:59:55,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 11:59:53" (1/3) ... [2023-12-16 11:59:55,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ac0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:59:55, skipping insertion in model container [2023-12-16 11:59:55,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:59:53" (2/3) ... [2023-12-16 11:59:55,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ac0a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:59:55, skipping insertion in model container [2023-12-16 11:59:55,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:59:55" (3/3) ... [2023-12-16 11:59:55,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-29.i [2023-12-16 11:59:55,228 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 11:59:55,228 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 11:59:55,257 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 11:59:55,261 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;@5acc99d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 11:59:55,262 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 11:59:55,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-16 11:59:55,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-12-16 11:59:55,291 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 11:59:55,291 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 11:59:55,292 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 11:59:55,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 11:59:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1092080782, now seen corresponding path program 1 times [2023-12-16 11:59:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 11:59:55,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279028641] [2023-12-16 11:59:55,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:59:55,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 11:59:55,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 11:59:55,318 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 11:59:55,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 11:59:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:59:55,761 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 11:59:55,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:59:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1574 proven. 0 refuted. 0 times theorem prover too weak. 2210 trivial. 0 not checked. [2023-12-16 11:59:55,843 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 11:59:55,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 11:59:55,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279028641] [2023-12-16 11:59:55,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279028641] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 11:59:55,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 11:59:55,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 11:59:55,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143873158] [2023-12-16 11:59:55,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 11:59:55,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 11:59:55,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 11:59:55,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 11:59:55,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 11:59:55,877 INFO L87 Difference]: Start difference. First operand has 103 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2023-12-16 11:59:57,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 11:59:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 11:59:57,856 INFO L93 Difference]: Finished difference Result 203 states and 382 transitions. [2023-12-16 11:59:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 11:59:57,884 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 261 [2023-12-16 11:59:57,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 11:59:57,890 INFO L225 Difference]: With dead ends: 203 [2023-12-16 11:59:57,890 INFO L226 Difference]: Without dead ends: 101 [2023-12-16 11:59:57,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 11:59:57,894 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-16 11:59:57,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-16 11:59:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-16 11:59:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-16 11:59:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 55 states have internal predecessors, (76), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-16 11:59:57,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 164 transitions. [2023-12-16 11:59:57,931 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 164 transitions. Word has length 261 [2023-12-16 11:59:57,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 11:59:57,932 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 164 transitions. [2023-12-16 11:59:57,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2023-12-16 11:59:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 164 transitions. [2023-12-16 11:59:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2023-12-16 11:59:57,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 11:59:57,936 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 11:59:57,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 11:59:58,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 11:59:58,150 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 11:59:58,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 11:59:58,150 INFO L85 PathProgramCache]: Analyzing trace with hash -707543898, now seen corresponding path program 1 times [2023-12-16 11:59:58,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 11:59:58,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140981156] [2023-12-16 11:59:58,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:59:58,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 11:59:58,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 11:59:58,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 11:59:58,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 11:59:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:59:58,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 11:59:58,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:59:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2023-12-16 11:59:58,909 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 11:59:58,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 11:59:58,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140981156] [2023-12-16 11:59:58,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140981156] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 11:59:58,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1224839481] [2023-12-16 11:59:58,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:59:58,957 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 11:59:58,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 11:59:58,989 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 11:59:58,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2023-12-16 11:59:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:59:59,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 11:59:59,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:59:59,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2023-12-16 11:59:59,493 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 11:59:59,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1224839481] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 11:59:59,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 11:59:59,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-16 11:59:59,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550913913] [2023-12-16 11:59:59,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 11:59:59,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 11:59:59,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 11:59:59,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 11:59:59,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 11:59:59,501 INFO L87 Difference]: Start difference. First operand 101 states and 164 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2023-12-16 12:00:01,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:00:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:00:01,608 INFO L93 Difference]: Finished difference Result 295 states and 479 transitions. [2023-12-16 12:00:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 12:00:01,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 261 [2023-12-16 12:00:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:00:01,612 INFO L225 Difference]: With dead ends: 295 [2023-12-16 12:00:01,612 INFO L226 Difference]: Without dead ends: 195 [2023-12-16 12:00:01,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 533 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:00:01,614 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 145 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 12:00:01,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 429 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 12:00:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-16 12:00:01,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2023-12-16 12:00:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 102 states have internal predecessors, (134), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-16 12:00:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 310 transitions. [2023-12-16 12:00:01,637 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 310 transitions. Word has length 261 [2023-12-16 12:00:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:00:01,638 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 310 transitions. [2023-12-16 12:00:01,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2023-12-16 12:00:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 310 transitions. [2023-12-16 12:00:01,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-16 12:00:01,642 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:00:01,642 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 12:00:01,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2023-12-16 12:00:01,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 12:00:02,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:00:02,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:00:02,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:00:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash -652081093, now seen corresponding path program 1 times [2023-12-16 12:00:02,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:00:02,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829208506] [2023-12-16 12:00:02,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:00:02,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:00:02,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:00:02,052 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:00:02,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 12:00:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:00:02,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:00:02,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:00:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2023-12-16 12:00:02,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:00:02,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:00:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829208506] [2023-12-16 12:00:02,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829208506] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 12:00:02,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [929564927] [2023-12-16 12:00:02,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:00:02,761 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 12:00:02,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 12:00:02,773 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 12:00:02,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-16 12:00:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:00:03,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 12:00:03,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:00:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2023-12-16 12:00:03,637 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:00:03,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [929564927] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:00:03,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 12:00:03,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-12-16 12:00:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539883115] [2023-12-16 12:00:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:00:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 12:00:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:00:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 12:00:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:00:03,639 INFO L87 Difference]: Start difference. First operand 193 states and 310 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2023-12-16 12:00:05,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:00:06,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:00:06,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:00:06,774 INFO L93 Difference]: Finished difference Result 389 states and 624 transitions. [2023-12-16 12:00:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 12:00:06,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 262 [2023-12-16 12:00:06,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:00:06,781 INFO L225 Difference]: With dead ends: 389 [2023-12-16 12:00:06,781 INFO L226 Difference]: Without dead ends: 197 [2023-12-16 12:00:06,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:00:06,783 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 33 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-12-16 12:00:06,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 295 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-12-16 12:00:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-12-16 12:00:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2023-12-16 12:00:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-16 12:00:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 311 transitions. [2023-12-16 12:00:06,803 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 311 transitions. Word has length 262 [2023-12-16 12:00:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:00:06,803 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 311 transitions. [2023-12-16 12:00:06,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2023-12-16 12:00:06,804 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 311 transitions. [2023-12-16 12:00:06,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-16 12:00:06,806 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:00:06,806 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 12:00:06,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 12:00:07,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-16 12:00:07,215 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 12:00:07,215 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:00:07,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:00:07,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1355126356, now seen corresponding path program 1 times [2023-12-16 12:00:07,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:00:07,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325657317] [2023-12-16 12:00:07,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:00:07,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:00:07,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:00:07,218 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:00:07,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 12:00:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:00:07,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:00:07,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:00:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2023-12-16 12:00:07,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:00:07,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:00:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325657317] [2023-12-16 12:00:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325657317] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 12:00:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1107924452] [2023-12-16 12:00:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:00:07,918 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 12:00:07,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 12:00:07,995 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 12:00:08,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2023-12-16 12:00:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:00:08,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 12:00:08,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:00:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2023-12-16 12:00:09,030 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:00:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1107924452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:00:09,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 12:00:09,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-16 12:00:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031506667] [2023-12-16 12:00:09,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:00:09,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 12:00:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:00:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 12:00:09,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:00:09,032 INFO L87 Difference]: Start difference. First operand 195 states and 311 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2023-12-16 12:00:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:00:11,186 INFO L93 Difference]: Finished difference Result 577 states and 919 transitions. [2023-12-16 12:00:11,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 12:00:11,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 262 [2023-12-16 12:00:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:00:11,189 INFO L225 Difference]: With dead ends: 577 [2023-12-16 12:00:11,189 INFO L226 Difference]: Without dead ends: 383 [2023-12-16 12:00:11,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 541 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:00:11,191 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 151 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-16 12:00:11,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 430 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-16 12:00:11,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-12-16 12:00:11,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2023-12-16 12:00:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 200 states have (on average 1.245) internal successors, (249), 200 states have internal predecessors, (249), 176 states have call successors, (176), 4 states have call predecessors, (176), 4 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2023-12-16 12:00:11,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 601 transitions. [2023-12-16 12:00:11,226 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 601 transitions. Word has length 262 [2023-12-16 12:00:11,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:00:11,226 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 601 transitions. [2023-12-16 12:00:11,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2023-12-16 12:00:11,227 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 601 transitions. [2023-12-16 12:00:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2023-12-16 12:00:11,229 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:00:11,229 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 12:00:11,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-12-16 12:00:11,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2023-12-16 12:00:11,641 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 12:00:11,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:00:11,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:00:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash 344009106, now seen corresponding path program 1 times [2023-12-16 12:00:11,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:00:11,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876127466] [2023-12-16 12:00:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:00:11,643 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:00:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:00:11,646 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:00:11,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-16 12:00:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:00:11,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:00:11,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:00:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1929 proven. 60 refuted. 0 times theorem prover too weak. 1795 trivial. 0 not checked. [2023-12-16 12:00:12,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:00:12,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:00:12,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876127466] [2023-12-16 12:00:12,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876127466] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 12:00:12,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [607106155] [2023-12-16 12:00:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:00:12,263 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 12:00:12,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 12:00:12,264 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 12:00:12,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-16 12:00:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:00:13,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 12:00:13,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:00:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1863 proven. 51 refuted. 0 times theorem prover too weak. 1870 trivial. 0 not checked. [2023-12-16 12:00:15,997 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:00:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2023-12-16 12:00:16,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [607106155] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 12:00:16,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 12:00:16,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-12-16 12:00:16,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357468857] [2023-12-16 12:00:16,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 12:00:16,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 12:00:16,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:00:16,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 12:00:16,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-16 12:00:16,462 INFO L87 Difference]: Start difference. First operand 381 states and 601 transitions. Second operand has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 4 states have call successors, (81), 3 states have call predecessors, (81), 5 states have return successors, (83), 4 states have call predecessors, (83), 4 states have call successors, (83) [2023-12-16 12:00:27,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 12:00:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:00:33,299 INFO L93 Difference]: Finished difference Result 1021 states and 1568 transitions. [2023-12-16 12:00:33,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-16 12:00:33,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 4 states have call successors, (81), 3 states have call predecessors, (81), 5 states have return successors, (83), 4 states have call predecessors, (83), 4 states have call successors, (83) Word has length 262 [2023-12-16 12:00:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:00:33,303 INFO L225 Difference]: With dead ends: 1021 [2023-12-16 12:00:33,303 INFO L226 Difference]: Without dead ends: 641 [2023-12-16 12:00:33,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 12:00:33,309 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 408 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2023-12-16 12:00:33,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 632 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2023-12-16 12:00:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2023-12-16 12:00:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 417. [2023-12-16 12:00:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 228 states have (on average 1.206140350877193) internal successors, (275), 228 states have internal predecessors, (275), 176 states have call successors, (176), 12 states have call predecessors, (176), 12 states have return successors, (176), 176 states have call predecessors, (176), 176 states have call successors, (176) [2023-12-16 12:00:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 627 transitions. [2023-12-16 12:00:33,369 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 627 transitions. Word has length 262 [2023-12-16 12:00:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:00:33,370 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 627 transitions. [2023-12-16 12:00:33,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 11 states have internal predecessors, (85), 4 states have call successors, (81), 3 states have call predecessors, (81), 5 states have return successors, (83), 4 states have call predecessors, (83), 4 states have call successors, (83) [2023-12-16 12:00:33,370 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 627 transitions. [2023-12-16 12:00:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2023-12-16 12:00:33,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:00:33,373 INFO L195 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 12:00:33,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-16 12:00:33,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2023-12-16 12:00:33,799 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 12:00:33,800 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:00:33,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:00:33,800 INFO L85 PathProgramCache]: Analyzing trace with hash -571400219, now seen corresponding path program 1 times [2023-12-16 12:00:33,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:00:33,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [687169020] [2023-12-16 12:00:33,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:00:33,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:00:33,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:00:33,802 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:00:33,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-16 12:00:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:00:34,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 12:00:34,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:00:54,171 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (let ((.cse4 (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (fp.geq ~var_1_26~0 .cse2))))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (fp.leq ~var_1_25~0 .cse3) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) .cse4)) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))))))) is different from true [2023-12-16 12:01:02,285 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse3 (fp.neg .cse0)) (.cse2 (fp.neg .cse1))) (or (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (fp.geq ~var_1_24~0 .cse0) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse1))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24)) (~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_24~0 .cse0) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse1))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse2) (fp.gt ~var_1_25~0 ~var_1_26~0))) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24)) (~var_1_24~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (fp.geq ~var_1_26~0 .cse0) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (= (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_25~0) c_~var_1_23~0) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2))) (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_26~0 .cse0) (fp.gt ~var_1_25~0 ~var_1_26~0))))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse2) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse3) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.geq ~var_1_24~0 .cse0) (fp.leq ~var_1_24~0 .cse1))) (fp.leq ~var_1_25~0 .cse3))) (exists ((~var_1_25~0 (_ FloatingPoint 8 24))) (and (fp.geq ~var_1_25~0 .cse0) (fp.leq ~var_1_25~0 .cse1) (exists ((~var_1_24~0 (_ FloatingPoint 8 24))) (and (exists ((~var_1_26~0 (_ FloatingPoint 8 24))) (and (fp.leq ~var_1_26~0 .cse1) (not (fp.gt ~var_1_25~0 ~var_1_26~0)) (= c_~var_1_23~0 (fp.add roundNearestTiesToEven ~var_1_24~0 ~var_1_26~0)))) (fp.leq ~var_1_24~0 .cse3) (fp.geq ~var_1_24~0 .cse2)))))))) is different from true Received shutdown request... [2023-12-16 12:01:05,991 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 12:01:06,016 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 (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 12:01:06,377 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 12:01:06,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-16 12:01:06,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:01:06,580 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 264 with TraceHistMax 44,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-12-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-12-1 context. [2023-12-16 12:01:06,584 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 12:01:06,586 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 12:01:06,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:01:06 BoogieIcfgContainer [2023-12-16 12:01:06,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 12:01:06,588 INFO L158 Benchmark]: Toolchain (without parser) took 73510.94ms. Allocated memory was 194.0MB in the beginning and 261.1MB in the end (delta: 67.1MB). Free memory was 152.1MB in the beginning and 202.0MB in the end (delta: -49.9MB). Peak memory consumption was 141.7MB. Max. memory is 8.0GB. [2023-12-16 12:01:06,589 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 194.0MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 12:01:06,589 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.86ms. Allocated memory is still 194.0MB. Free memory was 151.6MB in the beginning and 135.2MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-16 12:01:06,589 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.05ms. Allocated memory is still 194.0MB. Free memory was 135.2MB in the beginning and 132.3MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 12:01:06,589 INFO L158 Benchmark]: Boogie Preprocessor took 41.22ms. Allocated memory is still 194.0MB. Free memory was 132.3MB in the beginning and 128.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 12:01:06,589 INFO L158 Benchmark]: RCFGBuilder took 1797.60ms. Allocated memory is still 194.0MB. Free memory was 128.1MB in the beginning and 98.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-16 12:01:06,590 INFO L158 Benchmark]: TraceAbstraction took 71375.07ms. Allocated memory was 194.0MB in the beginning and 261.1MB in the end (delta: 67.1MB). Free memory was 98.1MB in the beginning and 202.0MB in the end (delta: -103.9MB). Peak memory consumption was 87.1MB. Max. memory is 8.0GB. [2023-12-16 12:01:06,591 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.11ms. Allocated memory is still 194.0MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.86ms. Allocated memory is still 194.0MB. Free memory was 151.6MB in the beginning and 135.2MB in the end (delta: 16.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.05ms. Allocated memory is still 194.0MB. Free memory was 135.2MB in the beginning and 132.3MB in the end (delta: 3.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.22ms. Allocated memory is still 194.0MB. Free memory was 132.3MB in the beginning and 128.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1797.60ms. Allocated memory is still 194.0MB. Free memory was 128.1MB in the beginning and 98.7MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 71375.07ms. Allocated memory was 194.0MB in the beginning and 261.1MB in the end (delta: 67.1MB). Free memory was 98.1MB in the beginning and 202.0MB in the end (delta: -103.9MB). Peak memory consumption was 87.1MB. 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 264 with TraceHistMax 44,while TraceCheckSpWp was constructing forward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-12-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-12-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.3s, OverallIterations: 6, TraceHistogramMax: 44, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 738 SdHoareTripleChecker+Valid, 23.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 737 mSDsluCounter, 1947 SdHoareTripleChecker+Invalid, 22.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 911 mSDsCounter, 506 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 588 IncrementalHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 506 mSolverCounterUnsat, 1036 mSDtfsCounter, 588 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2713 GetRequests, 2660 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=5, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 230 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2355 NumberOfCodeBlocks, 2355 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2607 ConstructedInterpolants, 98 QuantifiedInterpolants, 7159 SizeOfPredicates, 21 NumberOfNonLiveVariables, 3726 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 37498/37840 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