./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 04c436006742f36e09d723f85653028f787f4ee63bf5ff6f9895b53f3ce3aea9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:49:22,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:49:22,895 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 00:49:22,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:49:22,899 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:49:22,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:49:22,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:49:22,919 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:49:22,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:49:22,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:49:22,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:49:22,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:49:22,923 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:49:22,923 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:49:22,924 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:49:22,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:49:22,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:49:22,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:49:22,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 00:49:22,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:49:22,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:49:22,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:49:22,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:49:22,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:49:22,927 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:49:22,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:49:22,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:49:22,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:49:22,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:49:22,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:49:22,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:49:22,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:49:22,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:49:22,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:49:22,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:49:22,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:49:22,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 00:49:22,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 00:49:22,930 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:49:22,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:49:22,930 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:49:22,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:49:22,930 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-clean/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-clean/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 -> 04c436006742f36e09d723f85653028f787f4ee63bf5ff6f9895b53f3ce3aea9 [2024-10-11 00:49:23,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:49:23,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:49:23,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:49:23,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:49:23,158 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:49:23,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c [2024-10-11 00:49:24,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:49:24,771 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:49:24,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c [2024-10-11 00:49:24,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb3fce96c/da4a9ede247a4bc4bb638aa6a84cd4fb/FLAG32b8a897d [2024-10-11 00:49:24,795 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/fb3fce96c/da4a9ede247a4bc4bb638aa6a84cd4fb [2024-10-11 00:49:24,797 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:49:24,798 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:49:24,801 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:49:24,801 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:49:24,805 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:49:24,806 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:49:24" (1/1) ... [2024-10-11 00:49:24,807 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a069d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:24, skipping insertion in model container [2024-10-11 00:49:24,807 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:49:24" (1/1) ... [2024-10-11 00:49:24,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:49:24,978 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c[1571,1584] [2024-10-11 00:49:24,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:49:24,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:49:25,012 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c[1571,1584] [2024-10-11 00:49:25,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:49:25,028 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:49:25,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25 WrapperNode [2024-10-11 00:49:25,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:49:25,032 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:49:25,032 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:49:25,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:49:25,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,048 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,065 INFO L138 Inliner]: procedures = 16, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2024-10-11 00:49:25,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:49:25,066 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:49:25,066 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:49:25,066 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:49:25,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,098 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-10-11 00:49:25,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,108 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,115 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,122 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:49:25,123 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:49:25,123 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:49:25,123 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:49:25,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (1/1) ... [2024-10-11 00:49:25,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:49:25,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:49:25,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:49:25,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:49:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:49:25,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 00:49:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 00:49:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 00:49:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 00:49:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 00:49:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 00:49:25,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 00:49:25,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 00:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 00:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 00:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 00:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 00:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 00:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 00:49:25,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 00:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 00:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 00:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 00:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 00:49:25,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 00:49:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 00:49:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:49:25,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:49:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 00:49:25,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 00:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 00:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 00:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 00:49:25,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 00:49:25,279 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:49:25,281 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:49:25,588 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-11 00:49:25,588 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:49:25,626 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:49:25,626 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 00:49:25,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:49:25 BoogieIcfgContainer [2024-10-11 00:49:25,626 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:49:25,628 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:49:25,628 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:49:25,631 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:49:25,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:49:24" (1/3) ... [2024-10-11 00:49:25,631 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688545d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:49:25, skipping insertion in model container [2024-10-11 00:49:25,631 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:25" (2/3) ... [2024-10-11 00:49:25,632 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@688545d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:49:25, skipping insertion in model container [2024-10-11 00:49:25,632 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:49:25" (3/3) ... [2024-10-11 00:49:25,633 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1072c.c [2024-10-11 00:49:25,650 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:49:25,654 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:49:25,722 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:49:25,735 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;@6907cac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:49:25,739 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:49:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:25,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 00:49:25,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:49:25,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:49:25,753 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:49:25,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:49:25,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1966779604, now seen corresponding path program 1 times [2024-10-11 00:49:25,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:49:25,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428257953] [2024-10-11 00:49:25,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:49:25,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:49:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:49:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:49:25,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:49:25,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428257953] [2024-10-11 00:49:25,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428257953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:49:25,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:49:25,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:49:25,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521319057] [2024-10-11 00:49:25,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:49:25,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:49:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:49:25,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:49:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:49:25,920 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:49:25,948 INFO L93 Difference]: Finished difference Result 69 states and 107 transitions. [2024-10-11 00:49:25,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:49:25,950 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 00:49:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:49:25,956 INFO L225 Difference]: With dead ends: 69 [2024-10-11 00:49:25,956 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 00:49:25,959 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-10-11 00:49:25,964 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:49:25,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:49:25,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 00:49:25,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 00:49:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-10-11 00:49:25,997 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 11 [2024-10-11 00:49:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:49:25,997 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-10-11 00:49:25,998 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-10-11 00:49:25,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 00:49:25,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:49:25,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:49:26,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 00:49:26,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:49:26,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:49:26,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2117834747, now seen corresponding path program 1 times [2024-10-11 00:49:26,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:49:26,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563630242] [2024-10-11 00:49:26,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:49:26,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:49:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:49:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:49:26,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:49:26,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563630242] [2024-10-11 00:49:26,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563630242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:49:26,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:49:26,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:49:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439567707] [2024-10-11 00:49:26,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:49:26,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:49:26,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:49:26,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:49:26,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:49:26,138 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:49:26,170 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-10-11 00:49:26,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:49:26,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 00:49:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:49:26,171 INFO L225 Difference]: With dead ends: 57 [2024-10-11 00:49:26,171 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 00:49:26,171 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-10-11 00:49:26,172 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:49:26,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 103 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:49:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 00:49:26,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-11 00:49:26,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:26,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 46 transitions. [2024-10-11 00:49:26,176 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 46 transitions. Word has length 12 [2024-10-11 00:49:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:49:26,177 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 46 transitions. [2024-10-11 00:49:26,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2024-10-11 00:49:26,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 00:49:26,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:49:26,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:49:26,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 00:49:26,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:49:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:49:26,179 INFO L85 PathProgramCache]: Analyzing trace with hash 789844622, now seen corresponding path program 1 times [2024-10-11 00:49:26,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:49:26,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550989909] [2024-10-11 00:49:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:49:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:49:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:49:26,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:49:26,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 00:49:26,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550989909] [2024-10-11 00:49:26,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550989909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:49:26,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:49:26,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:49:26,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464176280] [2024-10-11 00:49:26,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:49:26,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 00:49:26,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 00:49:26,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 00:49:26,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 00:49:26,260 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:26,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:49:26,287 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2024-10-11 00:49:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 00:49:26,288 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 00:49:26,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:49:26,289 INFO L225 Difference]: With dead ends: 46 [2024-10-11 00:49:26,290 INFO L226 Difference]: Without dead ends: 38 [2024-10-11 00:49:26,291 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-10-11 00:49:26,292 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:49:26,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 80 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:49:26,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-11 00:49:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-11 00:49:26,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2024-10-11 00:49:26,300 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 13 [2024-10-11 00:49:26,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:49:26,300 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2024-10-11 00:49:26,300 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2024-10-11 00:49:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 00:49:26,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:49:26,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:49:26,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 00:49:26,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:49:26,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:49:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1229808801, now seen corresponding path program 1 times [2024-10-11 00:49:26,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 00:49:26,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692110482] [2024-10-11 00:49:26,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:49:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 00:49:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:49:26,345 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 00:49:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 00:49:26,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 00:49:26,375 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 00:49:26,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:49:26,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 00:49:26,379 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 00:49:26,392 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:49:26,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:49:26 BoogieIcfgContainer [2024-10-11 00:49:26,395 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:49:26,396 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:49:26,396 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:49:26,396 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:49:26,396 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:49:25" (3/4) ... [2024-10-11 00:49:26,398 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 00:49:26,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:49:26,399 INFO L158 Benchmark]: Toolchain (without parser) took 1600.71ms. Allocated memory is still 203.4MB. Free memory was 136.5MB in the beginning and 112.3MB in the end (delta: 24.2MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2024-10-11 00:49:26,399 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 115.3MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:49:26,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.52ms. Allocated memory is still 203.4MB. Free memory was 136.5MB in the beginning and 123.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 00:49:26,400 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.73ms. Allocated memory is still 203.4MB. Free memory was 123.6MB in the beginning and 121.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:49:26,400 INFO L158 Benchmark]: Boogie Preprocessor took 56.00ms. Allocated memory is still 203.4MB. Free memory was 121.8MB in the beginning and 119.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:49:26,400 INFO L158 Benchmark]: RCFGBuilder took 503.52ms. Allocated memory is still 203.4MB. Free memory was 119.1MB in the beginning and 166.8MB in the end (delta: -47.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-11 00:49:26,401 INFO L158 Benchmark]: TraceAbstraction took 767.53ms. Allocated memory is still 203.4MB. Free memory was 165.8MB in the beginning and 112.3MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. [2024-10-11 00:49:26,401 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 203.4MB. Free memory is still 112.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:49:26,402 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.12ms. Allocated memory is still 115.3MB. Free memory is still 78.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.52ms. Allocated memory is still 203.4MB. Free memory was 136.5MB in the beginning and 123.6MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.73ms. Allocated memory is still 203.4MB. Free memory was 123.6MB in the beginning and 121.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.00ms. Allocated memory is still 203.4MB. Free memory was 121.8MB in the beginning and 119.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.52ms. Allocated memory is still 203.4MB. Free memory was 119.1MB in the beginning and 166.8MB in the end (delta: -47.8MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * TraceAbstraction took 767.53ms. Allocated memory is still 203.4MB. Free memory was 165.8MB in the beginning and 112.3MB in the end (delta: 53.5MB). Peak memory consumption was 52.4MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 203.4MB. Free memory is still 112.3MB. 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: 69]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 68. Possible FailurePath: [L64] float x = 0.0f; [L65] CALL, EXPR trunc_float(x) [L15] __int32_t signbit, w, exponent_less_127; VAL [x=0] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (w) = gf_u.word [L21] signbit = w & 0x80000000 VAL [signbit=0, w=2139095040, x=0] [L22] EXPR w & 0x7f800000 VAL [signbit=0, w=2139095040, x=0] [L22] exponent_less_127 = ((w & 0x7f800000) >> 23) - 127 [L23] COND FALSE !(exponent_less_127 < 23) [L39] COND FALSE !(exponent_less_127 == 255) VAL [signbit=0, w=2139095040, x=0] [L42] return x; VAL [\result=0, signbit=0, w=2139095040] [L65] RET, EXPR trunc_float(x) [L65] float res = trunc_float(x); [L68] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [res=0] [L68] EXPR res == 0.0f && __signbit_float(res) == 0 [L68] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L69] reach_error() VAL [res=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 225 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 114 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=2, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-10-11 00:49:26,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 04c436006742f36e09d723f85653028f787f4ee63bf5ff6f9895b53f3ce3aea9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 00:49:29,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 00:49:29,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 00:49:29,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 00:49:29,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 00:49:29,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 00:49:29,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 00:49:29,189 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 00:49:29,189 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 00:49:29,192 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 00:49:29,193 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 00:49:29,193 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 00:49:29,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 00:49:29,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 00:49:29,194 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 00:49:29,194 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 00:49:29,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 00:49:29,194 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 00:49:29,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 00:49:29,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 00:49:29,195 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 00:49:29,198 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 00:49:29,199 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 00:49:29,199 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 00:49:29,199 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 00:49:29,199 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 00:49:29,199 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 00:49:29,199 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 00:49:29,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 00:49:29,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 00:49:29,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 00:49:29,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 00:49:29,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 00:49:29,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 00:49:29,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:49:29,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 00:49:29,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 00:49:29,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 00:49:29,204 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 00:49:29,205 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 00:49:29,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 00:49:29,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 00:49:29,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 00:49:29,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 00:49:29,208 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 00:49:29,208 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-clean/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-clean/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 -> 04c436006742f36e09d723f85653028f787f4ee63bf5ff6f9895b53f3ce3aea9 [2024-10-11 00:49:29,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 00:49:29,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 00:49:29,544 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 00:49:29,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 00:49:29,545 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 00:49:29,547 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c [2024-10-11 00:49:30,925 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 00:49:31,081 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 00:49:31,082 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c [2024-10-11 00:49:31,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c737f641/251491cffaff4b9ab54ab289f37edeb3/FLAG0e0328610 [2024-10-11 00:49:31,133 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9c737f641/251491cffaff4b9ab54ab289f37edeb3 [2024-10-11 00:49:31,135 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 00:49:31,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 00:49:31,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 00:49:31,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 00:49:31,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 00:49:31,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60b4c233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31, skipping insertion in model container [2024-10-11 00:49:31,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 00:49:31,328 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c[1571,1584] [2024-10-11 00:49:31,331 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:49:31,345 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 00:49:31,367 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1072c.c[1571,1584] [2024-10-11 00:49:31,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 00:49:31,386 INFO L204 MainTranslator]: Completed translation [2024-10-11 00:49:31,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31 WrapperNode [2024-10-11 00:49:31,386 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 00:49:31,387 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 00:49:31,387 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 00:49:31,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 00:49:31,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,427 INFO L138 Inliner]: procedures = 19, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2024-10-11 00:49:31,428 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 00:49:31,428 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 00:49:31,429 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 00:49:31,429 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 00:49:31,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,455 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-10-11 00:49:31,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,468 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,469 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 00:49:31,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 00:49:31,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 00:49:31,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 00:49:31,472 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (1/1) ... [2024-10-11 00:49:31,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 00:49:31,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 00:49:31,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 00:49:31,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 00:49:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 00:49:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 00:49:31,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 00:49:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-11 00:49:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-11 00:49:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-10-11 00:49:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 00:49:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-10-11 00:49:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-10-11 00:49:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-10-11 00:49:31,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-10-11 00:49:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-10-11 00:49:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 00:49:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 00:49:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-11 00:49:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-11 00:49:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-10-11 00:49:31,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 00:49:31,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 00:49:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-10-11 00:49:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-10-11 00:49:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-10-11 00:49:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-10-11 00:49:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-10-11 00:49:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 00:49:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 00:49:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-11 00:49:31,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-11 00:49:31,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-10-11 00:49:31,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 00:49:31,634 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 00:49:31,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 00:49:31,814 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 00:49:31,815 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 00:49:31,843 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 00:49:31,844 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-11 00:49:31,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:49:31 BoogieIcfgContainer [2024-10-11 00:49:31,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 00:49:31,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 00:49:31,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 00:49:31,850 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 00:49:31,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:49:31" (1/3) ... [2024-10-11 00:49:31,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39feff44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:49:31, skipping insertion in model container [2024-10-11 00:49:31,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:49:31" (2/3) ... [2024-10-11 00:49:31,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39feff44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:49:31, skipping insertion in model container [2024-10-11 00:49:31,852 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:49:31" (3/3) ... [2024-10-11 00:49:31,853 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1072c.c [2024-10-11 00:49:31,867 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 00:49:31,867 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 00:49:31,923 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 00:49:31,928 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;@4acab571, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 00:49:31,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 00:49:31,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 00:49:31,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:49:31,942 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:49:31,942 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:49:31,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:49:31,950 INFO L85 PathProgramCache]: Analyzing trace with hash -891617069, now seen corresponding path program 1 times [2024-10-11 00:49:31,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:49:31,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131776775] [2024-10-11 00:49:31,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:49:31,961 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-10-11 00:49:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:49:31,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 00:49:31,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:49:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:49:32,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 00:49:32,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:49:32,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:49:32,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:49:32,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:49:32,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131776775] [2024-10-11 00:49:32,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131776775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:49:32,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:49:32,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 00:49:32,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12800779] [2024-10-11 00:49:32,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:49:32,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 00:49:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:49:32,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 00:49:32,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 00:49:32,095 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:49:32,129 INFO L93 Difference]: Finished difference Result 43 states and 67 transitions. [2024-10-11 00:49:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 00:49:32,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 00:49:32,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:49:32,139 INFO L225 Difference]: With dead ends: 43 [2024-10-11 00:49:32,139 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 00:49:32,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-10-11 00:49:32,145 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:49:32,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:49:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 00:49:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 00:49:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-10-11 00:49:32,177 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 9 [2024-10-11 00:49:32,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:49:32,177 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-10-11 00:49:32,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-10-11 00:49:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 00:49:32,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:49:32,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:49:32,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 00:49:32,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 00:49:32,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:49:32,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:49:32,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1865421930, now seen corresponding path program 1 times [2024-10-11 00:49:32,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:49:32,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256645454] [2024-10-11 00:49:32,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:49:32,387 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-10-11 00:49:32,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:49:32,390 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 00:49:32,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:49:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:49:32,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 00:49:32,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:49:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:49:32,583 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:49:32,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:49:32,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256645454] [2024-10-11 00:49:32,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256645454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:49:32,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:49:32,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 00:49:32,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005719429] [2024-10-11 00:49:32,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:49:32,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 00:49:32,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:49:32,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 00:49:32,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 00:49:32,586 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:49:32,661 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-10-11 00:49:32,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 00:49:32,662 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 00:49:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:49:32,662 INFO L225 Difference]: With dead ends: 29 [2024-10-11 00:49:32,663 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 00:49:32,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:49:32,664 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:49:32,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 34 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:49:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 00:49:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-11 00:49:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2024-10-11 00:49:32,670 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2024-10-11 00:49:32,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:49:32,670 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2024-10-11 00:49:32,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2024-10-11 00:49:32,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 00:49:32,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:49:32,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:49:32,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:49:32,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 00:49:32,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:49:32,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:49:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1556484116, now seen corresponding path program 1 times [2024-10-11 00:49:32,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:49:32,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114576376] [2024-10-11 00:49:32,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:49:32,876 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-10-11 00:49:32,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:49:32,901 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 00:49:32,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:49:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:49:32,951 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 00:49:32,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:49:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:49:33,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:49:33,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:49:33,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114576376] [2024-10-11 00:49:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2114576376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:49:33,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:49:33,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 00:49:33,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716477157] [2024-10-11 00:49:33,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:49:33,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 00:49:33,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:49:33,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 00:49:33,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 00:49:33,104 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:33,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:49:33,169 INFO L93 Difference]: Finished difference Result 20 states and 19 transitions. [2024-10-11 00:49:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 00:49:33,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 00:49:33,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:49:33,170 INFO L225 Difference]: With dead ends: 20 [2024-10-11 00:49:33,170 INFO L226 Difference]: Without dead ends: 17 [2024-10-11 00:49:33,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-11 00:49:33,171 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 14 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 00:49:33,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 00:49:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-11 00:49:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2024-10-11 00:49:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0) internal successors, (16), 16 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 16 transitions. [2024-10-11 00:49:33,174 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 16 transitions. Word has length 13 [2024-10-11 00:49:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:49:33,174 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 16 transitions. [2024-10-11 00:49:33,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 16 transitions. [2024-10-11 00:49:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 00:49:33,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 00:49:33,175 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 00:49:33,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:49:33,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 00:49:33,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 00:49:33,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 00:49:33,377 INFO L85 PathProgramCache]: Analyzing trace with hash 248650679, now seen corresponding path program 1 times [2024-10-11 00:49:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 00:49:33,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630181820] [2024-10-11 00:49:33,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 00:49:33,378 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-10-11 00:49:33,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 00:49:33,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-11 00:49:33,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 00:49:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 00:49:33,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-11 00:49:33,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 00:49:33,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 00:49:33,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-11 00:49:33,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 00:49:33,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-10-11 00:49:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 00:49:33,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 00:49:33,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 00:49:33,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630181820] [2024-10-11 00:49:33,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630181820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 00:49:33,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 00:49:33,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 00:49:33,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402616] [2024-10-11 00:49:33,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 00:49:33,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 00:49:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 00:49:33,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 00:49:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 00:49:33,636 INFO L87 Difference]: Start difference. First operand 17 states and 16 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 00:49:33,774 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2024-10-11 00:49:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 00:49:33,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 00:49:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 00:49:33,775 INFO L225 Difference]: With dead ends: 17 [2024-10-11 00:49:33,776 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 00:49:33,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-11 00:49:33,777 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 16 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 00:49:33,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 32 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 00:49:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 00:49:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 00:49:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:33,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 00:49:33,779 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2024-10-11 00:49:33,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 00:49:33,779 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 00:49:33,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 00:49:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 00:49:33,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 00:49:33,782 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 00:49:33,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-11 00:49:33,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-11 00:49:33,986 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 00:49:33,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 00:49:34,021 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 00:49:34,031 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2024-10-11 00:49:34,033 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2024-10-11 00:49:34,034 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-11 00:49:34,034 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression [2024-10-11 00:49:34,034 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2024-10-11 00:49:34,034 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Missing case for function ~Pluszero~32 [2024-10-11 00:49:34,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:49:34 BoogieIcfgContainer [2024-10-11 00:49:34,038 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 00:49:34,038 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 00:49:34,038 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 00:49:34,038 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 00:49:34,039 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:49:31" (3/4) ... [2024-10-11 00:49:34,041 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 00:49:34,061 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2024-10-11 00:49:34,063 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2024-10-11 00:49:34,063 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 00:49:34,063 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 00:49:34,226 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 00:49:34,227 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 00:49:34,227 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 00:49:34,228 INFO L158 Benchmark]: Toolchain (without parser) took 3091.41ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 47.9MB in the beginning and 60.2MB in the end (delta: -12.3MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2024-10-11 00:49:34,228 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory was 43.8MB in the beginning and 43.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:49:34,228 INFO L158 Benchmark]: CACSL2BoogieTranslator took 246.48ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 34.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 00:49:34,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.59ms. Allocated memory is still 67.1MB. Free memory was 34.5MB in the beginning and 32.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:49:34,229 INFO L158 Benchmark]: Boogie Preprocessor took 42.78ms. Allocated memory is still 67.1MB. Free memory was 32.7MB in the beginning and 30.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 00:49:34,229 INFO L158 Benchmark]: RCFGBuilder took 372.83ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 30.1MB in the beginning and 52.2MB in the end (delta: -22.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 00:49:34,230 INFO L158 Benchmark]: TraceAbstraction took 2191.42ms. Allocated memory is still 86.0MB. Free memory was 51.6MB in the beginning and 53.9MB in the end (delta: -2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 00:49:34,230 INFO L158 Benchmark]: Witness Printer took 188.94ms. Allocated memory is still 86.0MB. Free memory was 53.9MB in the beginning and 60.2MB in the end (delta: -6.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 00:49:34,231 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.17ms. Allocated memory is still 67.1MB. Free memory was 43.8MB in the beginning and 43.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 246.48ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 34.5MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.59ms. Allocated memory is still 67.1MB. Free memory was 34.5MB in the beginning and 32.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.78ms. Allocated memory is still 67.1MB. Free memory was 32.7MB in the beginning and 30.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 372.83ms. Allocated memory was 67.1MB in the beginning and 86.0MB in the end (delta: 18.9MB). Free memory was 30.1MB in the beginning and 52.2MB in the end (delta: -22.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2191.42ms. Allocated memory is still 86.0MB. Free memory was 51.6MB in the beginning and 53.9MB in the end (delta: -2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 188.94ms. Allocated memory is still 86.0MB. Free memory was 53.9MB in the beginning and 60.2MB in the end (delta: -6.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: BitVectorAccessExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Missing case for function ~Pluszero~32 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 124 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 120 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 46 mSDtfsCounter, 120 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=0, InterpolantAutomatonStates: 25, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 44 ConstructedInterpolants, 7 QuantifiedInterpolants, 239 SizeOfPredicates, 17 NumberOfNonLiveVariables, 176 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-10-11 00:49:34,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE