/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-cn_file-29.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 11:50:36,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 11:50:36,759 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:50:36,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 11:50:36,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 11:50:36,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 11:50:36,780 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 11:50:36,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 11:50:36,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 11:50:36,780 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 11:50:36,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 11:50:36,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 11:50:36,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 11:50:36,782 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 11:50:36,782 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 11:50:36,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 11:50:36,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 11:50:36,782 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 11:50:36,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 11:50:36,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 11:50:36,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 11:50:36,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 11:50:36,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 11:50:36,786 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 11:50:36,789 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 11:50:36,789 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 11:50:36,789 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 11:50:36,790 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 11:50:36,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 11:50:36,790 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 11:50:36,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 11:50:36,791 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 11:50:36,791 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 11:50:36,791 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 11:50:36,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 11:50:36,792 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 11:50:36,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 11:50:36,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 11:50:36,793 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 11:50:36,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 11:50:36,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 11:50:36,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 11:50:36,793 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 11:50:36,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 11:50:36,793 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 11:50:36,794 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 11:50:36,794 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:50:36,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 11:50:36,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 11:50:36,991 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 11:50:36,992 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 11:50:36,992 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 11:50:36,993 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-cn_file-29.i [2023-12-16 11:50:38,014 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 11:50:38,227 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 11:50:38,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-cn_file-29.i [2023-12-16 11:50:38,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35093be3a/0eea6adc0ada42bda5597c758273c6f1/FLAG71fee74ce [2023-12-16 11:50:38,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35093be3a/0eea6adc0ada42bda5597c758273c6f1 [2023-12-16 11:50:38,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 11:50:38,256 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 11:50:38,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 11:50:38,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 11:50:38,262 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 11:50:38,263 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b4489a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38, skipping insertion in model container [2023-12-16 11:50:38,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,292 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 11:50:38,396 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-cn_file-29.i[919,932] [2023-12-16 11:50:38,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 11:50:38,464 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 11:50:38,474 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-cn_file-29.i[919,932] [2023-12-16 11:50:38,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 11:50:38,523 INFO L206 MainTranslator]: Completed translation [2023-12-16 11:50:38,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38 WrapperNode [2023-12-16 11:50:38,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 11:50:38,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 11:50:38,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 11:50:38,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 11:50:38,530 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:50:38" (1/1) ... [2023-12-16 11:50:38,539 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:50:38" (1/1) ... [2023-12-16 11:50:38,562 INFO L138 Inliner]: procedures = 27, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 257 [2023-12-16 11:50:38,562 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 11:50:38,563 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 11:50:38,563 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 11:50:38,563 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 11:50:38,574 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,579 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,589 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:50:38,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 11:50:38,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 11:50:38,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 11:50:38,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 11:50:38,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (1/1) ... [2023-12-16 11:50:38,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 11:50:38,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 11:50:38,665 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:50:38,698 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:50:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 11:50:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 11:50:38,704 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 11:50:38,705 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 11:50:38,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 11:50:38,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 11:50:38,772 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 11:50:38,774 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 11:50:40,903 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 11:50:40,944 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 11:50:40,944 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 11:50:40,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:50:40 BoogieIcfgContainer [2023-12-16 11:50:40,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 11:50:40,946 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 11:50:40,946 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 11:50:40,948 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 11:50:40,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 11:50:38" (1/3) ... [2023-12-16 11:50:40,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8721c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:50:40, skipping insertion in model container [2023-12-16 11:50:40,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 11:50:38" (2/3) ... [2023-12-16 11:50:40,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d8721c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 11:50:40, skipping insertion in model container [2023-12-16 11:50:40,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 11:50:40" (3/3) ... [2023-12-16 11:50:40,950 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-cn_file-29.i [2023-12-16 11:50:40,962 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 11:50:40,963 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 11:50:40,997 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 11:50:41,001 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;@6faf1699, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 11:50:41,002 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 11:50:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 11:50:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2023-12-16 11:50:41,023 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 11:50:41,024 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:41,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 11:50:41,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 11:50:41,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1977268234, now seen corresponding path program 1 times [2023-12-16 11:50:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 11:50:41,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945837815] [2023-12-16 11:50:41,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:50:41,039 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:50:41,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 11:50:41,042 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:50:41,070 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:50:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:50:41,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 11:50:41,571 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:50:41,632 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2582 proven. 0 refuted. 0 times theorem prover too weak. 2722 trivial. 0 not checked. [2023-12-16 11:50:41,632 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 11:50:41,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 11:50:41,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945837815] [2023-12-16 11:50:41,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945837815] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 11:50:41,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 11:50:41,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 11:50:41,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204510055] [2023-12-16 11:50:41,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 11:50:41,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 11:50:41,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 11:50:41,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 11:50:41,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 11:50:41,669 INFO L87 Difference]: Start difference. First operand has 115 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2023-12-16 11:50:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 11:50:42,559 INFO L93 Difference]: Finished difference Result 227 states and 430 transitions. [2023-12-16 11:50:42,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 11:50:42,585 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 305 [2023-12-16 11:50:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 11:50:42,594 INFO L225 Difference]: With dead ends: 227 [2023-12-16 11:50:42,594 INFO L226 Difference]: Without dead ends: 113 [2023-12-16 11:50:42,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 304 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:50:42,601 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 11:50:42,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 11:50:42,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-16 11:50:42,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-12-16 11:50:42,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 59 states have internal predecessors, (80), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 11:50:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 184 transitions. [2023-12-16 11:50:42,666 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 184 transitions. Word has length 305 [2023-12-16 11:50:42,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 11:50:42,667 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 184 transitions. [2023-12-16 11:50:42,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2023-12-16 11:50:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 184 transitions. [2023-12-16 11:50:42,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2023-12-16 11:50:42,679 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 11:50:42,679 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:42,695 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:50:42,891 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:50:42,892 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 11:50:42,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 11:50:42,892 INFO L85 PathProgramCache]: Analyzing trace with hash -251393474, now seen corresponding path program 1 times [2023-12-16 11:50:42,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 11:50:42,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275113022] [2023-12-16 11:50:42,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:50:42,894 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:50:42,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 11:50:42,895 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:50:42,900 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:50:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:50:43,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 11:50:43,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:50:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2673 proven. 84 refuted. 0 times theorem prover too weak. 2547 trivial. 0 not checked. [2023-12-16 11:50:43,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 11:50:43,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 11:50:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275113022] [2023-12-16 11:50:43,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275113022] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 11:50:43,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2071892183] [2023-12-16 11:50:43,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:50:43,820 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 11:50:43,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 11:50:43,945 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:50:43,946 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:50:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:50:44,403 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 11:50:44,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:50:45,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2023-12-16 11:50:45,087 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 11:50:45,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2071892183] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 11:50:45,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 11:50:45,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2023-12-16 11:50:45,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646652999] [2023-12-16 11:50:45,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 11:50:45,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 11:50:45,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 11:50:45,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 11:50:45,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 11:50:45,090 INFO L87 Difference]: Start difference. First operand 113 states and 184 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 11:50:46,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 11:50:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 11:50:46,943 INFO L93 Difference]: Finished difference Result 337 states and 550 transitions. [2023-12-16 11:50:46,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 11:50:46,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 305 [2023-12-16 11:50:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 11:50:46,953 INFO L225 Difference]: With dead ends: 337 [2023-12-16 11:50:46,953 INFO L226 Difference]: Without dead ends: 225 [2023-12-16 11:50:46,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 621 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 11:50:46,955 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 42 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-16 11:50:46,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 358 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-16 11:50:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-12-16 11:50:47,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2023-12-16 11:50:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 116 states have (on average 1.353448275862069) internal successors, (157), 116 states have internal predecessors, (157), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2023-12-16 11:50:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 365 transitions. [2023-12-16 11:50:47,005 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 365 transitions. Word has length 305 [2023-12-16 11:50:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 11:50:47,006 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 365 transitions. [2023-12-16 11:50:47,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 11:50:47,006 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 365 transitions. [2023-12-16 11:50:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2023-12-16 11:50:47,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 11:50:47,009 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:47,015 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 11:50:47,225 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 11:50:47,413 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 11:50:47,414 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 11:50:47,415 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 11:50:47,415 INFO L85 PathProgramCache]: Analyzing trace with hash 6771964, now seen corresponding path program 1 times [2023-12-16 11:50:47,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 11:50:47,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691658908] [2023-12-16 11:50:47,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:50:47,416 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:50:47,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 11:50:47,418 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 11:50:47,419 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 11:50:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:50:47,785 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 11:50:47,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:50:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2673 proven. 84 refuted. 0 times theorem prover too weak. 2547 trivial. 0 not checked. [2023-12-16 11:50:48,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 11:50:48,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 11:50:48,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691658908] [2023-12-16 11:50:48,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691658908] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 11:50:48,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [410327845] [2023-12-16 11:50:48,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:50:48,205 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 11:50:48,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 11:50:48,208 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 11:50:48,228 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 11:50:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:50:48,642 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 11:50:48,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:50:48,673 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2023-12-16 11:50:48,674 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 11:50:48,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [410327845] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 11:50:48,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 11:50:48,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-16 11:50:48,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072313755] [2023-12-16 11:50:48,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 11:50:48,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 11:50:48,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 11:50:48,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 11:50:48,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 11:50:48,676 INFO L87 Difference]: Start difference. First operand 223 states and 365 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 11:50:49,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 11:50:51,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 11:50:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 11:50:51,289 INFO L93 Difference]: Finished difference Result 569 states and 922 transitions. [2023-12-16 11:50:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 11:50:51,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 305 [2023-12-16 11:50:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 11:50:51,292 INFO L225 Difference]: With dead ends: 569 [2023-12-16 11:50:51,293 INFO L226 Difference]: Without dead ends: 347 [2023-12-16 11:50:51,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 621 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 11:50:51,295 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 95 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 11:50:51,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 428 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 11:50:51,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-12-16 11:50:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2023-12-16 11:50:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 172 states have (on average 1.2732558139534884) internal successors, (219), 174 states have internal predecessors, (219), 166 states have call successors, (166), 4 states have call predecessors, (166), 4 states have return successors, (166), 164 states have call predecessors, (166), 166 states have call successors, (166) [2023-12-16 11:50:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 551 transitions. [2023-12-16 11:50:51,336 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 551 transitions. Word has length 305 [2023-12-16 11:50:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 11:50:51,337 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 551 transitions. [2023-12-16 11:50:51,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 11:50:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 551 transitions. [2023-12-16 11:50:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2023-12-16 11:50:51,342 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 11:50:51,343 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:51,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 11:50:51,557 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 11:50:51,756 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 11:50:51,756 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 11:50:51,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 11:50:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash -406965444, now seen corresponding path program 1 times [2023-12-16 11:50:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 11:50:51,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107794565] [2023-12-16 11:50:51,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:50:51,758 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:50:51,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 11:50:51,759 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 11:50:51,760 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 11:50:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:50:52,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 11:50:52,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:50:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2673 proven. 84 refuted. 0 times theorem prover too weak. 2547 trivial. 0 not checked. [2023-12-16 11:50:52,498 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 11:50:52,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 11:50:52,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107794565] [2023-12-16 11:50:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107794565] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 11:50:52,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [112582011] [2023-12-16 11:50:52,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:50:52,542 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 11:50:52,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 11:50:52,543 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 11:50:52,558 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 11:50:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:50:53,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 11:50:53,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:50:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2023-12-16 11:50:53,636 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 11:50:53,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [112582011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 11:50:53,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 11:50:53,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-12-16 11:50:53,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470489292] [2023-12-16 11:50:53,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 11:50:53,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 11:50:53,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 11:50:53,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 11:50:53,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-16 11:50:53,638 INFO L87 Difference]: Start difference. First operand 343 states and 551 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 11:50:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 11:50:56,418 INFO L93 Difference]: Finished difference Result 1025 states and 1647 transitions. [2023-12-16 11:50:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 11:50:56,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 305 [2023-12-16 11:50:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 11:50:56,423 INFO L225 Difference]: With dead ends: 1025 [2023-12-16 11:50:56,424 INFO L226 Difference]: Without dead ends: 683 [2023-12-16 11:50:56,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 621 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 11:50:56,426 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 176 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-16 11:50:56,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 494 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-16 11:50:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2023-12-16 11:50:56,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2023-12-16 11:50:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 340 states have (on average 1.2588235294117647) internal successors, (428), 344 states have internal predecessors, (428), 332 states have call successors, (332), 8 states have call predecessors, (332), 8 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2023-12-16 11:50:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1092 transitions. [2023-12-16 11:50:56,490 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1092 transitions. Word has length 305 [2023-12-16 11:50:56,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 11:50:56,491 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 1092 transitions. [2023-12-16 11:50:56,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2023-12-16 11:50:56,491 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1092 transitions. [2023-12-16 11:50:56,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2023-12-16 11:50:56,494 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 11:50:56,494 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:56,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 11:50:56,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2023-12-16 11:50:56,906 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 11:50:56,907 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 11:50:56,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 11:50:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash -993771458, now seen corresponding path program 1 times [2023-12-16 11:50:56,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 11:50:56,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014764842] [2023-12-16 11:50:56,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:50:56,908 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:50:56,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 11:50:56,910 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 11:50:56,910 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 11:50:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:50:57,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 11:50:57,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:50:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2673 proven. 84 refuted. 0 times theorem prover too weak. 2547 trivial. 0 not checked. [2023-12-16 11:50:57,705 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 11:50:57,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 11:50:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014764842] [2023-12-16 11:50:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014764842] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 11:50:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1018812725] [2023-12-16 11:50:57,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:50:57,745 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 11:50:57,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 11:50:57,746 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 11:50:57,768 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 11:50:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:50:58,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 11:50:58,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:51:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2703 proven. 75 refuted. 0 times theorem prover too weak. 2526 trivial. 0 not checked. [2023-12-16 11:51:02,590 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 11:51:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 78 proven. 75 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2023-12-16 11:51:03,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1018812725] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 11:51:03,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 11:51:03,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2023-12-16 11:51:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406336326] [2023-12-16 11:51:03,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 11:51:03,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 11:51:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 11:51:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 11:51:03,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-12-16 11:51:03,062 INFO L87 Difference]: Start difference. First operand 681 states and 1092 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 4 states have call successors, (105), 3 states have call predecessors, (105), 5 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) [2023-12-16 11:51:12,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-16 11:51:17,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 11:51:17,944 INFO L93 Difference]: Finished difference Result 1829 states and 2838 transitions. [2023-12-16 11:51:17,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-16 11:51:17,949 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 4 states have call successors, (105), 3 states have call predecessors, (105), 5 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) Word has length 305 [2023-12-16 11:51:17,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 11:51:17,955 INFO L225 Difference]: With dead ends: 1829 [2023-12-16 11:51:17,956 INFO L226 Difference]: Without dead ends: 1149 [2023-12-16 11:51:17,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 961 GetRequests, 923 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=417, Invalid=1143, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 11:51:17,959 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 528 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 741 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 741 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-12-16 11:51:17,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 645 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [741 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2023-12-16 11:51:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-12-16 11:51:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 749. [2023-12-16 11:51:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 392 states have (on average 1.219387755102041) internal successors, (478), 396 states have internal predecessors, (478), 332 states have call successors, (332), 24 states have call predecessors, (332), 24 states have return successors, (332), 328 states have call predecessors, (332), 332 states have call successors, (332) [2023-12-16 11:51:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1142 transitions. [2023-12-16 11:51:18,053 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1142 transitions. Word has length 305 [2023-12-16 11:51:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 11:51:18,054 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 1142 transitions. [2023-12-16 11:51:18,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 4 states have call successors, (105), 3 states have call predecessors, (105), 5 states have return successors, (107), 4 states have call predecessors, (107), 4 states have call successors, (107) [2023-12-16 11:51:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1142 transitions. [2023-12-16 11:51:18,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2023-12-16 11:51:18,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 11:51:18,057 INFO L195 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:18,074 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 11:51:18,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-16 11:51:18,469 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 11:51:18,469 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 11:51:18,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 11:51:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1733753103, now seen corresponding path program 1 times [2023-12-16 11:51:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 11:51:18,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630517930] [2023-12-16 11:51:18,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 11:51:18,470 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:51:18,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 11:51:18,471 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 11:51:18,474 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 11:51:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 11:51:18,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 11:51:18,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 11:51:46,136 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 Received shutdown request... [2023-12-16 11:51:49,866 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 11:51:49,874 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 11:51:50,888 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 11:51:51,067 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 11:51:51,082 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 11:51:51,083 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 307 with TraceHistMax 52,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-16 11:51:51,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-16 11:51:51,086 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 11:51:51,087 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 11:51:51,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 11:51:51 BoogieIcfgContainer [2023-12-16 11:51:51,088 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 11:51:51,089 INFO L158 Benchmark]: Toolchain (without parser) took 72833.14ms. Allocated memory was 206.6MB in the beginning and 278.9MB in the end (delta: 72.4MB). Free memory was 171.8MB in the beginning and 120.0MB in the end (delta: 51.7MB). Peak memory consumption was 125.4MB. Max. memory is 8.0GB. [2023-12-16 11:51:51,089 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 206.6MB. Free memory was 164.4MB in the beginning and 164.4MB in the end (delta: 66.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 11:51:51,089 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.38ms. Allocated memory is still 206.6MB. Free memory was 171.5MB in the beginning and 154.3MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-16 11:51:51,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.52ms. Allocated memory is still 206.6MB. Free memory was 154.3MB in the beginning and 151.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 11:51:51,089 INFO L158 Benchmark]: Boogie Preprocessor took 45.43ms. Allocated memory is still 206.6MB. Free memory was 151.6MB in the beginning and 147.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 11:51:51,089 INFO L158 Benchmark]: RCFGBuilder took 2335.84ms. Allocated memory is still 206.6MB. Free memory was 147.6MB in the beginning and 117.0MB in the end (delta: 30.6MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-16 11:51:51,090 INFO L158 Benchmark]: TraceAbstraction took 70142.34ms. Allocated memory was 206.6MB in the beginning and 278.9MB in the end (delta: 72.4MB). Free memory was 116.2MB in the beginning and 120.0MB in the end (delta: -3.8MB). Peak memory consumption was 69.9MB. Max. memory is 8.0GB. [2023-12-16 11:51:51,090 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.40ms. Allocated memory is still 206.6MB. Free memory was 164.4MB in the beginning and 164.4MB in the end (delta: 66.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.38ms. Allocated memory is still 206.6MB. Free memory was 171.5MB in the beginning and 154.3MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.52ms. Allocated memory is still 206.6MB. Free memory was 154.3MB in the beginning and 151.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.43ms. Allocated memory is still 206.6MB. Free memory was 151.6MB in the beginning and 147.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 2335.84ms. Allocated memory is still 206.6MB. Free memory was 147.6MB in the beginning and 117.0MB in the end (delta: 30.6MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 70142.34ms. Allocated memory was 206.6MB in the beginning and 278.9MB in the end (delta: 72.4MB). Free memory was 116.2MB in the beginning and 120.0MB in the end (delta: -3.8MB). Peak memory consumption was 69.9MB. 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 307 with TraceHistMax 52,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 115 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.1s, OverallIterations: 6, TraceHistogramMax: 52, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 23.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 842 SdHoareTripleChecker+Valid, 20.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 841 mSDsluCounter, 2106 SdHoareTripleChecker+Invalid, 19.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 974 mSDsCounter, 745 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 541 IncrementalHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 745 mSolverCounterUnsat, 1132 mSDtfsCounter, 541 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3143 GetRequests, 3090 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=749occurred 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.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 408 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 2745 NumberOfCodeBlocks, 2745 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 3040 ConstructedInterpolants, 142 QuantifiedInterpolants, 9362 SizeOfPredicates, 21 NumberOfNonLiveVariables, 4298 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 52554/53040 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