./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-benchs/rlim_invariant.c.v+nlh-reducer.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 dab30decfbae0c46e4e194ef831d046546cde9953841ff8fbd0a15005d51c024 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:31:14,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:31:15,075 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:31:15,082 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:31:15,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:31:15,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:31:15,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:31:15,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:31:15,122 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:31:15,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:31:15,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:31:15,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:31:15,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:31:15,127 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:31:15,127 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:31:15,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:31:15,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:31:15,128 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:31:15,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:31:15,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:31:15,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:31:15,132 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:31:15,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:31:15,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:31:15,132 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:31:15,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:31:15,133 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:31:15,133 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:31:15,134 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:31:15,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:31:15,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:31:15,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:31:15,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:31:15,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:31:15,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:31:15,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:31:15,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:31:15,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:31:15,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:31:15,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:31:15,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:31:15,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:31:15,138 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 -> dab30decfbae0c46e4e194ef831d046546cde9953841ff8fbd0a15005d51c024 [2024-11-09 20:31:15,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:31:15,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:31:15,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:31:15,440 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:31:15,441 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:31:15,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2024-11-09 20:31:16,948 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:31:17,143 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:31:17,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2024-11-09 20:31:17,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db857c26/4ee25bbe89f545cc9e8518b58f92d7ff/FLAG769b1d714 [2024-11-09 20:31:17,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8db857c26/4ee25bbe89f545cc9e8518b58f92d7ff [2024-11-09 20:31:17,168 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:31:17,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:31:17,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:31:17,171 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:31:17,177 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:31:17,178 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3990d3de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17, skipping insertion in model container [2024-11-09 20:31:17,179 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,203 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:31:17,433 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-benchs/rlim_invariant.c.v+nlh-reducer.c[1545,1558] [2024-11-09 20:31:17,449 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-benchs/rlim_invariant.c.v+nlh-reducer.c[2749,2762] [2024-11-09 20:31:17,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:31:17,470 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:31:17,488 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-benchs/rlim_invariant.c.v+nlh-reducer.c[1545,1558] [2024-11-09 20:31:17,494 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-benchs/rlim_invariant.c.v+nlh-reducer.c[2749,2762] [2024-11-09 20:31:17,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:31:17,514 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:31:17,515 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17 WrapperNode [2024-11-09 20:31:17,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:31:17,516 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:31:17,516 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:31:17,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:31:17,524 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,552 INFO L138 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 173 [2024-11-09 20:31:17,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:31:17,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:31:17,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:31:17,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:31:17,564 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,564 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,566 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,578 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 20:31:17,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,583 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:31:17,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:31:17,589 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:31:17,589 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:31:17,590 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (1/1) ... [2024-11-09 20:31:17,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:31:17,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:31:17,630 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-09 20:31:17,633 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-09 20:31:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:31:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 20:31:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:31:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:31:17,768 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:31:17,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:31:18,044 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:31:18,045 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:31:18,045 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:31:18,045 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1; [2024-11-09 20:31:18,045 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1; [2024-11-09 20:31:18,045 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1; [2024-11-09 20:31:18,046 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1; [2024-11-09 20:31:18,046 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1; [2024-11-09 20:31:18,046 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:31:18,046 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:31:18,059 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-09 20:31:18,063 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:31:18,082 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:31:18,083 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:31:18,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:31:18 BoogieIcfgContainer [2024-11-09 20:31:18,084 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:31:18,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:31:18,087 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:31:18,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:31:18,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:31:17" (1/3) ... [2024-11-09 20:31:18,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77431de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:31:18, skipping insertion in model container [2024-11-09 20:31:18,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:17" (2/3) ... [2024-11-09 20:31:18,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77431de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:31:18, skipping insertion in model container [2024-11-09 20:31:18,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:31:18" (3/3) ... [2024-11-09 20:31:18,110 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+nlh-reducer.c [2024-11-09 20:31:18,128 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:31:18,129 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 20:31:18,210 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:31:18,216 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;@5588f437, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:31:18,216 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 20:31:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 47 states have internal predecessors, (71), 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-09 20:31:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 20:31:18,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:31:18,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:31:18,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:31:18,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:31:18,235 INFO L85 PathProgramCache]: Analyzing trace with hash 942177518, now seen corresponding path program 1 times [2024-11-09 20:31:18,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:31:18,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161378383] [2024-11-09 20:31:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:31:18,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:31:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:31:18,519 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-09 20:31:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:31:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161378383] [2024-11-09 20:31:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161378383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:31:18,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:31:18,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:31:18,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783870199] [2024-11-09 20:31:18,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:31:18,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:31:18,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:31:18,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:31:18,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:31:18,555 INFO L87 Difference]: Start difference. First operand has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 47 states have internal predecessors, (71), 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 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:18,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:31:18,649 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2024-11-09 20:31:18,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 20:31:18,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 20:31:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:31:18,662 INFO L225 Difference]: With dead ends: 57 [2024-11-09 20:31:18,663 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 20:31:18,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:31:18,670 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:31:18,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 220 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:31:18,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 20:31:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 20:31:18,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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-09 20:31:18,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-11-09 20:31:18,712 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2024-11-09 20:31:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:31:18,713 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-11-09 20:31:18,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:18,714 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-09 20:31:18,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 20:31:18,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:31:18,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:31:18,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 20:31:18,716 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:31:18,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:31:18,717 INFO L85 PathProgramCache]: Analyzing trace with hash 943160621, now seen corresponding path program 1 times [2024-11-09 20:31:18,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:31:18,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442187610] [2024-11-09 20:31:18,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:31:18,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:31:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:31:18,749 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 20:31:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 20:31:18,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 20:31:18,800 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 20:31:18,802 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2024-11-09 20:31:18,806 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-11-09 20:31:18,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 20:31:18,810 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 20:31:18,850 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 20:31:18,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 08:31:18 BoogieIcfgContainer [2024-11-09 20:31:18,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 20:31:18,857 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 20:31:18,857 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 20:31:18,858 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 20:31:18,858 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:31:18" (3/4) ... [2024-11-09 20:31:18,861 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-09 20:31:18,862 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 20:31:18,863 INFO L158 Benchmark]: Toolchain (without parser) took 1693.13ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 97.5MB in the beginning and 145.4MB in the end (delta: -47.9MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2024-11-09 20:31:18,863 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:31:18,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.68ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 83.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 20:31:18,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.03ms. Allocated memory is still 153.1MB. Free memory was 83.1MB in the beginning and 81.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:31:18,867 INFO L158 Benchmark]: Boogie Preprocessor took 34.25ms. Allocated memory is still 153.1MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 20:31:18,867 INFO L158 Benchmark]: IcfgBuilder took 494.90ms. Allocated memory is still 153.1MB. Free memory was 79.4MB in the beginning and 63.6MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-09 20:31:18,867 INFO L158 Benchmark]: TraceAbstraction took 770.62ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 63.0MB in the beginning and 145.4MB in the end (delta: -82.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:31:18,868 INFO L158 Benchmark]: Witness Printer took 4.78ms. Allocated memory is still 205.5MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 20:31:18,870 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.20ms. Allocated memory is still 153.1MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.68ms. Allocated memory is still 153.1MB. Free memory was 97.5MB in the beginning and 83.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.03ms. Allocated memory is still 153.1MB. Free memory was 83.1MB in the beginning and 81.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.25ms. Allocated memory is still 153.1MB. Free memory was 81.1MB in the beginning and 79.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 494.90ms. Allocated memory is still 153.1MB. Free memory was 79.4MB in the beginning and 63.6MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 770.62ms. Allocated memory was 153.1MB in the beginning and 205.5MB in the end (delta: 52.4MB). Free memory was 63.0MB in the beginning and 145.4MB in the end (delta: -82.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.78ms. Allocated memory is still 205.5MB. Free memory is still 145.4MB. 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: 70]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of to_real at line 27, overapproximation of someBinaryArithmeticFLOAToperation at line 54. Possible FailurePath: [L1] int __return_main; [L12] int __tmp_160_0; [L13] int __tmp_160_1; [L14] int __tmp_160_2; [L15] int __tmp_142_0; [L16] int __tmp_142_1; [L17] int __tmp_136_0; [L18] int __return_165; VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0] [L21] float main__X; [L22] float main__Y; [L23] float main__S; [L24] float main__R; [L25] float main__D; [L26] int main__i; [L27] main__Y = 0 [L28] main__i = 0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L29] COND TRUE main__i < 100000 [L31] main__X = __VERIFIER_nondet_float() [L32] main__D = __VERIFIER_nondet_float() [L33] int main____CPAchecker_TMP_0; VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L34] COND TRUE main__X >= -128.0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__i=0] [L36] COND TRUE main__X <= 128.0 [L38] main____CPAchecker_TMP_0 = 1 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L39] COND TRUE main____CPAchecker_TMP_0 != 0 [L41] int main____CPAchecker_TMP_1; VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L42] COND TRUE main__D >= 0.0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main__i=0] [L44] COND TRUE main__D <= 16.0 [L46] main____CPAchecker_TMP_1 = 1 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L47] COND TRUE main____CPAchecker_TMP_1 != 0 [L49] main__S = main__Y [L50] main__Y = main__X [L51] main__R = main__X - main__S VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main__Y=54, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L52] COND TRUE main__R <= (-main__D) [L54] main__Y = main__S - main__D VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L56] int main____CPAchecker_TMP_2; VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L57] COND FALSE !(main__Y >= -129.0) VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__i=0] [L216] main____CPAchecker_TMP_2 = 0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L64] int __tmp_1; [L65] __tmp_1 = main____CPAchecker_TMP_2 [L66] int __VERIFIER_assert__cond; [L67] __VERIFIER_assert__cond = __tmp_1 VAL [__VERIFIER_assert__cond=0, __return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L68] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] [L70] reach_error() VAL [__return_165=0, __return_main=0, __tmp_136_0=0, __tmp_142_0=0, __tmp_142_1=0, __tmp_160_0=0, __tmp_160_1=0, __tmp_160_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__i=0] - UnprovableResult [Line: 126]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 157 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 63 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 32 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 23 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-09 20:31:18,906 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-benchs/rlim_invariant.c.v+nlh-reducer.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 dab30decfbae0c46e4e194ef831d046546cde9953841ff8fbd0a15005d51c024 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:31:21,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:31:21,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 20:31:21,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:31:21,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:31:21,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:31:21,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:31:21,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:31:21,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:31:21,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:31:21,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:31:21,281 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:31:21,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:31:21,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:31:21,285 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:31:21,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:31:21,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:31:21,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:31:21,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:31:21,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:31:21,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:31:21,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:31:21,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:31:21,288 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 20:31:21,288 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 20:31:21,288 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:31:21,288 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 20:31:21,289 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:31:21,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:31:21,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:31:21,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:31:21,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:31:21,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:31:21,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:31:21,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:31:21,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:31:21,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:31:21,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:31:21,294 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 20:31:21,295 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 20:31:21,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:31:21,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:31:21,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:31:21,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:31:21,296 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 -> dab30decfbae0c46e4e194ef831d046546cde9953841ff8fbd0a15005d51c024 [2024-11-09 20:31:21,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:31:21,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:31:21,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:31:21,667 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:31:21,667 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:31:21,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2024-11-09 20:31:23,346 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:31:23,537 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:31:23,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/rlim_invariant.c.v+nlh-reducer.c [2024-11-09 20:31:23,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49f21c7e/5d751795f1c343a793afeb25d77a633d/FLAGa676204ee [2024-11-09 20:31:23,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49f21c7e/5d751795f1c343a793afeb25d77a633d [2024-11-09 20:31:23,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:31:23,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:31:23,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:31:23,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:31:23,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:31:23,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:23,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f073e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23, skipping insertion in model container [2024-11-09 20:31:23,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:23,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:31:23,799 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-benchs/rlim_invariant.c.v+nlh-reducer.c[1545,1558] [2024-11-09 20:31:23,817 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-benchs/rlim_invariant.c.v+nlh-reducer.c[2749,2762] [2024-11-09 20:31:23,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:31:23,850 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:31:23,882 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-benchs/rlim_invariant.c.v+nlh-reducer.c[1545,1558] [2024-11-09 20:31:23,893 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-benchs/rlim_invariant.c.v+nlh-reducer.c[2749,2762] [2024-11-09 20:31:23,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:31:23,929 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:31:23,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23 WrapperNode [2024-11-09 20:31:23,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:31:23,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:31:23,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:31:23,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:31:23,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:23,949 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:23,977 INFO L138 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 174 [2024-11-09 20:31:23,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:31:23,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:31:23,979 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:31:23,979 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:31:23,989 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:23,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:23,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:24,022 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 20:31:24,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:24,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:24,029 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:24,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:24,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:24,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:24,042 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:31:24,047 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:31:24,047 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:31:24,047 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:31:24,048 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (1/1) ... [2024-11-09 20:31:24,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:31:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:31:24,085 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-09 20:31:24,095 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-09 20:31:24,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:31:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 20:31:24,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:31:24,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:31:24,220 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:31:24,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:31:25,891 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:31:25,891 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:31:25,891 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L40: havoc main_~main____CPAchecker_TMP_1~0#1;havoc main_~main____CPAchecker_TMP_0~0#1; [2024-11-09 20:31:25,892 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1; [2024-11-09 20:31:25,892 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: havoc main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1;havoc main_~main____CPAchecker_TMP_2~1#1; [2024-11-09 20:31:25,892 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1; [2024-11-09 20:31:25,892 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1; [2024-11-09 20:31:25,892 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L95: havoc main_~main____CPAchecker_TMP_1~1#1;havoc main_~main____CPAchecker_TMP_0~1#1; [2024-11-09 20:31:25,892 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:31:25,892 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L63: havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; [2024-11-09 20:31:25,911 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-09 20:31:25,911 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:31:25,930 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:31:25,931 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:31:25,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:31:25 BoogieIcfgContainer [2024-11-09 20:31:25,933 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:31:25,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:31:25,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:31:25,941 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:31:25,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:31:23" (1/3) ... [2024-11-09 20:31:25,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a9c7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:31:25, skipping insertion in model container [2024-11-09 20:31:25,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:31:23" (2/3) ... [2024-11-09 20:31:25,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a9c7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:31:25, skipping insertion in model container [2024-11-09 20:31:25,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:31:25" (3/3) ... [2024-11-09 20:31:25,948 INFO L112 eAbstractionObserver]: Analyzing ICFG rlim_invariant.c.v+nlh-reducer.c [2024-11-09 20:31:25,965 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:31:25,965 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 20:31:26,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:31:26,031 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;@45a9c933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:31:26,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 20:31:26,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 47 states have internal predecessors, (71), 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-09 20:31:26,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 20:31:26,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:31:26,042 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:31:26,042 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:31:26,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:31:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash 942177518, now seen corresponding path program 1 times [2024-11-09 20:31:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:31:26,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707310819] [2024-11-09 20:31:26,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:31:26,065 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-09 20:31:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:31:26,069 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-09 20:31:26,070 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-09 20:31:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:31:26,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 20:31:26,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:31:26,274 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-09 20:31:26,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:31:26,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:31:26,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707310819] [2024-11-09 20:31:26,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707310819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:31:26,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:31:26,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 20:31:26,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855968828] [2024-11-09 20:31:26,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:31:26,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:31:26,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:31:26,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:31:26,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:31:26,303 INFO L87 Difference]: Start difference. First operand has 48 states, 45 states have (on average 1.5777777777777777) internal successors, (71), 47 states have internal predecessors, (71), 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 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:26,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:31:26,362 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2024-11-09 20:31:26,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:31:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 20:31:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:31:26,373 INFO L225 Difference]: With dead ends: 55 [2024-11-09 20:31:26,373 INFO L226 Difference]: Without dead ends: 43 [2024-11-09 20:31:26,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:31:26,381 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 1 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:31:26,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 187 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 20:31:26,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-09 20:31:26,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-09 20:31:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 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-09 20:31:26,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2024-11-09 20:31:26,415 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 16 [2024-11-09 20:31:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:31:26,415 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2024-11-09 20:31:26,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-09 20:31:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2024-11-09 20:31:26,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 20:31:26,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:31:26,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:31:26,424 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-09 20:31:26,617 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-09 20:31:26,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:31:26,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:31:26,618 INFO L85 PathProgramCache]: Analyzing trace with hash 943160621, now seen corresponding path program 1 times [2024-11-09 20:31:26,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:31:26,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500234654] [2024-11-09 20:31:26,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:31:26,619 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-09 20:31:26,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:31:26,622 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-09 20:31:26,623 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-09 20:31:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:31:26,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 20:31:26,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:31:31,296 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-09 20:31:31,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:31:31,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:31:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500234654] [2024-11-09 20:31:31,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500234654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:31:31,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:31:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 20:31:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488361972] [2024-11-09 20:31:31,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:31:31,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 20:31:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:31:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 20:31:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:31:31,301 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:31:35,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:39,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:43,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:48,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:53,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:31:59,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:32:04,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:32:06,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:32:10,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:32:12,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:32:17,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:32:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:32:18,733 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2024-11-09 20:32:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 20:32:18,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 20:32:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:32:18,741 INFO L225 Difference]: With dead ends: 92 [2024-11-09 20:32:18,741 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 20:32:18,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:32:18,742 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 91 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.4s IncrementalHoareTripleChecker+Time [2024-11-09 20:32:18,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 86 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 7 Unknown, 0 Unchecked, 47.4s Time] [2024-11-09 20:32:18,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 20:32:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 45. [2024-11-09 20:32:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 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-09 20:32:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2024-11-09 20:32:18,749 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 16 [2024-11-09 20:32:18,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:32:18,749 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2024-11-09 20:32:18,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:18,750 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2024-11-09 20:32:18,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 20:32:18,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:32:18,750 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:32:18,758 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-09 20:32:18,951 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-09 20:32:18,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:32:18,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:32:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash -854405218, now seen corresponding path program 1 times [2024-11-09 20:32:18,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:32:18,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080335198] [2024-11-09 20:32:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:32:18,953 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-09 20:32:18,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:32:18,956 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-09 20:32:18,960 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-09 20:32:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:32:19,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 20:32:19,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:32:26,599 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-09 20:32:26,600 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:32:26,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:32:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080335198] [2024-11-09 20:32:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080335198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:32:26,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:32:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 20:32:26,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178844889] [2024-11-09 20:32:26,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:32:26,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 20:32:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:32:26,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 20:32:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 20:32:26,603 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:32:37,141 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2024-11-09 20:32:37,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 20:32:37,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 20:32:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:32:37,147 INFO L225 Difference]: With dead ends: 87 [2024-11-09 20:32:37,147 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 20:32:37,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-09 20:32:37,148 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 80 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-09 20:32:37,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 87 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-11-09 20:32:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 20:32:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 46. [2024-11-09 20:32:37,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 45 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-09 20:32:37,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2024-11-09 20:32:37,161 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 17 [2024-11-09 20:32:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:32:37,161 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2024-11-09 20:32:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2024-11-09 20:32:37,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 20:32:37,163 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:32:37,163 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:32:37,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 20:32:37,363 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-09 20:32:37,364 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:32:37,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:32:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2021804445, now seen corresponding path program 1 times [2024-11-09 20:32:37,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:32:37,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185085079] [2024-11-09 20:32:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:32:37,366 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-09 20:32:37,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:32:37,368 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:32:37,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 20:32:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:32:37,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 20:32:37,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:32:41,559 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-09 20:32:41,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:32:41,559 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:32:41,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185085079] [2024-11-09 20:32:41,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185085079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:32:41,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:32:41,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 20:32:41,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078616317] [2024-11-09 20:32:41,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:32:41,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 20:32:41,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:32:41,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 20:32:41,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:32:41,562 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:53,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-09 20:32:54,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:32:54,778 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2024-11-09 20:32:54,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 20:32:54,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 20:32:54,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:32:54,784 INFO L225 Difference]: With dead ends: 95 [2024-11-09 20:32:54,784 INFO L226 Difference]: Without dead ends: 68 [2024-11-09 20:32:54,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 20:32:54,785 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 66 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-09 20:32:54,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 103 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-11-09 20:32:54,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-09 20:32:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2024-11-09 20:32:54,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 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-09 20:32:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2024-11-09 20:32:54,790 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 17 [2024-11-09 20:32:54,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:32:54,791 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2024-11-09 20:32:54,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:32:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2024-11-09 20:32:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 20:32:54,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:32:54,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:32:54,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 20:32:54,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 20:32:54,993 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:32:54,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:32:54,994 INFO L85 PathProgramCache]: Analyzing trace with hash -498155489, now seen corresponding path program 1 times [2024-11-09 20:32:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 20:32:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2044820132] [2024-11-09 20:32:54,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:32:54,994 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-09 20:32:54,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 20:32:54,995 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 20:32:54,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 20:32:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:32:55,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 20:32:55,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 20:32:58,262 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-09 20:32:58,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 20:32:58,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 20:32:58,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2044820132] [2024-11-09 20:32:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2044820132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:32:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:32:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 20:32:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104626752] [2024-11-09 20:32:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:32:58,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 20:32:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 20:32:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 20:32:58,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 20:32:58,265 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)