./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-08 12:33:21,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:33:21,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 12:33:21,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:33:21,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:33:21,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:33:21,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:33:21,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:33:21,709 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:33:21,711 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:33:21,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:33:21,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:33:21,712 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:33:21,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:33:21,713 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:33:21,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:33:21,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:33:21,714 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:33:21,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 12:33:21,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:33:21,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:33:21,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:33:21,716 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:33:21,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:33:21,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:33:21,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:33:21,717 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:33:21,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:33:21,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:33:21,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:33:21,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:33:21,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:33:21,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:33:21,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:33:21,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:33:21,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:33:21,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 12:33:21,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 12:33:21,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:33:21,725 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:33:21,725 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:33:21,725 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:33:21,725 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-08 12:33:22,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:33:22,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:33:22,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:33:22,038 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:33:22,038 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:33:22,039 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-08 12:33:23,478 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:33:23,685 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:33:23,685 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2024-11-08 12:33:23,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043467d18/a57ab835266e4d208317762ca8849ad0/FLAG00829c23d [2024-11-08 12:33:23,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/043467d18/a57ab835266e4d208317762ca8849ad0 [2024-11-08 12:33:23,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:33:23,712 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:33:23,716 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:33:23,716 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:33:23,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:33:23,722 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:33:23" (1/1) ... [2024-11-08 12:33:23,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdf1fd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:23, skipping insertion in model container [2024-11-08 12:33:23,723 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:33:23" (1/1) ... [2024-11-08 12:33:23,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:33:23,968 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-08 12:33:23,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:33:23,993 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:33:24,027 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-08 12:33:24,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:33:24,051 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:33:24,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24 WrapperNode [2024-11-08 12:33:24,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:33:24,053 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:33:24,053 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:33:24,053 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:33:24,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,098 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 221 [2024-11-08 12:33:24,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:33:24,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:33:24,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:33:24,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:33:24,115 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,137 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-08 12:33:24,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,164 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,169 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,178 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:33:24,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:33:24,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:33:24,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:33:24,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (1/1) ... [2024-11-08 12:33:24,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:33:24,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:33:24,222 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-08 12:33:24,226 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-08 12:33:24,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:33:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 12:33:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 12:33:24,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 12:33:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 12:33:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 12:33:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 12:33:24,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 12:33:24,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 12:33:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 12:33:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 12:33:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 12:33:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 12:33:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 12:33:24,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 12:33:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 12:33:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 12:33:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 12:33:24,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:33:24,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:33:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 12:33:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 12:33:24,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 12:33:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 12:33:24,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:33:24,403 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:33:24,405 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:33:24,913 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-08 12:33:24,913 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:33:24,935 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:33:24,935 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-08 12:33:24,935 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:24 BoogieIcfgContainer [2024-11-08 12:33:24,935 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:33:24,938 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:33:24,938 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:33:24,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:33:24,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:33:23" (1/3) ... [2024-11-08 12:33:24,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a480499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:33:24, skipping insertion in model container [2024-11-08 12:33:24,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:24" (2/3) ... [2024-11-08 12:33:24,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a480499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:33:24, skipping insertion in model container [2024-11-08 12:33:24,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:24" (3/3) ... [2024-11-08 12:33:24,945 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092c.c [2024-11-08 12:33:24,961 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:33:24,961 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:33:25,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:33:25,022 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;@51e2eca2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:33:25,022 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:33:25,025 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-08 12:33:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-08 12:33:25,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:25,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:25,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:25,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 750661045, now seen corresponding path program 1 times [2024-11-08 12:33:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:25,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993996821] [2024-11-08 12:33:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:25,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:25,209 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-08 12:33:25,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:33:25,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993996821] [2024-11-08 12:33:25,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993996821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:25,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:25,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:33:25,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320888850] [2024-11-08 12:33:25,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:25,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:33:25,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:33:25,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:33:25,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:33:25,252 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-08 12:33:25,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:25,271 INFO L93 Difference]: Finished difference Result 154 states and 240 transitions. [2024-11-08 12:33:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:33:25,297 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-08 12:33:25,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:25,309 INFO L225 Difference]: With dead ends: 154 [2024-11-08 12:33:25,310 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 12:33:25,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:33:25,318 INFO L432 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-08 12:33:25,325 INFO L433 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-08 12:33:25,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 12:33:25,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-08 12:33:25,374 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-08 12:33:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 111 transitions. [2024-11-08 12:33:25,377 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 111 transitions. Word has length 18 [2024-11-08 12:33:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:25,377 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 111 transitions. [2024-11-08 12:33:25,377 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-08 12:33:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 111 transitions. [2024-11-08 12:33:25,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 12:33:25,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:25,379 INFO L215 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-08 12:33:25,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 12:33:25,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:25,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:25,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1041817294, now seen corresponding path program 1 times [2024-11-08 12:33:25,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:25,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592708595] [2024-11-08 12:33:25,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:25,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:25,870 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-08 12:33:25,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:33:25,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592708595] [2024-11-08 12:33:25,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592708595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:25,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:25,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 12:33:25,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496116164] [2024-11-08 12:33:25,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:25,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 12:33:25,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:33:25,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 12:33:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:33:25,874 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-08 12:33:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:25,955 INFO L93 Difference]: Finished difference Result 84 states and 121 transitions. [2024-11-08 12:33:25,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 12:33:25,958 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-08 12:33:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:25,959 INFO L225 Difference]: With dead ends: 84 [2024-11-08 12:33:25,959 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 12:33:25,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 12:33:25,960 INFO L432 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-08 12:33:25,961 INFO L433 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-08 12:33:25,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 12:33:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2024-11-08 12:33:25,972 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-08 12:33:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 114 transitions. [2024-11-08 12:33:25,973 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 114 transitions. Word has length 20 [2024-11-08 12:33:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:25,974 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 114 transitions. [2024-11-08 12:33:25,974 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-08 12:33:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 114 transitions. [2024-11-08 12:33:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-08 12:33:25,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:25,975 INFO L215 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-08 12:33:25,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 12:33:25,976 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:25,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1016319636, now seen corresponding path program 1 times [2024-11-08 12:33:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:25,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603069681] [2024-11-08 12:33:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:26,268 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-08 12:33:26,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 12:33:26,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603069681] [2024-11-08 12:33:26,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603069681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:26,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:26,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:33:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766479567] [2024-11-08 12:33:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:26,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:33:26,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 12:33:26,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:33:26,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:33:26,274 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-08 12:33:26,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:26,312 INFO L93 Difference]: Finished difference Result 83 states and 118 transitions. [2024-11-08 12:33:26,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 12:33:26,313 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-08 12:33:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:26,314 INFO L225 Difference]: With dead ends: 83 [2024-11-08 12:33:26,317 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 12:33:26,317 INFO L431 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-08 12:33:26,318 INFO L432 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-08 12:33:26,319 INFO L433 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-08 12:33:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 12:33:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-11-08 12:33:26,330 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-08 12:33:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 109 transitions. [2024-11-08 12:33:26,334 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 109 transitions. Word has length 21 [2024-11-08 12:33:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:26,334 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 109 transitions. [2024-11-08 12:33:26,334 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-08 12:33:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 109 transitions. [2024-11-08 12:33:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 12:33:26,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:26,335 INFO L215 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-08 12:33:26,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 12:33:26,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:26,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1226242261, now seen corresponding path program 1 times [2024-11-08 12:33:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 12:33:26,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992786615] [2024-11-08 12:33:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 12:33:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:33:26,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 12:33:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 12:33:26,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 12:33:26,459 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 12:33:26,460 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 12:33:26,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 12:33:26,467 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 12:33:26,491 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:33:26,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:33:26 BoogieIcfgContainer [2024-11-08 12:33:26,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:33:26,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:33:26,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:33:26,496 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:33:26,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:24" (3/4) ... [2024-11-08 12:33:26,499 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 12:33:26,500 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:33:26,501 INFO L158 Benchmark]: Toolchain (without parser) took 2788.44ms. Allocated memory was 163.6MB in the beginning and 224.4MB in the end (delta: 60.8MB). Free memory was 109.3MB in the beginning and 169.0MB in the end (delta: -59.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:33:26,501 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 163.6MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:33:26,502 INFO L158 Benchmark]: CACSL2BoogieTranslator took 336.57ms. Allocated memory is still 163.6MB. Free memory was 109.3MB in the beginning and 94.5MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 12:33:26,502 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.05ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 92.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:33:26,503 INFO L158 Benchmark]: Boogie Preprocessor took 78.66ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 89.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 12:33:26,503 INFO L158 Benchmark]: RCFGBuilder took 756.52ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 63.5MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-08 12:33:26,504 INFO L158 Benchmark]: TraceAbstraction took 1557.03ms. Allocated memory was 163.6MB in the beginning and 224.4MB in the end (delta: 60.8MB). Free memory was 63.1MB in the beginning and 170.1MB in the end (delta: -107.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:33:26,504 INFO L158 Benchmark]: Witness Printer took 4.94ms. Allocated memory is still 224.4MB. Free memory was 170.1MB in the beginning and 169.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:33:26,506 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.25ms. Allocated memory is still 163.6MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 336.57ms. Allocated memory is still 163.6MB. Free memory was 109.3MB in the beginning and 94.5MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.05ms. Allocated memory is still 163.6MB. Free memory was 94.5MB in the beginning and 92.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.66ms. Allocated memory is still 163.6MB. Free memory was 92.0MB in the beginning and 89.0MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 756.52ms. Allocated memory is still 163.6MB. Free memory was 89.0MB in the beginning and 63.5MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1557.03ms. Allocated memory was 163.6MB in the beginning and 224.4MB in the end (delta: 60.8MB). Free memory was 63.1MB in the beginning and 170.1MB in the end (delta: -107.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.94ms. Allocated memory is still 224.4MB. Free memory was 170.1MB in the beginning and 169.0MB in the end (delta: 1.0MB). 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=2147483647, i1=0, j0=1024, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014] [L28] COND FALSE !(j0 < 20) VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=2147483647, i1=0, j0=1024, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014] [L50] COND TRUE j0 > 51 VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=2147483647, i1=0, j0=1024, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000014] [L51] COND TRUE j0 == 0x400 [L52] return x + x; VAL [huge_ceil=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, i0=2147483647, 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.5s, 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.0s 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-08 12:33:26,547 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-?-c7c6ca5-m [2024-11-08 12:33:28,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 12:33:28,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 12:33:28,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 12:33:28,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 12:33:28,988 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 12:33:28,988 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 12:33:28,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 12:33:28,992 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 12:33:28,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 12:33:28,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 12:33:28,993 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 12:33:28,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 12:33:28,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 12:33:28,994 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 12:33:28,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 12:33:28,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 12:33:28,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 12:33:28,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 12:33:28,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 12:33:28,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 12:33:29,002 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 12:33:29,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 12:33:29,003 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 12:33:29,003 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 12:33:29,003 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 12:33:29,004 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 12:33:29,004 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 12:33:29,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 12:33:29,004 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 12:33:29,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 12:33:29,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 12:33:29,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 12:33:29,005 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 12:33:29,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:33:29,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 12:33:29,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 12:33:29,016 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 12:33:29,016 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 12:33:29,017 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 12:33:29,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 12:33:29,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 12:33:29,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 12:33:29,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 12:33:29,019 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-08 12:33:29,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 12:33:29,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 12:33:29,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 12:33:29,387 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 12:33:29,388 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 12:33:29,389 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-08 12:33:30,931 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 12:33:31,162 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 12:33:31,162 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1092c.c [2024-11-08 12:33:31,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b11521099/fc2afc58c2774363bffd0f69bbcbf73f/FLAGa35cccee9 [2024-11-08 12:33:31,190 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b11521099/fc2afc58c2774363bffd0f69bbcbf73f [2024-11-08 12:33:31,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 12:33:31,195 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 12:33:31,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 12:33:31,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 12:33:31,205 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 12:33:31,206 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a61b983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31, skipping insertion in model container [2024-11-08 12:33:31,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,233 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 12:33:31,454 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-08 12:33:31,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:33:31,476 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 12:33:31,513 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-08 12:33:31,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 12:33:31,541 INFO L204 MainTranslator]: Completed translation [2024-11-08 12:33:31,542 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31 WrapperNode [2024-11-08 12:33:31,542 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 12:33:31,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 12:33:31,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 12:33:31,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 12:33:31,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,594 INFO L138 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 121 [2024-11-08 12:33:31,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 12:33:31,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 12:33:31,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 12:33:31,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 12:33:31,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,642 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-08 12:33:31,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,658 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,663 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 12:33:31,681 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 12:33:31,681 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 12:33:31,681 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 12:33:31,682 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (1/1) ... [2024-11-08 12:33:31,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 12:33:31,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 12:33:31,725 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-08 12:33:31,730 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-08 12:33:31,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 12:33:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 12:33:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 12:33:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 12:33:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 12:33:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 12:33:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 12:33:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 12:33:31,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 12:33:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 12:33:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 12:33:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 12:33:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 12:33:31,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-08 12:33:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 12:33:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 12:33:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 12:33:31,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 12:33:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 12:33:31,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 12:33:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 12:33:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 12:33:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 12:33:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 12:33:31,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 12:33:31,864 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 12:33:31,867 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 12:33:32,937 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-08 12:33:32,937 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 12:33:32,954 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 12:33:32,954 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-08 12:33:32,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:32 BoogieIcfgContainer [2024-11-08 12:33:32,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 12:33:32,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 12:33:32,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 12:33:32,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 12:33:32,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 12:33:31" (1/3) ... [2024-11-08 12:33:32,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483d774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:33:32, skipping insertion in model container [2024-11-08 12:33:32,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 12:33:31" (2/3) ... [2024-11-08 12:33:32,966 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483d774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 12:33:32, skipping insertion in model container [2024-11-08 12:33:32,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:32" (3/3) ... [2024-11-08 12:33:32,971 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1092c.c [2024-11-08 12:33:32,987 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 12:33:32,988 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 12:33:33,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 12:33:33,046 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;@28921bb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 12:33:33,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 12:33:33,051 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-08 12:33:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 12:33:33,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:33,059 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:33,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:33,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:33,066 INFO L85 PathProgramCache]: Analyzing trace with hash 658478814, now seen corresponding path program 1 times [2024-11-08 12:33:33,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:33,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919568378] [2024-11-08 12:33:33,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:33,080 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-08 12:33:33,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:33,082 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-08 12:33:33,102 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-08 12:33:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:33,212 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 12:33:33,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:33,240 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-08 12:33:33,241 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:33,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:33,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919568378] [2024-11-08 12:33:33,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919568378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:33,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:33,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 12:33:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008113092] [2024-11-08 12:33:33,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:33,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 12:33:33,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:33,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 12:33:33,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:33:33,272 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-08 12:33:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:33,288 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2024-11-08 12:33:33,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 12:33:33,292 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-08 12:33:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:33,300 INFO L225 Difference]: With dead ends: 72 [2024-11-08 12:33:33,301 INFO L226 Difference]: Without dead ends: 34 [2024-11-08 12:33:33,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 12:33:33,308 INFO L432 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-08 12:33:33,311 INFO L433 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-08 12:33:33,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-08 12:33:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-08 12:33:33,344 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-08 12:33:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2024-11-08 12:33:33,348 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 13 [2024-11-08 12:33:33,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:33,349 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2024-11-08 12:33:33,349 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-08 12:33:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2024-11-08 12:33:33,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 12:33:33,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:33,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:33,358 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-08 12:33:33,552 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-08 12:33:33,553 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:33,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:33,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1562173395, now seen corresponding path program 1 times [2024-11-08 12:33:33,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:33,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994416592] [2024-11-08 12:33:33,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:33,555 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-08 12:33:33,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:33,558 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-08 12:33:33,560 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-08 12:33:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:33,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 12:33:33,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:33,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 12:33:33,924 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:33,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:33,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994416592] [2024-11-08 12:33:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994416592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:33,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:33,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 12:33:33,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57784063] [2024-11-08 12:33:33,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:33,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 12:33:33,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 12:33:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 12:33:33,928 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-08 12:33:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:34,193 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-11-08 12:33:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 12:33:34,194 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-08 12:33:34,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:34,194 INFO L225 Difference]: With dead ends: 42 [2024-11-08 12:33:34,194 INFO L226 Difference]: Without dead ends: 16 [2024-11-08 12:33:34,195 INFO L431 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-08 12:33:34,196 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 12:33:34,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 12:33:34,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-08 12:33:34,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-08 12:33:34,199 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-08 12:33:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2024-11-08 12:33:34,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 15 [2024-11-08 12:33:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:34,199 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2024-11-08 12:33:34,200 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-08 12:33:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2024-11-08 12:33:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 12:33:34,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 12:33:34,200 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 12:33:34,205 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-08 12:33:34,401 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-08 12:33:34,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 12:33:34,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 12:33:34,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1582346339, now seen corresponding path program 1 times [2024-11-08 12:33:34,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 12:33:34,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059766228] [2024-11-08 12:33:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 12:33:34,403 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-08 12:33:34,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 12:33:34,405 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-08 12:33:34,405 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-08 12:33:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 12:33:34,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-08 12:33:34,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 12:33:34,899 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-08 12:33:34,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 12:33:34,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 12:33:34,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059766228] [2024-11-08 12:33:34,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059766228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 12:33:34,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 12:33:34,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 12:33:34,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366867583] [2024-11-08 12:33:34,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 12:33:34,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 12:33:34,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 12:33:34,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 12:33:34,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 12:33:34,902 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-08 12:33:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 12:33:35,341 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2024-11-08 12:33:35,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 12:33:35,341 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-08 12:33:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 12:33:35,342 INFO L225 Difference]: With dead ends: 16 [2024-11-08 12:33:35,342 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 12:33:35,342 INFO L431 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-08 12:33:35,345 INFO L432 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-08 12:33:35,346 INFO L433 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-08 12:33:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 12:33:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 12:33:35,348 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-08 12:33:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 12:33:35,348 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-11-08 12:33:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 12:33:35,348 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 12:33:35,348 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-08 12:33:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 12:33:35,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 12:33:35,352 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 12:33:35,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 12:33:35,556 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-08 12:33:35,560 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-08 12:33:35,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 12:33:35,631 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 12:33:35,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 12:33:35 BoogieIcfgContainer [2024-11-08 12:33:35,649 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 12:33:35,650 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 12:33:35,650 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 12:33:35,653 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 12:33:35,654 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 12:33:32" (3/4) ... [2024-11-08 12:33:35,656 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 12:33:35,664 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-08 12:33:35,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-08 12:33:35,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 12:33:35,665 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 12:33:35,824 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 12:33:35,824 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 12:33:35,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 12:33:35,825 INFO L158 Benchmark]: Toolchain (without parser) took 4630.24ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 38.3MB in the beginning and 54.0MB in the end (delta: -15.7MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-08 12:33:35,826 INFO L158 Benchmark]: CDTParser took 1.09ms. Allocated memory is still 44.0MB. Free memory was 27.8MB in the beginning and 27.8MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:33:35,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.37ms. Allocated memory is still 60.8MB. Free memory was 38.1MB in the beginning and 23.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 12:33:35,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.02ms. Allocated memory is still 60.8MB. Free memory was 41.7MB in the beginning and 39.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 12:33:35,827 INFO L158 Benchmark]: Boogie Preprocessor took 83.69ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 36.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 12:33:35,827 INFO L158 Benchmark]: RCFGBuilder took 1275.73ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 36.9MB in the beginning and 56.9MB in the end (delta: -20.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-08 12:33:35,827 INFO L158 Benchmark]: TraceAbstraction took 2690.47ms. Allocated memory is still 79.7MB. Free memory was 56.1MB in the beginning and 50.8MB in the end (delta: 5.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2024-11-08 12:33:35,827 INFO L158 Benchmark]: Witness Printer took 175.00ms. Allocated memory is still 79.7MB. Free memory was 50.8MB in the beginning and 54.0MB in the end (delta: -3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 12:33:35,829 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.09ms. Allocated memory is still 44.0MB. Free memory was 27.8MB in the beginning and 27.8MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.37ms. Allocated memory is still 60.8MB. Free memory was 38.1MB in the beginning and 23.8MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.02ms. Allocated memory is still 60.8MB. Free memory was 41.7MB in the beginning and 39.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 83.69ms. Allocated memory is still 60.8MB. Free memory was 39.9MB in the beginning and 36.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1275.73ms. Allocated memory was 60.8MB in the beginning and 79.7MB in the end (delta: 18.9MB). Free memory was 36.9MB in the beginning and 56.9MB in the end (delta: -20.0MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2690.47ms. Allocated memory is still 79.7MB. Free memory was 56.1MB in the beginning and 50.8MB in the end (delta: 5.3MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 175.00ms. Allocated memory is still 79.7MB. Free memory was 50.8MB in the beginning and 54.0MB in the end (delta: -3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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: 2.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 20 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.3s 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 40 ConstructedInterpolants, 8 QuantifiedInterpolants, 399 SizeOfPredicates, 8 NumberOfNonLiveVariables, 154 ConjunctsInSsa, 27 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-08 12:33:35,884 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