./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:12:16,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:12:16,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 05:12:16,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:12:16,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:12:17,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:12:17,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:12:17,007 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:12:17,008 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:12:17,009 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:12:17,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:12:17,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:12:17,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:12:17,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:12:17,011 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:12:17,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:12:17,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:12:17,011 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:12:17,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 05:12:17,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:12:17,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:12:17,013 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:12:17,013 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:12:17,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:12:17,014 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:12:17,014 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:12:17,014 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:12:17,014 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:12:17,015 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:12:17,015 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:12:17,015 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:12:17,015 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:12:17,015 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:12:17,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:12:17,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:12:17,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:12:17,016 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 05:12:17,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 05:12:17,016 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:12:17,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:12:17,017 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:12:17,017 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:12:17,017 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab [2024-11-16 05:12:17,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:12:17,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:12:17,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:12:17,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:12:17,231 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:12:17,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2024-11-16 05:12:18,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:12:18,621 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:12:18,622 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2024-11-16 05:12:18,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b09d8c7/f5a2ca3ea24141e68242fefc7bbb5b61/FLAG706d7d3ab [2024-11-16 05:12:18,650 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2b09d8c7/f5a2ca3ea24141e68242fefc7bbb5b61 [2024-11-16 05:12:18,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:12:18,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:12:18,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:12:18,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:12:18,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:12:18,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28c858ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18, skipping insertion in model container [2024-11-16 05:12:18,668 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,695 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:12:18,866 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2024-11-16 05:12:18,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:12:18,878 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 05:12:18,900 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2024-11-16 05:12:18,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:12:18,918 INFO L204 MainTranslator]: Completed translation [2024-11-16 05:12:18,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18 WrapperNode [2024-11-16 05:12:18,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 05:12:18,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 05:12:18,920 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 05:12:18,920 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 05:12:18,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,946 INFO L138 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 49 [2024-11-16 05:12:18,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 05:12:18,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 05:12:18,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 05:12:18,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 05:12:18,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,985 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-16 05:12:18,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,993 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:18,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:19,000 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 05:12:19,001 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 05:12:19,001 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 05:12:19,001 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 05:12:19,002 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (1/1) ... [2024-11-16 05:12:19,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:12:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 05:12:19,034 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) [2024-11-16 05:12:19,036 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 [2024-11-16 05:12:19,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 05:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 05:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 05:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 05:12:19,068 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-16 05:12:19,068 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-16 05:12:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 05:12:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 05:12:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 05:12:19,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 05:12:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 05:12:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 05:12:19,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 05:12:19,153 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 05:12:19,155 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 05:12:19,288 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-16 05:12:19,288 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 05:12:19,297 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 05:12:19,297 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 05:12:19,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:19 BoogieIcfgContainer [2024-11-16 05:12:19,298 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 05:12:19,300 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 05:12:19,300 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 05:12:19,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 05:12:19,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:12:18" (1/3) ... [2024-11-16 05:12:19,304 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b67abce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:19, skipping insertion in model container [2024-11-16 05:12:19,304 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:18" (2/3) ... [2024-11-16 05:12:19,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b67abce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:19, skipping insertion in model container [2024-11-16 05:12:19,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:19" (3/3) ... [2024-11-16 05:12:19,308 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2024-11-16 05:12:19,322 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 05:12:19,322 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 05:12:19,363 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 05:12:19,368 INFO L333 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, 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;@1f0b581f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 05:12:19,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 05:12:19,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 05:12:19,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 05:12:19,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:19,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:19,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:19,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:19,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1698756999, now seen corresponding path program 1 times [2024-11-16 05:12:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:19,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920453003] [2024-11-16 05:12:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:19,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:19,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 05:12:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:12:19,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920453003] [2024-11-16 05:12:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920453003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:19,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 05:12:19,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775549598] [2024-11-16 05:12:19,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:19,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 05:12:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:12:19,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 05:12:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:12:19,559 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:19,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:19,583 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2024-11-16 05:12:19,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 05:12:19,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-16 05:12:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:19,591 INFO L225 Difference]: With dead ends: 50 [2024-11-16 05:12:19,591 INFO L226 Difference]: Without dead ends: 23 [2024-11-16 05:12:19,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 05:12:19,596 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:19,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-16 05:12:19,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-16 05:12:19,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 05:12:19,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2024-11-16 05:12:19,634 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 15 [2024-11-16 05:12:19,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:19,635 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2024-11-16 05:12:19,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:19,635 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2024-11-16 05:12:19,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 05:12:19,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:19,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:19,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 05:12:19,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:19,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:19,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1317244782, now seen corresponding path program 1 times [2024-11-16 05:12:19,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:19,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894794566] [2024-11-16 05:12:19,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:19,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:19,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 05:12:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:19,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:19,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:12:19,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894794566] [2024-11-16 05:12:19,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894794566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:19,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:19,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:12:19,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807808768] [2024-11-16 05:12:19,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:19,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:12:19,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:12:19,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:12:19,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:12:19,876 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:19,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:19,906 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-16 05:12:19,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:12:19,907 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-16 05:12:19,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:19,908 INFO L225 Difference]: With dead ends: 31 [2024-11-16 05:12:19,909 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 05:12:19,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:12:19,910 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:19,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 92 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 05:12:19,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-16 05:12:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:19,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-16 05:12:19,920 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 16 [2024-11-16 05:12:19,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:19,920 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-16 05:12:19,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:19,920 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-16 05:12:19,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 05:12:19,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:19,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:19,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 05:12:19,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:19,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:19,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1434051940, now seen corresponding path program 1 times [2024-11-16 05:12:19,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:19,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482483962] [2024-11-16 05:12:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:19,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:20,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 05:12:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:20,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:12:20,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482483962] [2024-11-16 05:12:20,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482483962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:20,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:20,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:12:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540579178] [2024-11-16 05:12:20,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:20,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:12:20,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:12:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:12:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:12:20,060 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:20,089 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-16 05:12:20,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:12:20,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-16 05:12:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:20,091 INFO L225 Difference]: With dead ends: 35 [2024-11-16 05:12:20,091 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 05:12:20,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:12:20,092 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:20,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:20,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 05:12:20,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-16 05:12:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-16 05:12:20,101 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 17 [2024-11-16 05:12:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:20,101 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-16 05:12:20,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:20,101 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-16 05:12:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 05:12:20,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:20,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:20,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 05:12:20,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1822858507, now seen corresponding path program 1 times [2024-11-16 05:12:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:20,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185873423] [2024-11-16 05:12:20,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:20,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 05:12:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:20,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:20,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:12:20,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185873423] [2024-11-16 05:12:20,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185873423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:20,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:20,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:12:20,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329874295] [2024-11-16 05:12:20,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:20,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:12:20,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:12:20,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:12:20,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:12:20,226 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:20,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:20,255 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-16 05:12:20,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:12:20,255 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-16 05:12:20,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:20,256 INFO L225 Difference]: With dead ends: 35 [2024-11-16 05:12:20,257 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 05:12:20,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:12:20,258 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:20,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:20,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 05:12:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-16 05:12:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-16 05:12:20,265 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 18 [2024-11-16 05:12:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:20,265 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-16 05:12:20,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-16 05:12:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-16 05:12:20,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:20,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:20,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 05:12:20,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:20,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:20,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2053712161, now seen corresponding path program 1 times [2024-11-16 05:12:20,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:20,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181078943] [2024-11-16 05:12:20,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:20,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:20,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-16 05:12:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:20,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 05:12:20,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181078943] [2024-11-16 05:12:20,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181078943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:20,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:20,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 05:12:20,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33724305] [2024-11-16 05:12:20,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:20,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 05:12:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 05:12:20,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 05:12:20,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:12:20,364 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:20,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:20,394 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-11-16 05:12:20,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 05:12:20,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-16 05:12:20,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:20,396 INFO L225 Difference]: With dead ends: 35 [2024-11-16 05:12:20,396 INFO L226 Difference]: Without dead ends: 31 [2024-11-16 05:12:20,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 05:12:20,397 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:20,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-16 05:12:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-16 05:12:20,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-16 05:12:20,406 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 19 [2024-11-16 05:12:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:20,406 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-16 05:12:20,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-16 05:12:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-16 05:12:20,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:20,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:20,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 05:12:20,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:20,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash -498444800, now seen corresponding path program 1 times [2024-11-16 05:12:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 05:12:20,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758533586] [2024-11-16 05:12:20,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:20,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 05:12:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:12:20,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 05:12:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 05:12:20,458 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 05:12:20,459 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 05:12:20,460 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 05:12:20,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 05:12:20,464 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 05:12:20,482 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 05:12:20,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:12:20 BoogieIcfgContainer [2024-11-16 05:12:20,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 05:12:20,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 05:12:20,489 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 05:12:20,490 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 05:12:20,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:19" (3/4) ... [2024-11-16 05:12:20,492 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 05:12:20,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 05:12:20,495 INFO L158 Benchmark]: Toolchain (without parser) took 1839.41ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 70.3MB in the beginning and 72.1MB in the end (delta: -1.8MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2024-11-16 05:12:20,495 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 142.6MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:20,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.99ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 57.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 05:12:20,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.28ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 55.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 05:12:20,495 INFO L158 Benchmark]: Boogie Preprocessor took 53.40ms. Allocated memory is still 142.6MB. Free memory was 55.6MB in the beginning and 53.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:20,495 INFO L158 Benchmark]: IcfgBuilder took 296.96ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 53.5MB in the beginning and 148.2MB in the end (delta: -94.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 05:12:20,496 INFO L158 Benchmark]: TraceAbstraction took 1189.16ms. Allocated memory is still 186.6MB. Free memory was 147.1MB in the beginning and 72.1MB in the end (delta: 75.0MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. [2024-11-16 05:12:20,496 INFO L158 Benchmark]: Witness Printer took 4.76ms. Allocated memory is still 186.6MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:20,501 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.09ms. Allocated memory is still 142.6MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.99ms. Allocated memory is still 142.6MB. Free memory was 70.3MB in the beginning and 57.0MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.28ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 55.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.40ms. Allocated memory is still 142.6MB. Free memory was 55.6MB in the beginning and 53.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 296.96ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 53.5MB in the beginning and 148.2MB in the end (delta: -94.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1189.16ms. Allocated memory is still 186.6MB. Free memory was 147.1MB in the beginning and 72.1MB in the end (delta: 75.0MB). Peak memory consumption was 71.8MB. Max. memory is 16.1GB. * Witness Printer took 4.76ms. Allocated memory is still 186.6MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 80]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L66] double x = __VERIFIER_nondet_double(); [L67] double y = 0.0 / 0.0; [L74] CALL, EXPR isnan_double(x) [L18] return x != x; VAL [\result=0] [L74] RET, EXPR isnan_double(x) [L74] COND TRUE !isnan_double(x) [L76] CALL, EXPR fmax_double(x, y) [L57] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=4294967306] [L29] __uint32_t msw, lsw; VAL [\old(x)=4294967306, x=4294967306] [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L36] COND FALSE !(0) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=4294967306, lsw=4294967297, msw=4293918721, x=4294967306] [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; VAL [\old(x)=4294967306, \result=0, x=4294967306] [L57] RET, EXPR __fpclassify_double(x) VAL [x=4294967306, y=4294967307] [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; VAL [\result=4294967307, x=4294967306] [L76] RET, EXPR fmax_double(x, y) [L76] double res = fmax_double(x, y); [L79] COND TRUE res != x [L80] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 478 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 326 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 86 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 152 mSDtfsCounter, 86 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 172 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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: unable to determine feasibility of some traces [2024-11-16 05:12:20,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 05:12:22,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 05:12:22,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 05:12:22,606 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 05:12:22,607 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 05:12:22,635 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 05:12:22,636 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 05:12:22,636 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 05:12:22,637 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 05:12:22,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 05:12:22,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 05:12:22,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 05:12:22,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 05:12:22,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 05:12:22,639 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 05:12:22,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 05:12:22,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 05:12:22,641 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 05:12:22,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 05:12:22,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 05:12:22,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 05:12:22,645 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 05:12:22,645 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 05:12:22,645 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 05:12:22,645 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 05:12:22,645 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 05:12:22,645 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 05:12:22,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 05:12:22,645 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 05:12:22,646 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 05:12:22,646 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 05:12:22,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 05:12:22,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 05:12:22,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 05:12:22,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:12:22,646 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 05:12:22,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 05:12:22,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 05:12:22,647 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 05:12:22,647 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 05:12:22,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 05:12:22,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 05:12:22,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 05:12:22,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 05:12:22,649 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ddb7cbdb5243e0dc5a18ffa5957d423189625fe9ffc6441855806502cce15ab [2024-11-16 05:12:22,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 05:12:22,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 05:12:22,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 05:12:22,931 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 05:12:22,931 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 05:12:22,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2024-11-16 05:12:24,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 05:12:24,325 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 05:12:24,326 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2024-11-16 05:12:24,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841d31636/bd9fc7f985ab4a4291812a53ea5fba79/FLAG54eb41bc3 [2024-11-16 05:12:24,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/841d31636/bd9fc7f985ab4a4291812a53ea5fba79 [2024-11-16 05:12:24,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 05:12:24,352 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 05:12:24,353 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 05:12:24,353 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 05:12:24,358 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 05:12:24,359 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,361 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f3e1bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24, skipping insertion in model container [2024-11-16 05:12:24,361 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 05:12:24,553 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2024-11-16 05:12:24,561 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:12:24,572 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 05:12:24,596 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c[2080,2093] [2024-11-16 05:12:24,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 05:12:24,617 INFO L204 MainTranslator]: Completed translation [2024-11-16 05:12:24,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24 WrapperNode [2024-11-16 05:12:24,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 05:12:24,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 05:12:24,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 05:12:24,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 05:12:24,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,639 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,656 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 47 [2024-11-16 05:12:24,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 05:12:24,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 05:12:24,658 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 05:12:24,658 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 05:12:24,666 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,671 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,684 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [3, 2]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 1 writes are split as follows [1, 0]. [2024-11-16 05:12:24,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,698 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 05:12:24,707 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 05:12:24,707 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 05:12:24,707 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 05:12:24,708 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (1/1) ... [2024-11-16 05:12:24,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 05:12:24,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 05:12:24,734 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) [2024-11-16 05:12:24,736 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 [2024-11-16 05:12:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 05:12:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-16 05:12:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-16 05:12:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 05:12:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 05:12:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 05:12:24,768 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-16 05:12:24,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-16 05:12:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 05:12:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 05:12:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 05:12:24,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 05:12:24,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 05:12:24,839 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 05:12:24,842 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 05:12:25,016 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 05:12:25,017 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 05:12:25,030 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 05:12:25,030 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 05:12:25,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:25 BoogieIcfgContainer [2024-11-16 05:12:25,031 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 05:12:25,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 05:12:25,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 05:12:25,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 05:12:25,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:12:24" (1/3) ... [2024-11-16 05:12:25,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c4a61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:25, skipping insertion in model container [2024-11-16 05:12:25,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:12:24" (2/3) ... [2024-11-16 05:12:25,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c4a61a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:12:25, skipping insertion in model container [2024-11-16 05:12:25,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:25" (3/3) ... [2024-11-16 05:12:25,042 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2024-11-16 05:12:25,056 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 05:12:25,056 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 05:12:25,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 05:12:25,121 INFO L333 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, 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;@a6f96fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 05:12:25,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 05:12:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 05:12:25,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 05:12:25,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:25,134 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:25,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:25,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1270731895, now seen corresponding path program 1 times [2024-11-16 05:12:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:25,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491152170] [2024-11-16 05:12:25,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:25,152 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 [2024-11-16 05:12:25,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:25,155 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) [2024-11-16 05:12:25,157 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 [2024-11-16 05:12:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:25,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 05:12:25,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:25,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:25,284 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:25,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:25,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491152170] [2024-11-16 05:12:25,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491152170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:25,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:25,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 05:12:25,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863552625] [2024-11-16 05:12:25,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:25,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 05:12:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 05:12:25,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 05:12:25,312 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 22 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:25,326 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2024-11-16 05:12:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 05:12:25,328 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-16 05:12:25,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:25,335 INFO L225 Difference]: With dead ends: 46 [2024-11-16 05:12:25,335 INFO L226 Difference]: Without dead ends: 21 [2024-11-16 05:12:25,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 05:12:25,341 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:25,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-16 05:12:25,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-16 05:12:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 05:12:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-16 05:12:25,374 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 14 [2024-11-16 05:12:25,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:25,375 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-16 05:12:25,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-11-16 05:12:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 05:12:25,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:25,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:25,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 05:12:25,585 WARN L453 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 [2024-11-16 05:12:25,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:25,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1781675394, now seen corresponding path program 1 times [2024-11-16 05:12:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519132396] [2024-11-16 05:12:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:25,587 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 [2024-11-16 05:12:25,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:25,590 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) [2024-11-16 05:12:25,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 05:12:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:25,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:12:25,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:25,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:25,722 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:25,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:25,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519132396] [2024-11-16 05:12:25,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519132396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:25,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:25,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:25,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508407364] [2024-11-16 05:12:25,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:25,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:25,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:25,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:25,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:25,725 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:25,834 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2024-11-16 05:12:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:25,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-16 05:12:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:25,836 INFO L225 Difference]: With dead ends: 28 [2024-11-16 05:12:25,836 INFO L226 Difference]: Without dead ends: 24 [2024-11-16 05:12:25,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:25,838 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:25,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:12:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-16 05:12:25,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-16 05:12:25,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-16 05:12:25,847 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2024-11-16 05:12:25,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:25,847 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-16 05:12:25,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-16 05:12:25,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 05:12:25,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:25,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:25,855 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 [2024-11-16 05:12:26,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:26,052 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:26,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1191151500, now seen corresponding path program 1 times [2024-11-16 05:12:26,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:26,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892297423] [2024-11-16 05:12:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:26,053 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 [2024-11-16 05:12:26,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:26,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:12:26,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 05:12:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:26,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:12:26,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:26,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:26,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:26,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892297423] [2024-11-16 05:12:26,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892297423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:26,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:26,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:26,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939044685] [2024-11-16 05:12:26,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:26,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:26,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:26,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:26,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:26,157 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:26,236 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-16 05:12:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:26,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-16 05:12:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:26,238 INFO L225 Difference]: With dead ends: 31 [2024-11-16 05:12:26,238 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 05:12:26,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:26,239 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:26,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:12:26,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 05:12:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-16 05:12:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:26,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-16 05:12:26,244 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 16 [2024-11-16 05:12:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:26,244 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-16 05:12:26,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:26,244 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-16 05:12:26,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 05:12:26,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:26,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:26,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 05:12:26,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:26,446 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:26,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:26,447 INFO L85 PathProgramCache]: Analyzing trace with hash 556355009, now seen corresponding path program 1 times [2024-11-16 05:12:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:26,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496247335] [2024-11-16 05:12:26,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:26,454 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 [2024-11-16 05:12:26,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:26,457 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) [2024-11-16 05:12:26,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 05:12:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:26,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:12:26,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:26,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:26,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:26,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:26,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496247335] [2024-11-16 05:12:26,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496247335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:26,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:26,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:26,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649309669] [2024-11-16 05:12:26,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:26,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:26,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:26,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:26,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:26,556 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:26,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:26,624 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-16 05:12:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:26,626 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-16 05:12:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:26,627 INFO L225 Difference]: With dead ends: 31 [2024-11-16 05:12:26,627 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 05:12:26,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:26,629 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:26,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 05:12:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 05:12:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-16 05:12:26,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:26,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-16 05:12:26,635 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 17 [2024-11-16 05:12:26,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:26,635 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-16 05:12:26,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:26,635 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-16 05:12:26,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 05:12:26,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:26,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:26,640 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 [2024-11-16 05:12:26,836 WARN L453 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 [2024-11-16 05:12:26,836 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:26,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:26,837 INFO L85 PathProgramCache]: Analyzing trace with hash -245616721, now seen corresponding path program 1 times [2024-11-16 05:12:26,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:26,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258382207] [2024-11-16 05:12:26,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:26,838 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 [2024-11-16 05:12:26,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:26,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:12:26,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 05:12:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:26,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:12:26,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:26,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:26,911 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:26,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:26,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258382207] [2024-11-16 05:12:26,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258382207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:26,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:26,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:26,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912247960] [2024-11-16 05:12:26,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:26,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:26,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:26,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:26,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:26,913 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:26,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:26,937 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2024-11-16 05:12:26,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:26,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-16 05:12:26,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:26,938 INFO L225 Difference]: With dead ends: 31 [2024-11-16 05:12:26,938 INFO L226 Difference]: Without dead ends: 27 [2024-11-16 05:12:26,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:26,939 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:26,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:26,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-16 05:12:26,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2024-11-16 05:12:26,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-16 05:12:26,943 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 18 [2024-11-16 05:12:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:26,943 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-16 05:12:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-16 05:12:26,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 05:12:26,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:26,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:26,949 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-16 05:12:27,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:27,145 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:27,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:27,146 INFO L85 PathProgramCache]: Analyzing trace with hash 641886960, now seen corresponding path program 1 times [2024-11-16 05:12:27,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:27,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823143077] [2024-11-16 05:12:27,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:27,146 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 [2024-11-16 05:12:27,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:27,147 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) [2024-11-16 05:12:27,148 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 [2024-11-16 05:12:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:27,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 05:12:27,228 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:27,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 05:12:27,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:27,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:27,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823143077] [2024-11-16 05:12:27,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823143077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:27,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:27,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 05:12:27,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762818869] [2024-11-16 05:12:27,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:27,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 05:12:27,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:27,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 05:12:27,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-16 05:12:27,824 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:29,400 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2024-11-16 05:12:29,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 05:12:29,401 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-16 05:12:29,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:29,402 INFO L225 Difference]: With dead ends: 41 [2024-11-16 05:12:29,402 INFO L226 Difference]: Without dead ends: 23 [2024-11-16 05:12:29,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-16 05:12:29,403 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:29,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 66 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 05:12:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-16 05:12:29,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-16 05:12:29,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-16 05:12:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-16 05:12:29,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2024-11-16 05:12:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:29,408 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-16 05:12:29,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-16 05:12:29,409 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-16 05:12:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-16 05:12:29,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:29,410 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:29,415 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 [2024-11-16 05:12:29,610 WARN L453 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 [2024-11-16 05:12:29,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:29,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash -189907454, now seen corresponding path program 1 times [2024-11-16 05:12:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:29,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815985689] [2024-11-16 05:12:29,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:29,612 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 [2024-11-16 05:12:29,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:29,613 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:12:29,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 05:12:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:29,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:12:29,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 05:12:29,692 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:29,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:29,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815985689] [2024-11-16 05:12:29,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815985689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:29,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:29,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:29,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699948889] [2024-11-16 05:12:29,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:29,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:29,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:29,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:29,694 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:29,720 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-16 05:12:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:29,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-16 05:12:29,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:29,721 INFO L225 Difference]: With dead ends: 30 [2024-11-16 05:12:29,721 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 05:12:29,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:29,721 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:29,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:29,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 05:12:29,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-16 05:12:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-16 05:12:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-16 05:12:29,728 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 23 [2024-11-16 05:12:29,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:29,728 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-16 05:12:29,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-16 05:12:29,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-16 05:12:29,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:29,729 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:29,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-16 05:12:29,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:29,930 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:29,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash -189847872, now seen corresponding path program 1 times [2024-11-16 05:12:29,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:29,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784376133] [2024-11-16 05:12:29,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:29,932 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 [2024-11-16 05:12:29,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:29,934 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) [2024-11-16 05:12:29,935 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 [2024-11-16 05:12:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:29,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 05:12:29,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:30,163 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 05:12:30,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:30,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:30,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784376133] [2024-11-16 05:12:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784376133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:30,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:30,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 05:12:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798691576] [2024-11-16 05:12:30,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:30,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 05:12:30,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:30,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 05:12:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 05:12:30,165 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:32,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:32,072 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-16 05:12:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:12:32,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-16 05:12:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:32,074 INFO L225 Difference]: With dead ends: 31 [2024-11-16 05:12:32,075 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 05:12:32,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 05:12:32,076 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:32,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 61 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-16 05:12:32,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 05:12:32,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-16 05:12:32,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-16 05:12:32,083 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 23 [2024-11-16 05:12:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:32,083 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-16 05:12:32,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-16 05:12:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 05:12:32,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:32,085 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:32,090 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 [2024-11-16 05:12:32,285 WARN L453 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 [2024-11-16 05:12:32,286 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:32,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:32,286 INFO L85 PathProgramCache]: Analyzing trace with hash -943770002, now seen corresponding path program 1 times [2024-11-16 05:12:32,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:32,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460828277] [2024-11-16 05:12:32,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:32,287 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 [2024-11-16 05:12:32,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:32,288 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:12:32,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-16 05:12:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:32,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:12:32,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 05:12:32,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:32,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:32,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460828277] [2024-11-16 05:12:32,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460828277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835971304] [2024-11-16 05:12:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:32,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:32,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:32,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:32,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:32,362 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:32,394 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-16 05:12:32,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:32,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-16 05:12:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:32,396 INFO L225 Difference]: With dead ends: 32 [2024-11-16 05:12:32,396 INFO L226 Difference]: Without dead ends: 28 [2024-11-16 05:12:32,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:32,396 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:32,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:32,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-16 05:12:32,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-16 05:12:32,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:12:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-16 05:12:32,403 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2024-11-16 05:12:32,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:32,403 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-16 05:12:32,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:32,403 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-16 05:12:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-16 05:12:32,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:32,404 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:32,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-16 05:12:32,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:32,606 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:32,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash -943710420, now seen corresponding path program 1 times [2024-11-16 05:12:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748107897] [2024-11-16 05:12:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:32,607 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 [2024-11-16 05:12:32,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:32,609 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) [2024-11-16 05:12:32,610 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 [2024-11-16 05:12:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:32,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 05:12:32,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:32,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 05:12:32,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:32,860 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:32,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748107897] [2024-11-16 05:12:32,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1748107897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:32,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:32,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 05:12:32,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704883467] [2024-11-16 05:12:32,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:32,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 05:12:32,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:32,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 05:12:32,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 05:12:32,862 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:33,183 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-11-16 05:12:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:12:33,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-16 05:12:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:33,184 INFO L225 Difference]: With dead ends: 33 [2024-11-16 05:12:33,184 INFO L226 Difference]: Without dead ends: 28 [2024-11-16 05:12:33,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 05:12:33,185 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:33,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 65 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 05:12:33,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-16 05:12:33,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2024-11-16 05:12:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-16 05:12:33,190 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 24 [2024-11-16 05:12:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:33,190 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-16 05:12:33,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-16 05:12:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 05:12:33,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:33,191 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:33,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-16 05:12:33,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:33,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:33,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:33,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1141822203, now seen corresponding path program 1 times [2024-11-16 05:12:33,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:33,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213578910] [2024-11-16 05:12:33,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:33,392 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 [2024-11-16 05:12:33,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:33,394 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:12:33,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-16 05:12:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:33,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:12:33,455 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:33,468 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 05:12:33,468 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:33,469 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:33,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213578910] [2024-11-16 05:12:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213578910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:33,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:33,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523838283] [2024-11-16 05:12:33,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:33,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:33,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:33,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:33,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:33,470 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:33,496 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-16 05:12:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:33,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-16 05:12:33,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:33,497 INFO L225 Difference]: With dead ends: 32 [2024-11-16 05:12:33,497 INFO L226 Difference]: Without dead ends: 28 [2024-11-16 05:12:33,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:33,497 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:33,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-16 05:12:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-16 05:12:33,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-16 05:12:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-16 05:12:33,501 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 25 [2024-11-16 05:12:33,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:33,501 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-16 05:12:33,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:33,501 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-16 05:12:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-16 05:12:33,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:33,502 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:33,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-16 05:12:33,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:33,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:33,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1141762621, now seen corresponding path program 1 times [2024-11-16 05:12:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:33,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029960937] [2024-11-16 05:12:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:33,704 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 [2024-11-16 05:12:33,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:33,706 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:12:33,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-16 05:12:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:33,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 05:12:33,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 05:12:33,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:33,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:33,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029960937] [2024-11-16 05:12:33,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029960937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:33,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:33,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 05:12:33,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884022077] [2024-11-16 05:12:33,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:33,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 05:12:33,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 05:12:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 05:12:33,939 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:36,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 05:12:36,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:36,716 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-16 05:12:36,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:12:36,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-16 05:12:36,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:36,718 INFO L225 Difference]: With dead ends: 35 [2024-11-16 05:12:36,718 INFO L226 Difference]: Without dead ends: 30 [2024-11-16 05:12:36,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 05:12:36,719 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:36,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 61 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 05:12:36,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-16 05:12:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2024-11-16 05:12:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 19 states have (on average 1.263157894736842) internal successors, (24), 21 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:36,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-16 05:12:36,722 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 25 [2024-11-16 05:12:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:36,723 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-16 05:12:36,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:36,723 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2024-11-16 05:12:36,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 05:12:36,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:36,723 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:36,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-16 05:12:36,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:36,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:36,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1289622831, now seen corresponding path program 1 times [2024-11-16 05:12:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295050594] [2024-11-16 05:12:36,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:36,927 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 [2024-11-16 05:12:36,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:36,928 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:12:36,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-16 05:12:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:36,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:12:36,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 05:12:37,005 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:37,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295050594] [2024-11-16 05:12:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295050594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:37,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:37,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752861363] [2024-11-16 05:12:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:37,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:37,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:37,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:37,007 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:37,024 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-11-16 05:12:37,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-16 05:12:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:37,026 INFO L225 Difference]: With dead ends: 30 [2024-11-16 05:12:37,026 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 05:12:37,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:37,027 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:37,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 05:12:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-16 05:12:37,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 05:12:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-16 05:12:37,035 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 26 [2024-11-16 05:12:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:37,035 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-16 05:12:37,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-16 05:12:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 05:12:37,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:37,036 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:37,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-16 05:12:37,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:37,240 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:37,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:37,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1289563249, now seen corresponding path program 1 times [2024-11-16 05:12:37,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:37,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504854390] [2024-11-16 05:12:37,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:37,240 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 [2024-11-16 05:12:37,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:37,242 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:12:37,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-16 05:12:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:37,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 05:12:37,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 05:12:37,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:37,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:37,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504854390] [2024-11-16 05:12:37,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504854390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:37,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:37,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 05:12:37,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439745247] [2024-11-16 05:12:37,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:37,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 05:12:37,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:37,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 05:12:37,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 05:12:37,548 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:39,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 05:12:39,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:39,616 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-16 05:12:39,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:12:39,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-16 05:12:39,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:39,617 INFO L225 Difference]: With dead ends: 31 [2024-11-16 05:12:39,617 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 05:12:39,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 05:12:39,617 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:39,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 65 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-16 05:12:39,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 05:12:39,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2024-11-16 05:12:39,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 05:12:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-11-16 05:12:39,621 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2024-11-16 05:12:39,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:39,621 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-11-16 05:12:39,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-11-16 05:12:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 05:12:39,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:39,622 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:39,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-16 05:12:39,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 05:12:39,822 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:39,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:39,823 INFO L85 PathProgramCache]: Analyzing trace with hash -402119150, now seen corresponding path program 1 times [2024-11-16 05:12:39,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:39,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232280667] [2024-11-16 05:12:39,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:39,823 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 [2024-11-16 05:12:39,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:39,824 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 05:12:39,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-16 05:12:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:39,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 05:12:39,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 05:12:40,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 05:12:40,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232280667] [2024-11-16 05:12:40,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232280667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 05:12:40,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2044128002] [2024-11-16 05:12:40,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:40,541 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 05:12:40,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 05:12:40,544 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 05:12:40,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-16 05:12:40,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:40,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 05:12:40,765 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:40,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 05:12:40,925 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:40,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2044128002] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:40,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 05:12:40,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2024-11-16 05:12:40,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582461773] [2024-11-16 05:12:40,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:40,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 05:12:40,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:40,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 05:12:40,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-16 05:12:40,927 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:40,973 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2024-11-16 05:12:40,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 05:12:40,973 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-16 05:12:40,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:40,974 INFO L225 Difference]: With dead ends: 27 [2024-11-16 05:12:40,974 INFO L226 Difference]: Without dead ends: 23 [2024-11-16 05:12:40,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-16 05:12:40,974 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:40,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:40,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-16 05:12:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-16 05:12:40,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 05:12:40,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2024-11-16 05:12:40,977 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 26 [2024-11-16 05:12:40,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:40,977 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2024-11-16 05:12:40,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:40,977 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2024-11-16 05:12:40,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 05:12:40,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 05:12:40,978 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:40,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-16 05:12:41,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-16 05:12:41,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 05:12:41,382 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 05:12:41,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 05:12:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash -402059568, now seen corresponding path program 1 times [2024-11-16 05:12:41,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 05:12:41,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039835244] [2024-11-16 05:12:41,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 05:12:41,383 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 [2024-11-16 05:12:41,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 05:12:41,385 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2024-11-16 05:12:41,386 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 (18)] Waiting until timeout for monitored process [2024-11-16 05:12:41,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 05:12:41,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 05:12:41,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 05:12:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-16 05:12:41,474 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 05:12:41,474 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 05:12:41,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039835244] [2024-11-16 05:12:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039835244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 05:12:41,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 05:12:41,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 05:12:41,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362571170] [2024-11-16 05:12:41,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 05:12:41,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 05:12:41,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 05:12:41,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 05:12:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:41,476 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 05:12:41,484 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2024-11-16 05:12:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 05:12:41,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-16 05:12:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 05:12:41,485 INFO L225 Difference]: With dead ends: 23 [2024-11-16 05:12:41,485 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 05:12:41,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 05:12:41,485 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 05:12:41,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 05:12:41,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 05:12:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 05:12:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 05:12:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 05:12:41,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-16 05:12:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 05:12:41,487 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 05:12:41,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-16 05:12:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 05:12:41,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 05:12:41,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 05:12:41,504 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 (18)] Forceful destruction successful, exit code 0 [2024-11-16 05:12:41,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2024-11-16 05:12:41,698 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 05:12:41,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 05:12:42,654 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 05:12:42,680 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:12:42,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:12:42,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:12:42,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:12:42,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:12:42,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:12:42,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:12:42,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:12:42,683 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-16 05:12:42,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:12:42 BoogieIcfgContainer [2024-11-16 05:12:42,689 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 05:12:42,690 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 05:12:42,690 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 05:12:42,690 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 05:12:42,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:12:25" (3/4) ... [2024-11-16 05:12:42,692 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 05:12:42,696 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2024-11-16 05:12:42,699 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-16 05:12:42,700 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-16 05:12:42,700 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 05:12:42,700 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 05:12:42,784 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 05:12:42,784 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 05:12:42,784 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 05:12:42,785 INFO L158 Benchmark]: Toolchain (without parser) took 18433.31ms. Allocated memory was 58.7MB in the beginning and 94.4MB in the end (delta: 35.7MB). Free memory was 35.6MB in the beginning and 70.1MB in the end (delta: -34.5MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2024-11-16 05:12:42,785 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 58.7MB. Free memory was 34.8MB in the beginning and 34.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:42,786 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.47ms. Allocated memory is still 58.7MB. Free memory was 35.4MB in the beginning and 21.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 05:12:42,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.87ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 21.6MB in the beginning and 57.3MB in the end (delta: -35.7MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-11-16 05:12:42,786 INFO L158 Benchmark]: Boogie Preprocessor took 48.62ms. Allocated memory is still 77.6MB. Free memory was 56.9MB in the beginning and 54.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 05:12:42,786 INFO L158 Benchmark]: IcfgBuilder took 323.85ms. Allocated memory is still 77.6MB. Free memory was 54.9MB in the beginning and 41.0MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 05:12:42,786 INFO L158 Benchmark]: TraceAbstraction took 17655.59ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 40.3MB in the beginning and 23.2MB in the end (delta: 17.0MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. [2024-11-16 05:12:42,787 INFO L158 Benchmark]: Witness Printer took 94.62ms. Allocated memory is still 94.4MB. Free memory was 23.2MB in the beginning and 70.1MB in the end (delta: -46.9MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-11-16 05:12:42,787 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.71ms. Allocated memory is still 58.7MB. Free memory was 34.8MB in the beginning and 34.7MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.47ms. Allocated memory is still 58.7MB. Free memory was 35.4MB in the beginning and 21.8MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.87ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 21.6MB in the beginning and 57.3MB in the end (delta: -35.7MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.62ms. Allocated memory is still 77.6MB. Free memory was 56.9MB in the beginning and 54.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 323.85ms. Allocated memory is still 77.6MB. Free memory was 54.9MB in the beginning and 41.0MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17655.59ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 40.3MB in the beginning and 23.2MB in the end (delta: 17.0MB). Peak memory consumption was 37.0MB. Max. memory is 16.1GB. * Witness Printer took 94.62ms. Allocated memory is still 94.4MB. Free memory was 23.2MB in the beginning and 70.1MB in the end (delta: -46.9MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 80]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 16, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 74 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 1103 SdHoareTripleChecker+Invalid, 8.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 740 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 363 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 390 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=9, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 21 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 355 ConstructedInterpolants, 58 QuantifiedInterpolants, 1789 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1293 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 17 InterpolantComputations, 16 PerfectInterpolantSequences, 61/66 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Location Invariant Derived location invariant: null - ProcedureContractResult [Line: 28]: Procedure Contract for __fpclassify_double Derived contract for procedure __fpclassify_double. Ensures: (((((0 == \result) || (4 == \result)) || (1 == \result)) || (3 == \result)) || (2 == \result)) RESULT: Ultimate proved your program to be correct! [2024-11-16 05:12:42,911 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE