./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/float_req_bl_1232a.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 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:54:05,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:54:05,585 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 11:54:05,592 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:54:05,593 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:54:05,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:54:05,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:54:05,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:54:05,621 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:54:05,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:54:05,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:54:05,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:54:05,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:54:05,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:54:05,625 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:54:05,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:54:05,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:54:05,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:54:05,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 11:54:05,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:54:05,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:54:05,631 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:54:05,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:54:05,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:54:05,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:54:05,632 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:54:05,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:54:05,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:54:05,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:54:05,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:54:05,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:54:05,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:54:05,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:05,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:54:05,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:54:05,634 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:54:05,635 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 11:54:05,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 11:54:05,636 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:54:05,636 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:54:05,637 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:54:05,637 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:54:05,637 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 -> 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 [2024-11-18 11:54:05,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:54:05,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:54:05,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:54:05,915 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:54:05,916 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:54:05,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-18 11:54:07,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:54:07,554 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:54:07,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-18 11:54:07,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8be12f249/1577df26c2294ab788b33ebdf279d1d1/FLAGbfaa950a1 [2024-11-18 11:54:07,580 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8be12f249/1577df26c2294ab788b33ebdf279d1d1 [2024-11-18 11:54:07,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:54:07,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:54:07,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:07,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:54:07,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:54:07,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13334940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07, skipping insertion in model container [2024-11-18 11:54:07,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:54:07,805 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/float_req_bl_1232a.c[1656,1669] [2024-11-18 11:54:07,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:07,818 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:54:07,838 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/float_req_bl_1232a.c[1656,1669] [2024-11-18 11:54:07,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:07,863 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:54:07,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07 WrapperNode [2024-11-18 11:54:07,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:07,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:07,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:54:07,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:54:07,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,913 INFO L138 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-18 11:54:07,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:07,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:54:07,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:54:07,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:54:07,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,952 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-18 11:54:07,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,976 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,980 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:54:07,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:54:07,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:54:07,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:54:07,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (1/1) ... [2024-11-18 11:54:07,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:08,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:54:08,029 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-18 11:54:08,032 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-18 11:54:08,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:54:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 11:54:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 11:54:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-18 11:54:08,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 11:54:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-18 11:54:08,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-18 11:54:08,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-18 11:54:08,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-18 11:54:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-18 11:54:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:54:08,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:54:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-18 11:54:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-18 11:54:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-18 11:54:08,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 11:54:08,168 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:54:08,169 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:54:08,409 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-18 11:54:08,410 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:54:08,428 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:54:08,428 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 11:54:08,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:08 BoogieIcfgContainer [2024-11-18 11:54:08,429 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:54:08,433 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:54:08,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:54:08,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:54:08,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:54:07" (1/3) ... [2024-11-18 11:54:08,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ddcb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:08, skipping insertion in model container [2024-11-18 11:54:08,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:07" (2/3) ... [2024-11-18 11:54:08,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ddcb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:08, skipping insertion in model container [2024-11-18 11:54:08,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:08" (3/3) ... [2024-11-18 11:54:08,442 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2024-11-18 11:54:08,460 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:54:08,460 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 11:54:08,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:54:08,537 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;@632371e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:54:08,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 11:54:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 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-18 11:54:08,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 11:54:08,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:08,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:08,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:08,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:08,555 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-18 11:54:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:08,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772208051] [2024-11-18 11:54:08,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:08,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:08,738 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-18 11:54:08,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:08,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772208051] [2024-11-18 11:54:08,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772208051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:08,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:08,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:54:08,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289518643] [2024-11-18 11:54:08,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:08,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 11:54:08,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:08,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 11:54:08,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:54:08,765 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 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-18 11:54:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:08,783 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-18 11:54:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 11:54:08,785 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-18 11:54:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:08,793 INFO L225 Difference]: With dead ends: 55 [2024-11-18 11:54:08,794 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 11:54:08,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-18 11:54:08,803 INFO L432 NwaCegarLoop]: 36 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, 36 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-18 11:54:08,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:08,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 11:54:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-18 11:54:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-18 11:54:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-18 11:54:08,841 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-18 11:54:08,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:08,841 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-18 11:54:08,841 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-18 11:54:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-18 11:54:08,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 11:54:08,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:08,843 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:08,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 11:54:08,845 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:08,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-18 11:54:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:08,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696289004] [2024-11-18 11:54:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:08,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:09,014 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-18 11:54:09,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696289004] [2024-11-18 11:54:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696289004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:09,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:09,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213159408] [2024-11-18 11:54:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:09,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:09,019 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-18 11:54:09,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:09,044 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-18 11:54:09,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:09,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-18 11:54:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:09,048 INFO L225 Difference]: With dead ends: 39 [2024-11-18 11:54:09,048 INFO L226 Difference]: Without dead ends: 30 [2024-11-18 11:54:09,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 11:54:09,049 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:09,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-18 11:54:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-18 11:54:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-18 11:54:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:09,058 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-18 11:54:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:09,058 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:09,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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-18 11:54:09,058 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 11:54:09,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:09,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:09,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 11:54:09,059 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:09,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-18 11:54:09,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:09,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616222567] [2024-11-18 11:54:09,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:09,174 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-18 11:54:09,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616222567] [2024-11-18 11:54:09,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616222567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:09,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:09,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:09,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398359611] [2024-11-18 11:54:09,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:09,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:09,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:09,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:09,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:09,178 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) 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-18 11:54:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:09,210 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:54:09,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:09,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) 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-18 11:54:09,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:09,212 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:54:09,212 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:54:09,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 11:54:09,214 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:09,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:09,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:54:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:54:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-18 11:54:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:09,222 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-18 11:54:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:09,222 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:09,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) 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-18 11:54:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-18 11:54:09,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:09,223 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:09,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 11:54:09,224 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:09,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-18 11:54:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296558289] [2024-11-18 11:54:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:09,338 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-18 11:54:09,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:09,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296558289] [2024-11-18 11:54:09,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296558289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:09,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:09,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362785950] [2024-11-18 11:54:09,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:09,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:09,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:09,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:09,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:09,341 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) 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-18 11:54:09,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:09,390 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:54:09,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:09,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) 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-18 11:54:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:09,392 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:54:09,393 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:54:09,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 11:54:09,398 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:09,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:54:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:54:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-18 11:54:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:09,414 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-18 11:54:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:09,415 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:09,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) 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-18 11:54:09,415 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 11:54:09,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:09,416 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-18 11:54:09,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 11:54:09,416 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:09,432 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-18 11:54:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:09,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361087236] [2024-11-18 11:54:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:09,522 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-18 11:54:09,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:54:09,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361087236] [2024-11-18 11:54:09,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361087236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:09,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:09,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:09,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628011465] [2024-11-18 11:54:09,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:09,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:09,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:54:09,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:09,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:09,525 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.0) 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-18 11:54:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:09,558 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-18 11:54:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) 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-18 11:54:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:09,564 INFO L225 Difference]: With dead ends: 43 [2024-11-18 11:54:09,564 INFO L226 Difference]: Without dead ends: 34 [2024-11-18 11:54:09,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-18 11:54:09,565 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:09,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:09,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-18 11:54:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-18 11:54:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-18 11:54:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-18 11:54:09,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-18 11:54:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:09,575 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-18 11:54:09,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) 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-18 11:54:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-18 11:54:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-18 11:54:09,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:09,576 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-18 11:54:09,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 11:54:09,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:09,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-18 11:54:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:54:09,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886472387] [2024-11-18 11:54:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:54:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:54:09,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 11:54:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 11:54:09,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 11:54:09,615 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 11:54:09,616 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 11:54:09,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 11:54:09,620 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-18 11:54:09,636 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:54:09,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:54:09 BoogieIcfgContainer [2024-11-18 11:54:09,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:54:09,642 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:54:09,642 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:54:09,643 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:54:09,643 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:08" (3/4) ... [2024-11-18 11:54:09,645 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 11:54:09,646 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:54:09,647 INFO L158 Benchmark]: Toolchain (without parser) took 2062.47ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 82.5MB in the beginning and 126.6MB in the end (delta: -44.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:09,647 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory was 110.0MB in the beginning and 109.9MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:09,648 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.01ms. Allocated memory is still 138.4MB. Free memory was 82.4MB in the beginning and 69.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 11:54:09,648 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.73ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 69.4MB in the beginning and 149.8MB in the end (delta: -80.5MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-18 11:54:09,648 INFO L158 Benchmark]: Boogie Preprocessor took 68.20ms. Allocated memory is still 180.4MB. Free memory was 149.8MB in the beginning and 149.7MB in the end (delta: 104.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 11:54:09,648 INFO L158 Benchmark]: RCFGBuilder took 444.95ms. Allocated memory is still 180.4MB. Free memory was 148.8MB in the beginning and 134.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 11:54:09,649 INFO L158 Benchmark]: TraceAbstraction took 1205.48ms. Allocated memory is still 180.4MB. Free memory was 134.2MB in the beginning and 127.6MB in the end (delta: 6.6MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2024-11-18 11:54:09,649 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 180.4MB. Free memory was 127.6MB in the beginning and 126.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 11:54:09,654 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.14ms. Allocated memory is still 138.4MB. Free memory was 110.0MB in the beginning and 109.9MB in the end (delta: 167.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.01ms. Allocated memory is still 138.4MB. Free memory was 82.4MB in the beginning and 69.4MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.73ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 69.4MB in the beginning and 149.8MB in the end (delta: -80.5MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.20ms. Allocated memory is still 180.4MB. Free memory was 149.8MB in the beginning and 149.7MB in the end (delta: 104.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 444.95ms. Allocated memory is still 180.4MB. Free memory was 148.8MB in the beginning and 134.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1205.48ms. Allocated memory is still 180.4MB. Free memory was 134.2MB in the beginning and 127.6MB in the end (delta: 6.6MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 180.4MB. Free memory was 127.6MB in the beginning and 126.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 72]: 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 someBinaryFLOATComparisonOperation at line 71, overapproximation of someUnaryFLOAToperation at line 67. Possible FailurePath: [L66] float x = 0.0f; [L67] float y = -0.0f; [L68] CALL, EXPR fmin_float(x, y) [L38] CALL, EXPR __fpclassify_float(x) VAL [\old(x)=0] [L15] __uint32_t w; VAL [\old(x)=0, x=0] [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) VAL [\old(x)=0, w=4286578689, x=0] [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) VAL [\old(x)=0, w=4286578689, x=0] [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; VAL [\old(x)=0, \result=0, x=0] [L38] RET, EXPR __fpclassify_float(x) VAL [x=0, y=4286578698] [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; VAL [\result=4286578698, x=0] [L68] RET, EXPR fmin_float(x, y) [L68] float res = fmin_float(x, y); [L71] EXPR res == -0.0f && __signbit_float(res) == 1 VAL [res=4286578698] [L71] EXPR res == -0.0f && __signbit_float(res) == 1 [L71] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L72] reach_error() VAL [res=4286578698] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 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, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 409 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 234 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 175 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=2, InterpolantAutomatonStates: 18, 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, 5 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 107 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-18 11:54:09,679 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/float_req_bl_1232a.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 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:54:11,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:54:11,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 11:54:11,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:54:11,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:54:11,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:54:11,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:54:11,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:54:11,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:54:11,922 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:54:11,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:54:11,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:54:11,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:54:11,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:54:11,927 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:54:11,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:54:11,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:54:11,928 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:54:11,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:54:11,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:54:11,932 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:54:11,932 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:54:11,932 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:54:11,933 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 11:54:11,933 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 11:54:11,933 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:54:11,933 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 11:54:11,933 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:54:11,934 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:54:11,934 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:54:11,934 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:54:11,934 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:54:11,934 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:54:11,934 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:54:11,935 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:11,935 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:54:11,935 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:54:11,935 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:54:11,935 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 11:54:11,936 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 11:54:11,936 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:54:11,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:54:11,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:54:11,939 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:54:11,939 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 -> 6f83584f969f73b8fbd0ee35f3e06725eeb8b2fb54d0ca8487878342f741f280 [2024-11-18 11:54:12,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:54:12,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:54:12,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:54:12,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:54:12,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:54:12,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-18 11:54:13,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:54:14,109 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:54:14,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232a.c [2024-11-18 11:54:14,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f093b602/e80d98704ceb45bdb71e70fca45fad5c/FLAGf42b71171 [2024-11-18 11:54:14,140 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f093b602/e80d98704ceb45bdb71e70fca45fad5c [2024-11-18 11:54:14,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:54:14,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:54:14,147 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:14,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:54:14,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:54:14,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,155 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21148577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14, skipping insertion in model container [2024-11-18 11:54:14,156 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,175 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:54:14,374 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/float_req_bl_1232a.c[1656,1669] [2024-11-18 11:54:14,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:14,393 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:54:14,418 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/float_req_bl_1232a.c[1656,1669] [2024-11-18 11:54:14,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:54:14,441 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:54:14,441 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14 WrapperNode [2024-11-18 11:54:14,441 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:54:14,442 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:14,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:54:14,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:54:14,450 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,486 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-18 11:54:14,488 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:54:14,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:54:14,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:54:14,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:54:14,509 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,535 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-18 11:54:14,537 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,537 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,545 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,553 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,555 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:54:14,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:54:14,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:54:14,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:54:14,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (1/1) ... [2024-11-18 11:54:14,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:54:14,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:54:14,601 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-18 11:54:14,603 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-18 11:54:14,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:54:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 11:54:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-18 11:54:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-18 11:54:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-18 11:54:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2024-11-18 11:54:14,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2024-11-18 11:54:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-18 11:54:14,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-18 11:54:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-18 11:54:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:54:14,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:54:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-18 11:54:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-18 11:54:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-18 11:54:14,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-18 11:54:14,748 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:54:14,750 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:54:14,950 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-18 11:54:14,950 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:54:14,966 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:54:14,967 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-18 11:54:14,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:14 BoogieIcfgContainer [2024-11-18 11:54:14,968 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:54:14,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:54:14,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:54:14,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:54:14,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:54:14" (1/3) ... [2024-11-18 11:54:14,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df824b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:14, skipping insertion in model container [2024-11-18 11:54:14,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:54:14" (2/3) ... [2024-11-18 11:54:14,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df824b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:54:14, skipping insertion in model container [2024-11-18 11:54:14,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:14" (3/3) ... [2024-11-18 11:54:14,978 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a.c [2024-11-18 11:54:14,994 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:54:14,995 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 11:54:15,051 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:54:15,059 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;@60c2dcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:54:15,060 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 11:54:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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-18 11:54:15,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-18 11:54:15,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:15,072 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:15,072 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:15,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-18 11:54:15,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:15,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1201919023] [2024-11-18 11:54:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:15,089 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-18 11:54:15,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:15,093 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-18 11:54:15,094 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-18 11:54:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:15,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 11:54:15,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:15,230 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-18 11:54:15,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:15,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:15,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1201919023] [2024-11-18 11:54:15,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1201919023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:15,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:15,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:54:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415015729] [2024-11-18 11:54:15,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:15,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 11:54:15,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:15,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 11:54:15,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 11:54:15,266 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-18 11:54:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:15,284 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-18 11:54:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 11:54:15,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2024-11-18 11:54:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:15,291 INFO L225 Difference]: With dead ends: 51 [2024-11-18 11:54:15,292 INFO L226 Difference]: Without dead ends: 24 [2024-11-18 11:54:15,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-18 11:54:15,301 INFO L432 NwaCegarLoop]: 34 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, 34 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-18 11:54:15,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-18 11:54:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-18 11:54:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 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-18 11:54:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-18 11:54:15,331 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-18 11:54:15,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:15,332 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-18 11:54:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-18 11:54:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-18 11:54:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 11:54:15,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:15,334 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:15,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-18 11:54:15,534 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-18 11:54:15,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:15,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:15,536 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-18 11:54:15,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:15,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064589822] [2024-11-18 11:54:15,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:15,537 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-18 11:54:15,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:15,540 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-18 11:54:15,541 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-18 11:54:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:15,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:54:15,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:15,650 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-18 11:54:15,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:15,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:15,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064589822] [2024-11-18 11:54:15,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064589822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:15,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:15,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589090057] [2024-11-18 11:54:15,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:15,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:15,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:15,655 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-18 11:54:15,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:15,682 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-18 11:54:15,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:15,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-18 11:54:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:15,684 INFO L225 Difference]: With dead ends: 36 [2024-11-18 11:54:15,684 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 11:54:15,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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-18 11:54:15,686 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 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-18 11:54:15,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:15,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 11:54:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-18 11:54:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-18 11:54:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-18 11:54:15,693 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-18 11:54:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:15,694 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-18 11:54:15,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-18 11:54:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-18 11:54:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-18 11:54:15,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:15,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:15,699 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 (3)] Ended with exit code 0 [2024-11-18 11:54:15,895 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-18 11:54:15,896 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:15,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-18 11:54:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:15,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146882691] [2024-11-18 11:54:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:15,899 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-18 11:54:15,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:15,903 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-18 11:54:15,904 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-18 11:54:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:15,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-18 11:54:15,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:16,182 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-18 11:54:16,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:16,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:16,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146882691] [2024-11-18 11:54:16,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146882691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:16,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:16,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:54:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250170135] [2024-11-18 11:54:16,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:16,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:54:16,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:16,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:54:16,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:54:16,186 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-18 11:54:16,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:16,377 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2024-11-18 11:54:16,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 11:54:16,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-18 11:54:16,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:16,379 INFO L225 Difference]: With dead ends: 49 [2024-11-18 11:54:16,379 INFO L226 Difference]: Without dead ends: 26 [2024-11-18 11:54:16,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:54:16,380 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:16,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 73 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:54:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-18 11:54:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-18 11:54:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 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-18 11:54:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-18 11:54:16,390 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2024-11-18 11:54:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:16,390 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-18 11:54:16,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 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-18 11:54:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-18 11:54:16,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 11:54:16,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:16,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:16,398 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-18 11:54:16,593 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-18 11:54:16,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:16,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:16,595 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-18 11:54:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1321294903] [2024-11-18 11:54:16,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:16,596 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-18 11:54:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:16,599 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-18 11:54:16,600 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-18 11:54:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:16,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-18 11:54:16,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:16,707 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-18 11:54:16,708 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:16,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:16,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1321294903] [2024-11-18 11:54:16,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1321294903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:16,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:16,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 11:54:16,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863210688] [2024-11-18 11:54:16,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:16,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:54:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:16,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:54:16,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:54:16,713 INFO L87 Difference]: Start difference. First operand 26 states and 32 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, (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-18 11:54:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:16,740 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-18 11:54:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:54:16,740 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, (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 22 [2024-11-18 11:54:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:16,741 INFO L225 Difference]: With dead ends: 36 [2024-11-18 11:54:16,741 INFO L226 Difference]: Without dead ends: 27 [2024-11-18 11:54:16,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-18 11:54:16,742 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 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-18 11:54:16,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-18 11:54:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-18 11:54:16,750 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, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 11:54:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-18 11:54:16,754 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 22 [2024-11-18 11:54:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:16,754 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-18 11:54:16,754 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, (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-18 11:54:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-18 11:54:16,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-18 11:54:16,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:16,755 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:16,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-18 11:54:16,955 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-18 11:54:16,956 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:16,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:16,957 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-18 11:54:16,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:16,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1399780814] [2024-11-18 11:54:16,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:16,958 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-18 11:54:16,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:16,960 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-18 11:54:16,961 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-18 11:54:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:17,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 11:54:17,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:17,095 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-18 11:54:17,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:17,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:17,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1399780814] [2024-11-18 11:54:17,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1399780814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:17,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:17,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 11:54:17,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11166958] [2024-11-18 11:54:17,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:17,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 11:54:17,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:17,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 11:54:17,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 11:54:17,098 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 11:54:17,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:17,128 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-18 11:54:17,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 11:54:17,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 22 [2024-11-18 11:54:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:17,129 INFO L225 Difference]: With dead ends: 32 [2024-11-18 11:54:17,129 INFO L226 Difference]: Without dead ends: 29 [2024-11-18 11:54:17,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-18 11:54:17,131 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:17,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-18 11:54:17,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-18 11:54:17,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-18 11:54:17,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-18 11:54:17,136 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 22 [2024-11-18 11:54:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:17,136 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-18 11:54:17,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-18 11:54:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-18 11:54:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-18 11:54:17,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:17,137 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:17,143 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-18 11:54:17,338 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-18 11:54:17,338 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:17,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:17,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-18 11:54:17,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:17,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079002316] [2024-11-18 11:54:17,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:17,340 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-18 11:54:17,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:17,343 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-18 11:54:17,344 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-18 11:54:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:17,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-18 11:54:17,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:17,501 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-18 11:54:17,501 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:17,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:17,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079002316] [2024-11-18 11:54:17,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079002316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:17,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:17,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 11:54:17,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138647541] [2024-11-18 11:54:17,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:17,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 11:54:17,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:17,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 11:54:17,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 11:54:17,503 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-18 11:54:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:17,663 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-18 11:54:17,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 11:54:17,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-18 11:54:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:17,664 INFO L225 Difference]: With dead ends: 38 [2024-11-18 11:54:17,664 INFO L226 Difference]: Without dead ends: 21 [2024-11-18 11:54:17,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:54:17,666 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:17,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:54:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-18 11:54:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-18 11:54:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.0) internal successors, (17), 17 states have internal predecessors, (17), 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-18 11:54:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-18 11:54:17,670 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 23 [2024-11-18 11:54:17,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:17,670 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-18 11:54:17,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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-18 11:54:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-18 11:54:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 11:54:17,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:54:17,671 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:17,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-18 11:54:17,872 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-18 11:54:17,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:54:17,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:54:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-18 11:54:17,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 11:54:17,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1830958966] [2024-11-18 11:54:17,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:54:17,873 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-18 11:54:17,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 11:54:17,874 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-18 11:54:17,876 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-18 11:54:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:54:17,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 11:54:17,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 11:54:18,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-18 11:54:18,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2024-11-18 11:54:18,098 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-18 11:54:18,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 11:54:18,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 11:54:18,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1830958966] [2024-11-18 11:54:18,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1830958966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:54:18,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:54:18,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 11:54:18,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316663058] [2024-11-18 11:54:18,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:54:18,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 11:54:18,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 11:54:18,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 11:54:18,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-18 11:54:18,101 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-18 11:54:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:54:18,176 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2024-11-18 11:54:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 11:54:18,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-18 11:54:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:54:18,178 INFO L225 Difference]: With dead ends: 21 [2024-11-18 11:54:18,178 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 11:54:18,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-18 11:54:18,179 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:54:18,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:54:18,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 11:54:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 11:54:18,180 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-18 11:54:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 11:54:18,180 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2024-11-18 11:54:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:54:18,180 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 11:54:18,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 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-18 11:54:18,180 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 11:54:18,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 11:54:18,184 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 11:54:18,189 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-18 11:54:18,388 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-18 11:54:18,391 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:54:18,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 11:54:18,557 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 11:54:18,575 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 11:54:18,576 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-18 11:54:18,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:54:18 BoogieIcfgContainer [2024-11-18 11:54:18,581 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 11:54:18,581 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 11:54:18,581 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 11:54:18,581 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 11:54:18,582 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:54:14" (3/4) ... [2024-11-18 11:54:18,586 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 11:54:18,590 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2024-11-18 11:54:18,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2024-11-18 11:54:18,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-18 11:54:18,594 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 11:54:18,595 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 11:54:18,696 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 11:54:18,696 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 11:54:18,697 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 11:54:18,697 INFO L158 Benchmark]: Toolchain (without parser) took 4553.12ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 46.9MB in the beginning and 66.1MB in the end (delta: -19.2MB). Peak memory consumption was 3.4MB. Max. memory is 16.1GB. [2024-11-18 11:54:18,697 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 46.1MB. Free memory was 24.3MB in the beginning and 24.2MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:18,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.86ms. Allocated memory is still 75.5MB. Free memory was 46.7MB in the beginning and 33.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 11:54:18,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.34ms. Allocated memory is still 75.5MB. Free memory was 33.2MB in the beginning and 31.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:18,698 INFO L158 Benchmark]: Boogie Preprocessor took 74.42ms. Allocated memory is still 75.5MB. Free memory was 31.5MB in the beginning and 53.0MB in the end (delta: -21.4MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2024-11-18 11:54:18,698 INFO L158 Benchmark]: RCFGBuilder took 404.70ms. Allocated memory is still 75.5MB. Free memory was 53.0MB in the beginning and 38.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-18 11:54:18,698 INFO L158 Benchmark]: TraceAbstraction took 3610.36ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 38.0MB in the beginning and 71.2MB in the end (delta: -33.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 11:54:18,699 INFO L158 Benchmark]: Witness Printer took 115.43ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 66.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 11:54:18,701 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.92ms. Allocated memory is still 46.1MB. Free memory was 24.3MB in the beginning and 24.2MB in the end (delta: 52.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.86ms. Allocated memory is still 75.5MB. Free memory was 46.7MB in the beginning and 33.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.34ms. Allocated memory is still 75.5MB. Free memory was 33.2MB in the beginning and 31.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 74.42ms. Allocated memory is still 75.5MB. Free memory was 31.5MB in the beginning and 53.0MB in the end (delta: -21.4MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * RCFGBuilder took 404.70ms. Allocated memory is still 75.5MB. Free memory was 53.0MB in the beginning and 38.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3610.36ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 38.0MB in the beginning and 71.2MB in the end (delta: -33.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 115.43ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 66.1MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. 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 * 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: 72]: 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, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 526 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 359 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 167 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=5, InterpolantAutomatonStates: 38, 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, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 128 ConstructedInterpolants, 6 QuantifiedInterpolants, 365 SizeOfPredicates, 11 NumberOfNonLiveVariables, 471 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 24/24 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: 17]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-18 11:54:18,732 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