./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1092c.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1092c.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17022ac2d6c28ca56f87370a650921d1e6855c5509a626b4c9b141cb3850c9a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 18:12:00,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 18:12:00,239 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 18:12:00,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 18:12:00,243 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 18:12:00,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 18:12:00,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 18:12:00,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 18:12:00,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 18:12:00,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 18:12:00,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 18:12:00,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 18:12:00,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 18:12:00,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 18:12:00,263 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 18:12:00,263 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 18:12:00,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 18:12:00,264 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 18:12:00,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 18:12:00,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 18:12:00,265 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 18:12:00,265 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 18:12:00,266 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 18:12:00,266 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 18:12:00,266 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 18:12:00,266 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 18:12:00,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 18:12:00,267 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 18:12:00,267 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 18:12:00,267 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 18:12:00,267 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 18:12:00,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 18:12:00,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:12:00,268 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 18:12:00,268 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 18:12:00,268 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 18:12:00,269 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 18:12:00,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 18:12:00,269 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 18:12:00,269 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 18:12:00,269 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 18:12:00,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 18:12:00,270 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17022ac2d6c28ca56f87370a650921d1e6855c5509a626b4c9b141cb3850c9a7 [2024-11-11 18:12:00,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 18:12:00,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 18:12:00,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 18:12:00,568 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 18:12:00,568 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 18:12:00,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2024-11-11 18:12:02,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 18:12:02,578 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 18:12:02,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2024-11-11 18:12:02,599 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcf4db1c/99c354e9b806490f950d6bbfaf83ce8d/FLAG5c5229ea7 [2024-11-11 18:12:02,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffcf4db1c/99c354e9b806490f950d6bbfaf83ce8d [2024-11-11 18:12:02,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 18:12:02,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 18:12:02,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 18:12:02,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 18:12:02,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 18:12:02,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:12:02" (1/1) ... [2024-11-11 18:12:02,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@389cc533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:02, skipping insertion in model container [2024-11-11 18:12:02,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:12:02" (1/1) ... [2024-11-11 18:12:02,713 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 18:12:02,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c[2414,2427] [2024-11-11 18:12:02,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:12:02,948 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 18:12:02,990 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c[2414,2427] [2024-11-11 18:12:02,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:12:03,015 INFO L204 MainTranslator]: Completed translation [2024-11-11 18:12:03,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03 WrapperNode [2024-11-11 18:12:03,015 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 18:12:03,016 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 18:12:03,016 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 18:12:03,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 18:12:03,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,037 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,084 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 221 [2024-11-11 18:12:03,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 18:12:03,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 18:12:03,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 18:12:03,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 18:12:03,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,126 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 3, 3, 3]. 27 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 2]. [2024-11-11 18:12:03,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,137 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,140 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,146 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 18:12:03,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 18:12:03,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 18:12:03,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 18:12:03,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (1/1) ... [2024-11-11 18:12:03,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:12:03,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 18:12:03,188 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 18:12:03,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 18:12:03,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 18:12:03,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 18:12:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 18:12:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 18:12:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 18:12:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 18:12:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-11 18:12:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-11 18:12:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-11 18:12:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-11 18:12:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 18:12:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 18:12:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-11 18:12:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-11 18:12:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-11 18:12:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-11 18:12:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-11 18:12:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-11 18:12:03,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 18:12:03,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 18:12:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 18:12:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 18:12:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-11 18:12:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-11 18:12:03,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 18:12:03,361 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 18:12:03,368 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 18:12:03,906 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-11 18:12:03,910 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 18:12:03,935 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 18:12:03,938 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-11 18:12:03,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:12:03 BoogieIcfgContainer [2024-11-11 18:12:03,940 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 18:12:03,942 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 18:12:03,943 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 18:12:03,950 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 18:12:03,950 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 06:12:02" (1/3) ... [2024-11-11 18:12:03,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433b8d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:12:03, skipping insertion in model container [2024-11-11 18:12:03,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:03" (2/3) ... [2024-11-11 18:12:03,951 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@433b8d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:12:03, skipping insertion in model container [2024-11-11 18:12:03,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:12:03" (3/3) ... [2024-11-11 18:12:03,952 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092c.c [2024-11-11 18:12:03,990 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 18:12:03,992 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 18:12:04,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 18:12:04,093 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;@51bb9059, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 18:12:04,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 18:12:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 77 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:04,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-11 18:12:04,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:12:04,108 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:12:04,109 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:12:04,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:12:04,114 INFO L85 PathProgramCache]: Analyzing trace with hash 750661045, now seen corresponding path program 1 times [2024-11-11 18:12:04,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:12:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028130451] [2024-11-11 18:12:04,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:12:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:12:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:12:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 18:12:04,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:12:04,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028130451] [2024-11-11 18:12:04,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028130451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:12:04,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:12:04,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 18:12:04,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411008398] [2024-11-11 18:12:04,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:12:04,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 18:12:04,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:12:04,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 18:12:04,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 18:12:04,427 INFO L87 Difference]: Start difference. First operand has 78 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 77 states have internal predecessors, (121), 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 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:04,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:12:04,461 INFO L93 Difference]: Finished difference Result 154 states and 240 transitions. [2024-11-11 18:12:04,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 18:12:04,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 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 18 [2024-11-11 18:12:04,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:12:04,476 INFO L225 Difference]: With dead ends: 154 [2024-11-11 18:12:04,477 INFO L226 Difference]: Without dead ends: 75 [2024-11-11 18:12:04,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 18:12:04,484 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:12:04,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:12:04,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-11 18:12:04,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-11 18:12:04,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.5) internal successors, (111), 74 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-11-11 18:12:04,574 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 18 [2024-11-11 18:12:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:12:04,574 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-11-11 18:12:04,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-11-11 18:12:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-11 18:12:04,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:12:04,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:12:04,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 18:12:04,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:12:04,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:12:04,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1041817294, now seen corresponding path program 1 times [2024-11-11 18:12:04,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:12:04,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527370491] [2024-11-11 18:12:04,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:12:04,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:12:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:12:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 18:12:05,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:12:05,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527370491] [2024-11-11 18:12:05,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527370491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:12:05,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:12:05,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 18:12:05,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316722061] [2024-11-11 18:12:05,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:12:05,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 18:12:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:12:05,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 18:12:05,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:12:05,155 INFO L87 Difference]: Start difference. First operand 75 states and 111 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:05,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:12:05,237 INFO L93 Difference]: Finished difference Result 84 states and 121 transitions. [2024-11-11 18:12:05,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 18:12:05,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-11 18:12:05,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:12:05,239 INFO L225 Difference]: With dead ends: 84 [2024-11-11 18:12:05,240 INFO L226 Difference]: Without dead ends: 79 [2024-11-11 18:12:05,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 18:12:05,242 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 2 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 18:12:05,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 306 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 18:12:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-11 18:12:05,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-11-11 18:12:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4805194805194806) internal successors, (114), 77 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-11-11 18:12:05,258 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 20 [2024-11-11 18:12:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:12:05,259 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-11-11 18:12:05,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-11-11 18:12:05,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 18:12:05,260 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:12:05,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:12:05,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 18:12:05,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:12:05,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:12:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1016319636, now seen corresponding path program 1 times [2024-11-11 18:12:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:12:05,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861204886] [2024-11-11 18:12:05,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:12:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:12:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:12:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 18:12:05,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 18:12:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861204886] [2024-11-11 18:12:05,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861204886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:12:05,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:12:05,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:12:05,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067523098] [2024-11-11 18:12:05,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:12:05,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:12:05,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 18:12:05,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:12:05,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:12:05,603 INFO L87 Difference]: Start difference. First operand 78 states and 114 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:05,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:12:05,639 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2024-11-11 18:12:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 18:12:05,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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 21 [2024-11-11 18:12:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:12:05,644 INFO L225 Difference]: With dead ends: 83 [2024-11-11 18:12:05,644 INFO L226 Difference]: Without dead ends: 78 [2024-11-11 18:12:05,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:12:05,645 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 0 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:12:05,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:12:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-11 18:12:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-11-11 18:12:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.472972972972973) internal successors, (109), 74 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-11-11 18:12:05,657 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 21 [2024-11-11 18:12:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:12:05,657 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-11-11 18:12:05,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-11-11 18:12:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 18:12:05,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:12:05,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:12:05,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 18:12:05,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:12:05,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:12:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1226242261, now seen corresponding path program 1 times [2024-11-11 18:12:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 18:12:05,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465544448] [2024-11-11 18:12:05,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:12:05,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 18:12:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:12:05,692 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 18:12:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 18:12:05,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 18:12:05,764 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 18:12:05,765 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 18:12:05,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 18:12:05,773 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-11 18:12:05,833 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 18:12:05,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 06:12:05 BoogieIcfgContainer [2024-11-11 18:12:05,841 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 18:12:05,841 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 18:12:05,841 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 18:12:05,842 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 18:12:05,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:12:03" (3/4) ... [2024-11-11 18:12:05,847 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 18:12:05,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 18:12:05,849 INFO L158 Benchmark]: Toolchain (without parser) took 3191.89ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 103.1MB in the beginning and 158.1MB in the end (delta: -55.0MB). Peak memory consumption was 1.0MB. Max. memory is 16.1GB. [2024-11-11 18:12:05,849 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 132.1MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:12:05,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.98ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 102.9MB in the beginning and 149.5MB in the end (delta: -46.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-11 18:12:05,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.24ms. Allocated memory is still 188.7MB. Free memory was 149.5MB in the beginning and 146.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:12:05,850 INFO L158 Benchmark]: Boogie Preprocessor took 68.13ms. Allocated memory is still 188.7MB. Free memory was 146.4MB in the beginning and 143.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 18:12:05,850 INFO L158 Benchmark]: RCFGBuilder took 786.18ms. Allocated memory is still 188.7MB. Free memory was 143.2MB in the beginning and 118.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 18:12:05,850 INFO L158 Benchmark]: TraceAbstraction took 1899.08ms. Allocated memory is still 188.7MB. Free memory was 117.0MB in the beginning and 158.1MB in the end (delta: -41.1MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2024-11-11 18:12:05,850 INFO L158 Benchmark]: Witness Printer took 6.91ms. Allocated memory is still 188.7MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:12:05,853 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.24ms. Allocated memory is still 132.1MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.98ms. Allocated memory was 132.1MB in the beginning and 188.7MB in the end (delta: 56.6MB). Free memory was 102.9MB in the beginning and 149.5MB in the end (delta: -46.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.24ms. Allocated memory is still 188.7MB. Free memory was 149.5MB in the beginning and 146.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.13ms. Allocated memory is still 188.7MB. Free memory was 146.4MB in the beginning and 143.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 786.18ms. Allocated memory is still 188.7MB. Free memory was 143.2MB in the beginning and 118.1MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1899.08ms. Allocated memory is still 188.7MB. Free memory was 117.0MB in the beginning and 158.1MB in the end (delta: -41.1MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * Witness Printer took 6.91ms. Allocated memory is still 188.7MB. Free memory is still 158.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 109]: 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 bitwiseOr at line 94, overapproximation of someBinaryArithmeticDOUBLEoperation at line 52. Possible FailurePath: [L16] static const double huge_ceil = 1.0e300; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L105] double x = 1.0 / 0.0; [L106] CALL, EXPR ceil_double(x) [L19] __int32_t i0, i1, j0; [L20] __uint32_t i, j; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014] [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (i0) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (i1) = ew_u.parts.lsw [L27] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1048576, i1=0, j0=1024, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014] [L28] COND FALSE !(j0 < 20) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1048576, i1=0, j0=1024, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014] [L50] COND TRUE j0 > 51 VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1048576, i1=0, j0=1024, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014] [L51] COND TRUE j0 == 0x400 [L52] return x + x; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=-1048576, i1=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014] [L106] RET, EXPR ceil_double(x) [L106] double res = ceil_double(x); [L108] CALL, EXPR isinf_double(res) [L84] __int32_t hx, lx; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013] [L86] ieee_double_shape_type ew_u; [L87] ew_u.value = (x) [L88] EXPR ew_u.parts.msw [L88] (hx) = ew_u.parts.msw [L89] EXPR ew_u.parts.lsw [L89] (lx) = ew_u.parts.lsw [L91] hx &= 0x7fffffff VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, lx=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013] [L92] EXPR lx | (-lx) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013] [L92] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L93] hx = 0x7ff00000 - hx VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=2146435072, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013] [L94] EXPR hx | (-hx) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000013] [L94] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); [L108] RET, EXPR isinf_double(res) [L108] COND TRUE !isinf_double(res) [L109] reach_error() VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 849 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 330 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 56 ConstructedInterpolants, 0 QuantifiedInterpolants, 78 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-11-11 18:12:05,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1092c.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 17022ac2d6c28ca56f87370a650921d1e6855c5509a626b4c9b141cb3850c9a7 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 18:12:08,111 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 18:12:08,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 18:12:08,227 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 18:12:08,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 18:12:08,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 18:12:08,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 18:12:08,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 18:12:08,273 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 18:12:08,274 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 18:12:08,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 18:12:08,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 18:12:08,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 18:12:08,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 18:12:08,282 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 18:12:08,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 18:12:08,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 18:12:08,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 18:12:08,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 18:12:08,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 18:12:08,283 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 18:12:08,284 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 18:12:08,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 18:12:08,285 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 18:12:08,285 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 18:12:08,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 18:12:08,285 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 18:12:08,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 18:12:08,289 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 18:12:08,289 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 18:12:08,289 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 18:12:08,290 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 18:12:08,290 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 18:12:08,290 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 18:12:08,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:12:08,290 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 18:12:08,290 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 18:12:08,291 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 18:12:08,291 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 18:12:08,291 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 18:12:08,292 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 18:12:08,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 18:12:08,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 18:12:08,293 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 18:12:08,293 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 17022ac2d6c28ca56f87370a650921d1e6855c5509a626b4c9b141cb3850c9a7 [2024-11-11 18:12:08,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 18:12:08,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 18:12:08,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 18:12:08,720 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 18:12:08,720 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 18:12:08,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2024-11-11 18:12:10,365 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 18:12:10,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 18:12:10,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2024-11-11 18:12:10,614 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b252c583c/df76ddeb1b174cf79950f7e2e91e1691/FLAG297a816a1 [2024-11-11 18:12:10,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b252c583c/df76ddeb1b174cf79950f7e2e91e1691 [2024-11-11 18:12:10,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 18:12:10,955 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 18:12:10,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 18:12:10,957 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 18:12:10,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 18:12:10,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:12:10" (1/1) ... [2024-11-11 18:12:10,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40713dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:10, skipping insertion in model container [2024-11-11 18:12:10,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 06:12:10" (1/1) ... [2024-11-11 18:12:10,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 18:12:11,239 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c[2414,2427] [2024-11-11 18:12:11,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:12:11,271 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 18:12:11,314 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c[2414,2427] [2024-11-11 18:12:11,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 18:12:11,351 INFO L204 MainTranslator]: Completed translation [2024-11-11 18:12:11,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11 WrapperNode [2024-11-11 18:12:11,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 18:12:11,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 18:12:11,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 18:12:11,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 18:12:11,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,401 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-11 18:12:11,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 18:12:11,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 18:12:11,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 18:12:11,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 18:12:11,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,441 INFO L175 MemorySlicer]: Split 11 memory accesses to 4 slices as follows [2, 3, 3, 3]. 27 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 4 writes are split as follows [0, 2, 1, 1]. [2024-11-11 18:12:11,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,455 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,458 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 18:12:11,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 18:12:11,465 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 18:12:11,465 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 18:12:11,466 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (1/1) ... [2024-11-11 18:12:11,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 18:12:11,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 18:12:11,529 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 18:12:11,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 18:12:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 18:12:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-11 18:12:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-11 18:12:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-11 18:12:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-11 18:12:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-11 18:12:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-11 18:12:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-11 18:12:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-11 18:12:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 18:12:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-11 18:12:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-11 18:12:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-11 18:12:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-11 18:12:11,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-11 18:12:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-11 18:12:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-11 18:12:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-11 18:12:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 18:12:11,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 18:12:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-11 18:12:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-11 18:12:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-11 18:12:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-11 18:12:11,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 18:12:11,735 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 18:12:11,739 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 18:12:13,557 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-11 18:12:13,557 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 18:12:13,575 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 18:12:13,575 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-11 18:12:13,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:12:13 BoogieIcfgContainer [2024-11-11 18:12:13,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 18:12:13,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 18:12:13,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 18:12:13,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 18:12:13,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 06:12:10" (1/3) ... [2024-11-11 18:12:13,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634114c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:12:13, skipping insertion in model container [2024-11-11 18:12:13,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 06:12:11" (2/3) ... [2024-11-11 18:12:13,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634114c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 06:12:13, skipping insertion in model container [2024-11-11 18:12:13,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:12:13" (3/3) ... [2024-11-11 18:12:13,606 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092c.c [2024-11-11 18:12:13,638 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 18:12:13,638 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 18:12:13,713 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 18:12:13,722 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;@9fd8901, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 18:12:13,722 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 18:12:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 18:12:13,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:12:13,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:12:13,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:12:13,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:12:13,742 INFO L85 PathProgramCache]: Analyzing trace with hash 658478814, now seen corresponding path program 1 times [2024-11-11 18:12:13,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:12:13,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270930668] [2024-11-11 18:12:13,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:12:13,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:12:13,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:12:13,758 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:12:13,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-11 18:12:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:12:13,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 18:12:13,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:12:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 18:12:13,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:12:13,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:12:13,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270930668] [2024-11-11 18:12:13,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270930668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:12:13,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:12:13,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 18:12:13,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420404770] [2024-11-11 18:12:13,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:12:13,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 18:12:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:12:13,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 18:12:13,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 18:12:13,908 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 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 6.5) internal successors, (13), 2 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-11-11 18:12:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:12:13,925 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2024-11-11 18:12:13,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 18:12:13,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-11-11 18:12:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:12:13,935 INFO L225 Difference]: With dead ends: 72 [2024-11-11 18:12:13,935 INFO L226 Difference]: Without dead ends: 34 [2024-11-11 18:12:13,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 18:12:13,941 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 18:12:13,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 18:12:13,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-11 18:12:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-11 18:12:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 33 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-11-11 18:12:13,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 13 [2024-11-11 18:12:13,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:12:13,976 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-11 18:12:13,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-11-11 18:12:13,977 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2024-11-11 18:12:13,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 18:12:13,977 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:12:13,978 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:12:13,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-11 18:12:14,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:12:14,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:12:14,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:12:14,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1562173395, now seen corresponding path program 1 times [2024-11-11 18:12:14,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:12:14,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012299229] [2024-11-11 18:12:14,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:12:14,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:12:14,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:12:14,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:12:14,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-11 18:12:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:12:14,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-11 18:12:14,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:12:14,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 18:12:14,563 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:12:14,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:12:14,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012299229] [2024-11-11 18:12:14,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012299229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:12:14,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:12:14,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 18:12:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518475161] [2024-11-11 18:12:14,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:12:14,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 18:12:14,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:12:14,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 18:12:14,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 18:12:14,566 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:12:15,196 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-11 18:12:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 18:12:15,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2024-11-11 18:12:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:12:15,198 INFO L225 Difference]: With dead ends: 42 [2024-11-11 18:12:15,198 INFO L226 Difference]: Without dead ends: 16 [2024-11-11 18:12:15,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 18:12:15,200 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 18:12:15,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 18:12:15,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-11 18:12:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-11 18:12:15,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2024-11-11 18:12:15,203 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 15 [2024-11-11 18:12:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:12:15,204 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2024-11-11 18:12:15,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2024-11-11 18:12:15,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 18:12:15,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 18:12:15,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 18:12:15,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-11 18:12:15,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:12:15,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 18:12:15,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 18:12:15,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1582346339, now seen corresponding path program 1 times [2024-11-11 18:12:15,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 18:12:15,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317652614] [2024-11-11 18:12:15,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 18:12:15,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:12:15,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 18:12:15,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-11 18:12:15,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-11 18:12:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 18:12:15,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 18:12:15,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 18:12:16,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 18:12:16,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 18:12:16,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 18:12:16,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317652614] [2024-11-11 18:12:16,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317652614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 18:12:16,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 18:12:16,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 18:12:16,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065541405] [2024-11-11 18:12:16,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 18:12:16,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 18:12:16,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 18:12:16,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 18:12:16,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 18:12:16,112 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:16,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 18:12:16,493 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2024-11-11 18:12:16,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 18:12:16,494 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2024-11-11 18:12:16,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 18:12:16,494 INFO L225 Difference]: With dead ends: 16 [2024-11-11 18:12:16,494 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 18:12:16,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-11-11 18:12:16,497 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 18:12:16,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 35 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 18:12:16,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 18:12:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 18:12:16,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:16,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 18:12:16,500 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-11-11 18:12:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 18:12:16,500 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 18:12:16,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 18:12:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 18:12:16,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 18:12:16,506 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 18:12:16,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-11 18:12:16,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 18:12:16,714 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-11 18:12:16,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 18:12:16,763 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 18:12:16,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 06:12:16 BoogieIcfgContainer [2024-11-11 18:12:16,803 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 18:12:16,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 18:12:16,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 18:12:16,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 18:12:16,808 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 06:12:13" (3/4) ... [2024-11-11 18:12:16,809 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 18:12:16,822 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-11 18:12:16,826 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-11 18:12:16,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 18:12:16,830 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 18:12:16,956 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 18:12:16,956 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 18:12:16,957 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 18:12:16,957 INFO L158 Benchmark]: Toolchain (without parser) took 6002.66ms. Allocated memory was 73.4MB in the beginning and 115.3MB in the end (delta: 41.9MB). Free memory was 34.9MB in the beginning and 87.6MB in the end (delta: -52.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:12:16,957 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 73.4MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 18:12:16,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.57ms. Allocated memory is still 73.4MB. Free memory was 34.7MB in the beginning and 42.4MB in the end (delta: -7.7MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2024-11-11 18:12:16,958 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.93ms. Allocated memory is still 73.4MB. Free memory was 42.3MB in the beginning and 40.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 18:12:16,958 INFO L158 Benchmark]: Boogie Preprocessor took 61.03ms. Allocated memory is still 73.4MB. Free memory was 40.2MB in the beginning and 37.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 18:12:16,958 INFO L158 Benchmark]: RCFGBuilder took 2118.29ms. Allocated memory was 73.4MB in the beginning and 115.3MB in the end (delta: 41.9MB). Free memory was 37.4MB in the beginning and 82.1MB in the end (delta: -44.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-11 18:12:16,958 INFO L158 Benchmark]: TraceAbstraction took 3217.79ms. Allocated memory is still 115.3MB. Free memory was 81.4MB in the beginning and 92.6MB in the end (delta: -11.1MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2024-11-11 18:12:16,959 INFO L158 Benchmark]: Witness Printer took 149.52ms. Allocated memory is still 115.3MB. Free memory was 92.6MB in the beginning and 87.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 18:12:16,960 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.66ms. Allocated memory is still 73.4MB. Free memory is still 49.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.57ms. Allocated memory is still 73.4MB. Free memory was 34.7MB in the beginning and 42.4MB in the end (delta: -7.7MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.93ms. Allocated memory is still 73.4MB. Free memory was 42.3MB in the beginning and 40.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.03ms. Allocated memory is still 73.4MB. Free memory was 40.2MB in the beginning and 37.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2118.29ms. Allocated memory was 73.4MB in the beginning and 115.3MB in the end (delta: 41.9MB). Free memory was 37.4MB in the beginning and 82.1MB in the end (delta: -44.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3217.79ms. Allocated memory is still 115.3MB. Free memory was 81.4MB in the beginning and 92.6MB in the end (delta: -11.1MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. * Witness Printer took 149.52ms. Allocated memory is still 115.3MB. Free memory was 92.6MB in the beginning and 87.6MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 109]: 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, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 67 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 40 ConstructedInterpolants, 8 QuantifiedInterpolants, 399 SizeOfPredicates, 8 NumberOfNonLiveVariables, 154 ConjunctsInSsa, 29 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 73]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 85]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-11 18:12:17,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE