./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252b.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 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:27:23,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:27:23,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-21 23:27:23,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:27:23,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:27:23,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:27:23,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:27:23,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:27:23,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:27:23,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:27:23,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:27:23,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:27:23,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:27:23,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:27:23,861 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:27:23,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:27:23,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:27:23,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:27:23,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-21 23:27:23,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:27:23,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:27:23,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:27:23,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:27:23,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:27:23,867 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:27:23,867 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:27:23,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:27:23,867 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:27:23,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:27:23,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:27:23,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:27:23,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:27:23,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:27:23,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:27:23,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:27:23,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:27:23,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-21 23:27:23,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-21 23:27:23,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:27:23,869 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:27:23,869 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:27:23,870 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:27:23,871 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 -> 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 [2024-11-21 23:27:24,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:27:24,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:27:24,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:27:24,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:27:24,075 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:27:24,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2024-11-21 23:27:25,309 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:27:25,446 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:27:25,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2024-11-21 23:27:25,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df08389a/68adec1b53594c7ab27d4b7fe4fcfc41/FLAG582ce8a45 [2024-11-21 23:27:25,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df08389a/68adec1b53594c7ab27d4b7fe4fcfc41 [2024-11-21 23:27:25,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:27:25,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:27:25,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:27:25,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:27:25,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:27:25,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1d9df4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25, skipping insertion in model container [2024-11-21 23:27:25,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:27:25,635 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c[2154,2167] [2024-11-21 23:27:25,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:27:25,643 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:27:25,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c[2154,2167] [2024-11-21 23:27:25,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:27:25,692 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:27:25,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25 WrapperNode [2024-11-21 23:27:25,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:27:25,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:27:25,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:27:25,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:27:25,706 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,711 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,734 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2024-11-21 23:27:25,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:27:25,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:27:25,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:27:25,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:27:25,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,759 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 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-21 23:27:25,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,765 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,768 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:27:25,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:27:25,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:27:25,769 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:27:25,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (1/1) ... [2024-11-21 23:27:25,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:27:25,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:27:25,801 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-21 23:27:25,804 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-21 23:27:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:27:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-21 23:27:25,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-21 23:27:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-21 23:27:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 23:27:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-21 23:27:25,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-21 23:27:25,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-21 23:27:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-21 23:27:25,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-21 23:27:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:27:25,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:27:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-21 23:27:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-21 23:27:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-21 23:27:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 23:27:25,909 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:27:25,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:27:26,080 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-21 23:27:26,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:27:26,094 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:27:26,095 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-21 23:27:26,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:26 BoogieIcfgContainer [2024-11-21 23:27:26,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:27:26,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:27:26,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:27:26,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:27:26,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:27:25" (1/3) ... [2024-11-21 23:27:26,100 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e9673c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:27:26, skipping insertion in model container [2024-11-21 23:27:26,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:25" (2/3) ... [2024-11-21 23:27:26,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70e9673c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:27:26, skipping insertion in model container [2024-11-21 23:27:26,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:26" (3/3) ... [2024-11-21 23:27:26,102 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2024-11-21 23:27:26,115 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:27:26,115 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 23:27:26,164 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:27:26,169 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;@76930113, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:27:26,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 23:27:26,171 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-21 23:27:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-21 23:27:26,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:26,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:26,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:26,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:26,181 INFO L85 PathProgramCache]: Analyzing trace with hash -160972861, now seen corresponding path program 1 times [2024-11-21 23:27:26,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:26,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515240784] [2024-11-21 23:27:26,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:26,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:26,313 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-21 23:27:26,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:26,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515240784] [2024-11-21 23:27:26,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515240784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:26,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:26,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 23:27:26,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448789122] [2024-11-21 23:27:26,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:26,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 23:27:26,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 23:27:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:27:26,340 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-21 23:27:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:26,353 INFO L93 Difference]: Finished difference Result 55 states and 80 transitions. [2024-11-21 23:27:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 23:27:26,354 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-21 23:27:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:26,359 INFO L225 Difference]: With dead ends: 55 [2024-11-21 23:27:26,359 INFO L226 Difference]: Without dead ends: 26 [2024-11-21 23:27:26,361 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-21 23:27:26,363 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-21 23:27:26,364 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-21 23:27:26,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-21 23:27:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-21 23:27:26,387 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-21 23:27:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2024-11-21 23:27:26,389 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 14 [2024-11-21 23:27:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:26,389 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2024-11-21 23:27:26,390 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-21 23:27:26,390 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2024-11-21 23:27:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 23:27:26,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:26,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:26,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-21 23:27:26,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:26,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1856750492, now seen corresponding path program 1 times [2024-11-21 23:27:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:26,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698419215] [2024-11-21 23:27:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:26,543 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-21 23:27:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:26,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698419215] [2024-11-21 23:27:26,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698419215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:26,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:26,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981021513] [2024-11-21 23:27:26,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:26,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:26,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:26,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:26,546 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-21 23:27:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:26,566 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-21 23:27:26,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:26,567 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-21 23:27:26,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:26,568 INFO L225 Difference]: With dead ends: 39 [2024-11-21 23:27:26,569 INFO L226 Difference]: Without dead ends: 30 [2024-11-21 23:27:26,569 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-21 23:27:26,570 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-21 23:27:26,570 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-21 23:27:26,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-21 23:27:26,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-21 23:27:26,574 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-21 23:27:26,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 23:27:26,575 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 15 [2024-11-21 23:27:26,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:26,576 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 23:27:26,576 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-21 23:27:26,576 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 23:27:26,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 23:27:26,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:26,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:26,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-21 23:27:26,577 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:26,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1502968870, now seen corresponding path program 1 times [2024-11-21 23:27:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048684336] [2024-11-21 23:27:26,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:26,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:26,688 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-21 23:27:26,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:26,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048684336] [2024-11-21 23:27:26,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048684336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:26,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:26,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:26,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622718183] [2024-11-21 23:27:26,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:26,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:26,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:26,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:26,691 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-21 23:27:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:26,712 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-21 23:27:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:26,712 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-21 23:27:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:26,713 INFO L225 Difference]: With dead ends: 43 [2024-11-21 23:27:26,713 INFO L226 Difference]: Without dead ends: 34 [2024-11-21 23:27:26,713 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-21 23:27:26,714 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-21 23:27:26,715 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-21 23:27:26,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-21 23:27:26,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-21 23:27:26,718 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-21 23:27:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 23:27:26,719 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 16 [2024-11-21 23:27:26,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:26,719 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 23:27:26,719 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-21 23:27:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 23:27:26,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:27:26,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:26,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:26,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-21 23:27:26,720 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:26,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:26,721 INFO L85 PathProgramCache]: Analyzing trace with hash -359796568, now seen corresponding path program 1 times [2024-11-21 23:27:26,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:26,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829301384] [2024-11-21 23:27:26,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:26,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:26,791 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-21 23:27:26,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:26,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829301384] [2024-11-21 23:27:26,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829301384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:26,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:26,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:26,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100763159] [2024-11-21 23:27:26,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:26,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:26,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:26,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:26,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:26,794 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-21 23:27:26,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:26,819 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-21 23:27:26,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:26,820 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-21 23:27:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:26,821 INFO L225 Difference]: With dead ends: 43 [2024-11-21 23:27:26,821 INFO L226 Difference]: Without dead ends: 34 [2024-11-21 23:27:26,821 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-21 23:27:26,822 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-21 23:27:26,822 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-21 23:27:26,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-21 23:27:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-21 23:27:26,829 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-21 23:27:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 23:27:26,829 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2024-11-21 23:27:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:26,830 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 23:27:26,830 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-21 23:27:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 23:27:26,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-21 23:27:26,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:26,832 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-21 23:27:26,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-21 23:27:26,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:26,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash -910833558, now seen corresponding path program 1 times [2024-11-21 23:27:26,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:26,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868188634] [2024-11-21 23:27:26,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:26,924 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-21 23:27:26,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-21 23:27:26,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868188634] [2024-11-21 23:27:26,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868188634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:26,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:26,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:26,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331404471] [2024-11-21 23:27:26,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:26,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-21 23:27:26,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:26,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:26,927 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-21 23:27:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:26,954 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2024-11-21 23:27:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:26,954 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-21 23:27:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:26,958 INFO L225 Difference]: With dead ends: 43 [2024-11-21 23:27:26,958 INFO L226 Difference]: Without dead ends: 34 [2024-11-21 23:27:26,958 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-21 23:27:26,959 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-21 23:27:26,959 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-21 23:27:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-21 23:27:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-21 23:27:26,966 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-21 23:27:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2024-11-21 23:27:26,967 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2024-11-21 23:27:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:26,969 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2024-11-21 23:27:26,969 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-21 23:27:26,969 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2024-11-21 23:27:26,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-21 23:27:26,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:26,970 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-21 23:27:26,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-21 23:27:26,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:26,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:26,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1576679275, now seen corresponding path program 1 times [2024-11-21 23:27:26,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-21 23:27:26,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922748420] [2024-11-21 23:27:26,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:26,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-21 23:27:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:27:27,011 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 23:27:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:27:27,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-21 23:27:27,043 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 23:27:27,044 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 23:27:27,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-21 23:27:27,049 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-21 23:27:27,067 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 23:27:27,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 11:27:27 BoogieIcfgContainer [2024-11-21 23:27:27,073 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 23:27:27,074 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 23:27:27,074 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 23:27:27,075 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 23:27:27,075 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:26" (3/4) ... [2024-11-21 23:27:27,077 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-21 23:27:27,078 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 23:27:27,080 INFO L158 Benchmark]: Toolchain (without parser) took 1613.14ms. Allocated memory is still 163.6MB. Free memory was 96.3MB in the beginning and 128.9MB in the end (delta: -32.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:27,081 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:27,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.90ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 135.9MB in the end (delta: -39.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-21 23:27:27,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.65ms. Allocated memory is still 163.6MB. Free memory was 135.9MB in the beginning and 133.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-21 23:27:27,081 INFO L158 Benchmark]: Boogie Preprocessor took 32.01ms. Allocated memory is still 163.6MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:27,081 INFO L158 Benchmark]: RCFGBuilder took 326.66ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 117.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-21 23:27:27,082 INFO L158 Benchmark]: TraceAbstraction took 976.69ms. Allocated memory is still 163.6MB. Free memory was 116.4MB in the beginning and 128.9MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:27,082 INFO L158 Benchmark]: Witness Printer took 6.09ms. Allocated memory is still 163.6MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:27,083 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 109.1MB. Free memory is still 70.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.90ms. Allocated memory is still 163.6MB. Free memory was 96.1MB in the beginning and 135.9MB in the end (delta: -39.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.65ms. Allocated memory is still 163.6MB. Free memory was 135.9MB in the beginning and 133.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.01ms. Allocated memory is still 163.6MB. Free memory was 133.9MB in the beginning and 131.8MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 326.66ms. Allocated memory is still 163.6MB. Free memory was 131.8MB in the beginning and 117.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 976.69ms. Allocated memory is still 163.6MB. Free memory was 116.4MB in the beginning and 128.9MB in the end (delta: -12.5MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.09ms. Allocated memory is still 163.6MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 87]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someUnaryDOUBLEoperation at line 82. Possible FailurePath: [L81] double x = 0.0; [L82] double y = -0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L26] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=4294967297, msw=2146435073, x=0] [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; VAL [\old(x)=0, \result=0, x=0] [L54] RET, EXPR __fpclassify_double(x) VAL [x=0, y=4294967306] [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; VAL [\result=4294967306, x=0] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=4294967306] [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() VAL [res=4294967306] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, 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.0s 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-21 23:27:27,096 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252b.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 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-21 23:27:28,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-21 23:27:28,930 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-21 23:27:28,935 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-21 23:27:28,936 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-21 23:27:28,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-21 23:27:28,958 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-21 23:27:28,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-21 23:27:28,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-21 23:27:28,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-21 23:27:28,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-21 23:27:28,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-21 23:27:28,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-21 23:27:28,960 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-21 23:27:28,960 INFO L153 SettingsManager]: * Use SBE=true [2024-11-21 23:27:28,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-21 23:27:28,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-21 23:27:28,961 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-21 23:27:28,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-21 23:27:28,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-21 23:27:28,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-21 23:27:28,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-21 23:27:28,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-21 23:27:28,965 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-21 23:27:28,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-21 23:27:28,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-21 23:27:28,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-21 23:27:28,967 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-21 23:27:28,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-21 23:27:28,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-21 23:27:28,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-21 23:27:28,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-21 23:27:28,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-21 23:27:28,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-21 23:27:28,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:27:28,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-21 23:27:28,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-21 23:27:28,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-21 23:27:28,971 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-21 23:27:28,971 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-21 23:27:28,971 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-21 23:27:28,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-21 23:27:28,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-21 23:27:28,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-21 23:27:28,972 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 -> 72e6a731e5f93184d8452e046ba5fa07483889ea5d4b2985d4608011d07f1d55 [2024-11-21 23:27:29,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-21 23:27:29,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-21 23:27:29,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-21 23:27:29,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-21 23:27:29,248 INFO L274 PluginConnector]: CDTParser initialized [2024-11-21 23:27:29,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2024-11-21 23:27:30,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-21 23:27:30,674 INFO L384 CDTParser]: Found 1 translation units. [2024-11-21 23:27:30,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c [2024-11-21 23:27:30,683 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1737aa9a9/5d525eea315140a5916e867dca72ea8d/FLAG84191e560 [2024-11-21 23:27:30,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1737aa9a9/5d525eea315140a5916e867dca72ea8d [2024-11-21 23:27:30,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-21 23:27:30,700 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-21 23:27:30,703 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-21 23:27:30,703 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-21 23:27:30,707 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-21 23:27:30,708 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:30,708 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54608057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30, skipping insertion in model container [2024-11-21 23:27:30,709 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:30,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-21 23:27:30,897 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c[2154,2167] [2024-11-21 23:27:30,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:27:30,914 INFO L200 MainTranslator]: Completed pre-run [2024-11-21 23:27:30,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252b.c[2154,2167] [2024-11-21 23:27:30,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-21 23:27:30,957 INFO L204 MainTranslator]: Completed translation [2024-11-21 23:27:30,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30 WrapperNode [2024-11-21 23:27:30,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-21 23:27:30,959 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-21 23:27:30,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-21 23:27:30,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-21 23:27:30,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:30,974 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:30,991 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-21 23:27:30,992 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-21 23:27:30,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-21 23:27:30,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-21 23:27:30,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-21 23:27:31,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,020 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 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-21 23:27:31,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,030 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-21 23:27:31,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-21 23:27:31,043 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-21 23:27:31,043 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-21 23:27:31,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (1/1) ... [2024-11-21 23:27:31,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-21 23:27:31,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-21 23:27:31,072 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-21 23:27:31,074 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-21 23:27:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-21 23:27:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-21 23:27:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-21 23:27:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-21 23:27:31,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-21 23:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-21 23:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-21 23:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-21 23:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-21 23:27:31,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-21 23:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-21 23:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-21 23:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-21 23:27:31,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-21 23:27:31,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-21 23:27:31,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-21 23:27:31,171 INFO L238 CfgBuilder]: Building ICFG [2024-11-21 23:27:31,173 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-21 23:27:31,384 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-21 23:27:31,384 INFO L287 CfgBuilder]: Performing block encoding [2024-11-21 23:27:31,396 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-21 23:27:31,396 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-21 23:27:31,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:31 BoogieIcfgContainer [2024-11-21 23:27:31,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-21 23:27:31,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-21 23:27:31,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-21 23:27:31,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-21 23:27:31,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:27:30" (1/3) ... [2024-11-21 23:27:31,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b931e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:27:31, skipping insertion in model container [2024-11-21 23:27:31,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:27:30" (2/3) ... [2024-11-21 23:27:31,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b931e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:27:31, skipping insertion in model container [2024-11-21 23:27:31,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:31" (3/3) ... [2024-11-21 23:27:31,406 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252b.c [2024-11-21 23:27:31,420 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-21 23:27:31,421 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-21 23:27:31,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-21 23:27:31,478 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;@2d5d8fba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-21 23:27:31,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-21 23:27:31,482 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-21 23:27:31,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-21 23:27:31,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:31,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:31,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:31,496 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-21 23:27:31,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:31,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588954916] [2024-11-21 23:27:31,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:31,507 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-21 23:27:31,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:31,510 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-21 23:27:31,511 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-21 23:27:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:31,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-21 23:27:31,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:31,593 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-21 23:27:31,593 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:31,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588954916] [2024-11-21 23:27:31,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588954916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:31,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:31,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-21 23:27:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096136206] [2024-11-21 23:27:31,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:31,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-21 23:27:31,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:31,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-21 23:27:31,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-21 23:27:31,618 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-21 23:27:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:31,630 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-21 23:27:31,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-21 23:27:31,632 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-21 23:27:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:31,643 INFO L225 Difference]: With dead ends: 51 [2024-11-21 23:27:31,644 INFO L226 Difference]: Without dead ends: 24 [2024-11-21 23:27:31,645 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-21 23:27:31,648 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-21 23:27:31,648 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-21 23:27:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-21 23:27:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-21 23:27:31,671 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-21 23:27:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-21 23:27:31,673 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-21 23:27:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:31,674 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-21 23:27:31,674 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-21 23:27:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-21 23:27:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-21 23:27:31,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:31,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:31,680 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-21 23:27:31,878 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-21 23:27:31,878 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:31,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-21 23:27:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:31,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25372122] [2024-11-21 23:27:31,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:31,880 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-21 23:27:31,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:31,882 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-21 23:27:31,883 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-21 23:27:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:31,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:31,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:31,995 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-21 23:27:31,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:31,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:31,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25372122] [2024-11-21 23:27:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25372122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:31,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:31,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:31,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415765434] [2024-11-21 23:27:31,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:31,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:31,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:31,999 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-21 23:27:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:32,251 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2024-11-21 23:27:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:32,252 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-21 23:27:32,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:32,253 INFO L225 Difference]: With dead ends: 36 [2024-11-21 23:27:32,253 INFO L226 Difference]: Without dead ends: 27 [2024-11-21 23:27:32,254 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-21 23:27:32,254 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:32,255 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.2s Time] [2024-11-21 23:27:32,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-21 23:27:32,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-21 23:27:32,260 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-21 23:27:32,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-21 23:27:32,262 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-21 23:27:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:32,263 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-21 23:27:32,263 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-21 23:27:32,263 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-21 23:27:32,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-21 23:27:32,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:32,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:32,268 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-21 23:27:32,464 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-21 23:27:32,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:32,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash -943857557, now seen corresponding path program 1 times [2024-11-21 23:27:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:32,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033878370] [2024-11-21 23:27:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:32,467 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-21 23:27:32,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:32,470 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-21 23:27:32,470 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-21 23:27:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:32,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-21 23:27:32,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:32,720 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-21 23:27:32,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:32,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:32,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033878370] [2024-11-21 23:27:32,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033878370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:32,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:32,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:27:32,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303830343] [2024-11-21 23:27:32,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:32,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 23:27:32,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:32,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 23:27:32,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:27:32,723 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-21 23:27:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:33,038 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2024-11-21 23:27:33,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 23:27:33,040 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-21 23:27:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:33,041 INFO L225 Difference]: With dead ends: 53 [2024-11-21 23:27:33,041 INFO L226 Difference]: Without dead ends: 30 [2024-11-21 23:27:33,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-21 23:27:33,042 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:33,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 77 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 23:27:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-21 23:27:33,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2024-11-21 23:27:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 23:27:33,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-21 23:27:33,049 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2024-11-21 23:27:33,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:33,050 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-21 23:27:33,050 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-21 23:27:33,050 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-21 23:27:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-21 23:27:33,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:33,050 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:33,054 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-21 23:27:33,254 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-21 23:27:33,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:33,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:33,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1221479789, now seen corresponding path program 1 times [2024-11-21 23:27:33,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:33,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533366297] [2024-11-21 23:27:33,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:33,256 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-21 23:27:33,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:33,259 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-21 23:27:33,260 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-21 23:27:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:33,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:33,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:33,319 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-21 23:27:33,320 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:33,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:33,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533366297] [2024-11-21 23:27:33,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533366297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:33,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:33,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:33,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486607026] [2024-11-21 23:27:33,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:33,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:33,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:33,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:33,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:33,327 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:27:33,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:33,366 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2024-11-21 23:27:33,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:33,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-21 23:27:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:33,369 INFO L225 Difference]: With dead ends: 41 [2024-11-21 23:27:33,369 INFO L226 Difference]: Without dead ends: 32 [2024-11-21 23:27:33,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:33,370 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:33,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-21 23:27:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-21 23:27:33,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-21 23:27:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 23:27:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-11-21 23:27:33,376 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 16 [2024-11-21 23:27:33,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:33,377 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-11-21 23:27:33,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-21 23:27:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-11-21 23:27:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-21 23:27:33,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:33,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:33,384 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-21 23:27:33,578 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-21 23:27:33,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:33,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:33,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1991232473, now seen corresponding path program 1 times [2024-11-21 23:27:33,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:33,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136667391] [2024-11-21 23:27:33,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:33,580 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-21 23:27:33,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:33,581 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-21 23:27:33,581 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-21 23:27:33,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:33,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-21 23:27:33,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:33,739 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-21 23:27:33,739 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:33,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:33,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136667391] [2024-11-21 23:27:33,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136667391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:33,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:33,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:27:33,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881480669] [2024-11-21 23:27:33,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:33,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 23:27:33,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:33,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 23:27:33,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:27:33,742 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-21 23:27:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:33,958 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2024-11-21 23:27:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 23:27:33,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-21 23:27:33,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:33,960 INFO L225 Difference]: With dead ends: 53 [2024-11-21 23:27:33,960 INFO L226 Difference]: Without dead ends: 28 [2024-11-21 23:27:33,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-21 23:27:33,961 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 14 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:33,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 73 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-21 23:27:33,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-21 23:27:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2024-11-21 23:27:33,966 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-21 23:27:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-21 23:27:33,967 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 17 [2024-11-21 23:27:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:33,967 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-21 23:27:33,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 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-21 23:27:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-21 23:27:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-21 23:27:33,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:33,968 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:33,973 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-21 23:27:34,168 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-21 23:27:34,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:34,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:34,169 INFO L85 PathProgramCache]: Analyzing trace with hash -941704498, now seen corresponding path program 1 times [2024-11-21 23:27:34,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315603483] [2024-11-21 23:27:34,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:34,170 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-21 23:27:34,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:34,172 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-21 23:27:34,172 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-21 23:27:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:34,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:34,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:34,264 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-21 23:27:34,265 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:34,265 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315603483] [2024-11-21 23:27:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315603483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:34,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876824352] [2024-11-21 23:27:34,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:34,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:34,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:34,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:34,266 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-21 23:27:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:34,305 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-21 23:27:34,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:34,305 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-21 23:27:34,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:34,306 INFO L225 Difference]: With dead ends: 38 [2024-11-21 23:27:34,306 INFO L226 Difference]: Without dead ends: 29 [2024-11-21 23:27:34,306 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-21 23:27:34,306 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-21 23:27:34,307 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-21 23:27:34,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-21 23:27:34,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-21 23:27:34,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 23:27:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-11-21 23:27:34,311 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 22 [2024-11-21 23:27:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:34,311 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-11-21 23:27:34,311 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-21 23:27:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-11-21 23:27:34,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-21 23:27:34,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:34,312 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:34,316 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-21 23:27:34,512 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-21 23:27:34,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:34,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:34,513 INFO L85 PathProgramCache]: Analyzing trace with hash -939857456, now seen corresponding path program 1 times [2024-11-21 23:27:34,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:34,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074854638] [2024-11-21 23:27:34,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:34,514 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-21 23:27:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:34,528 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-21 23:27:34,529 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-21 23:27:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:34,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 23:27:34,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:34,638 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-21 23:27:34,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:34,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:34,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074854638] [2024-11-21 23:27:34,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074854638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:34,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:34,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-21 23:27:34,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335830089] [2024-11-21 23:27:34,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:34,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-21 23:27:34,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-21 23:27:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-21 23:27:34,640 INFO L87 Difference]: Start difference. First operand 29 states and 36 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-21 23:27:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:34,674 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-11-21 23:27:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-21 23:27:34,678 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-21 23:27:34,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:34,679 INFO L225 Difference]: With dead ends: 34 [2024-11-21 23:27:34,679 INFO L226 Difference]: Without dead ends: 31 [2024-11-21 23:27:34,679 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-21 23:27:34,680 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-21 23:27:34,680 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-21 23:27:34,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-21 23:27:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-21 23:27:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.24) internal successors, (31), 26 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 23:27:34,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-11-21 23:27:34,683 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 22 [2024-11-21 23:27:34,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:34,684 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-11-21 23:27:34,684 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-21 23:27:34,684 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-11-21 23:27:34,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-21 23:27:34,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:34,688 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-21 23:27:34,693 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 (8)] Forceful destruction successful, exit code 0 [2024-11-21 23:27:34,888 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-21 23:27:34,889 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:34,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1022935030, now seen corresponding path program 1 times [2024-11-21 23:27:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1067292643] [2024-11-21 23:27:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:34,890 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-21 23:27:34,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:34,894 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:27:34,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-21 23:27:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:34,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 23:27:34,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:35,071 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-21 23:27:35,071 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:35,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:35,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1067292643] [2024-11-21 23:27:35,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1067292643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:35,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:35,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:27:35,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611056223] [2024-11-21 23:27:35,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:35,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 23:27:35,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:35,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 23:27:35,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:27:35,073 INFO L87 Difference]: Start difference. First operand 31 states and 38 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-21 23:27:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:35,208 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-11-21 23:27:35,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-21 23:27:35,209 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-21 23:27:35,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:35,211 INFO L225 Difference]: With dead ends: 45 [2024-11-21 23:27:35,211 INFO L226 Difference]: Without dead ends: 31 [2024-11-21 23:27:35,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-21 23:27:35,212 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:35,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 81 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 23:27:35,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-21 23:27:35,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-21 23:27:35,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.2) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-21 23:27:35,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-21 23:27:35,219 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 23 [2024-11-21 23:27:35,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:35,220 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-21 23:27:35,220 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-21 23:27:35,220 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-21 23:27:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-21 23:27:35,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:35,221 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:35,229 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 (9)] Ended with exit code 0 [2024-11-21 23:27:35,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:35,422 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:35,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:35,422 INFO L85 PathProgramCache]: Analyzing trace with hash 178525002, now seen corresponding path program 1 times [2024-11-21 23:27:35,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:35,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519584938] [2024-11-21 23:27:35,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:35,423 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-21 23:27:35,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:35,425 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:27:35,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-21 23:27:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:35,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-21 23:27:35,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:35,499 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-21 23:27:35,499 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:35,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:35,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519584938] [2024-11-21 23:27:35,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519584938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:35,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:35,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-21 23:27:35,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508629664] [2024-11-21 23:27:35,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:35,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-21 23:27:35,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:35,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-21 23:27:35,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:35,502 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 23:27:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:35,580 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-11-21 23:27:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-21 23:27:35,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2024-11-21 23:27:35,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:35,581 INFO L225 Difference]: With dead ends: 41 [2024-11-21 23:27:35,581 INFO L226 Difference]: Without dead ends: 32 [2024-11-21 23:27:35,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-21 23:27:35,582 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:35,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-21 23:27:35,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-21 23:27:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-11-21 23:27:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 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-21 23:27:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-11-21 23:27:35,586 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 24 [2024-11-21 23:27:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:35,586 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-11-21 23:27:35,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 23:27:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-11-21 23:27:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-21 23:27:35,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:35,587 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:35,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-21 23:27:35,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:35,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:35,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:35,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1847075342, now seen corresponding path program 1 times [2024-11-21 23:27:35,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:35,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778493943] [2024-11-21 23:27:35,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:35,788 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-21 23:27:35,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:35,790 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:27:35,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-21 23:27:35,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-21 23:27:35,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-21 23:27:35,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-21 23:27:35,955 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-21 23:27:35,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-21 23:27:35,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-21 23:27:35,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778493943] [2024-11-21 23:27:35,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778493943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-21 23:27:35,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-21 23:27:35,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-21 23:27:35,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356600715] [2024-11-21 23:27:35,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-21 23:27:35,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-21 23:27:35,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-21 23:27:35,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-21 23:27:35,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-21 23:27:35,957 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 23:27:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-21 23:27:36,507 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-21 23:27:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-21 23:27:36,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-21 23:27:36,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-21 23:27:36,508 INFO L225 Difference]: With dead ends: 38 [2024-11-21 23:27:36,508 INFO L226 Difference]: Without dead ends: 23 [2024-11-21 23:27:36,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 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-21 23:27:36,509 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 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.5s IncrementalHoareTripleChecker+Time [2024-11-21 23:27:36,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-21 23:27:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-11-21 23:27:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2024-11-21 23:27:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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-21 23:27:36,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2024-11-21 23:27:36,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 25 [2024-11-21 23:27:36,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-21 23:27:36,512 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2024-11-21 23:27:36,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-21 23:27:36,512 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2024-11-21 23:27:36,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-21 23:27:36,512 INFO L207 NwaCegarLoop]: Found error trace [2024-11-21 23:27:36,512 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-21 23:27:36,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-21 23:27:36,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:36,713 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-21 23:27:36,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-21 23:27:36,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-21 23:27:36,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-21 23:27:36,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406295398] [2024-11-21 23:27:36,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-21 23:27:36,714 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-21 23:27:36,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-21 23:27:36,715 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-21 23:27:36,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-21 23:27:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:27:36,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-21 23:27:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-21 23:27:36,849 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-21 23:27:36,850 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-21 23:27:36,850 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-21 23:27:36,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-21 23:27:37,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-21 23:27:37,055 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-21 23:27:37,077 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-21 23:27:37,080 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 11:27:37 BoogieIcfgContainer [2024-11-21 23:27:37,080 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-21 23:27:37,080 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-21 23:27:37,080 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-21 23:27:37,081 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-21 23:27:37,081 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:27:31" (3/4) ... [2024-11-21 23:27:37,081 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-21 23:27:37,130 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-21 23:27:37,130 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-21 23:27:37,130 INFO L158 Benchmark]: Toolchain (without parser) took 6429.91ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 38.0MB in the beginning and 46.7MB in the end (delta: -8.7MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2024-11-21 23:27:37,130 INFO L158 Benchmark]: CDTParser took 1.40ms. Allocated memory is still 52.4MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-21 23:27:37,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.03ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 42.0MB in the end (delta: -4.2MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-11-21 23:27:37,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.19ms. Allocated memory is still 67.1MB. Free memory was 42.0MB in the beginning and 40.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:27:37,131 INFO L158 Benchmark]: Boogie Preprocessor took 46.35ms. Allocated memory is still 67.1MB. Free memory was 40.3MB in the beginning and 37.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:27:37,132 INFO L158 Benchmark]: RCFGBuilder took 357.24ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 41.8MB in the end (delta: -3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-21 23:27:37,132 INFO L158 Benchmark]: TraceAbstraction took 5679.99ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 41.2MB in the beginning and 49.4MB in the end (delta: -8.2MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-11-21 23:27:37,132 INFO L158 Benchmark]: Witness Printer took 49.27ms. Allocated memory is still 81.8MB. Free memory was 49.4MB in the beginning and 46.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-21 23:27:37,133 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40ms. Allocated memory is still 52.4MB. Free memory is still 35.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.03ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 42.0MB in the end (delta: -4.2MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.19ms. Allocated memory is still 67.1MB. Free memory was 42.0MB in the beginning and 40.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.35ms. Allocated memory is still 67.1MB. Free memory was 40.3MB in the beginning and 37.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 357.24ms. Allocated memory is still 67.1MB. Free memory was 37.9MB in the beginning and 41.8MB in the end (delta: -3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5679.99ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 41.2MB in the beginning and 49.4MB in the end (delta: -8.2MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Witness Printer took 49.27ms. Allocated memory is still 81.8MB. Free memory was 49.4MB in the beginning and 46.7MB in the end (delta: 2.7MB). 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 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L81] double x = 0.0; [L82] double y = -0.0; [L83] CALL, EXPR fmax_double(x, y) [L54] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0.0] [L26] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L37] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L54] RET, EXPR __fpclassify_double(x) VAL [x=0.0, y=0.0] [L54] COND FALSE !(__fpclassify_double(x) == 0) [L56] CALL, EXPR __fpclassify_double(y) VAL [\old(x)=0.0] [L26] __uint32_t msw, lsw; VAL [\old(x)=0.0, x=0.0] [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND TRUE (msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000) [L37] return 2; VAL [\old(x)=0.0, \result=2, x=0.0] [L56] RET, EXPR __fpclassify_double(y) VAL [x=0.0, y=0.0] [L56] COND FALSE !(__fpclassify_double(y) == 0) [L59] return x > y ? x : y; VAL [\result=0.0] [L83] RET, EXPR fmax_double(x, y) [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=0.0] [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] CALL, EXPR __signbit_double(res) [L63] __uint32_t msw; VAL [x=0.0] [L66] ieee_double_shape_type gh_u; [L67] gh_u.value = (x) [L68] EXPR gh_u.parts.msw [L68] (msw) = gh_u.parts.msw [L71] return (msw & 0x80000000) != 0; VAL [\result=1, x=0.0] [L86] RET, EXPR __signbit_double(res) [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L87] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.6s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 55 mSDsluCounter, 766 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 507 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 283 IncrementalHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 259 mSDtfsCounter, 283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=7, InterpolantAutomatonStates: 49, 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, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 181 ConstructedInterpolants, 24 QuantifiedInterpolants, 755 SizeOfPredicates, 15 NumberOfNonLiveVariables, 680 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 30/30 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 proved your program to be incorrect! [2024-11-21 23:27:37,161 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE