./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-cbmc-regression/float6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/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/floats-cbmc-regression/float6.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.graphml --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 fd27604fe9b1767824ea9ccd6f7ecdb4d002f9be3c28c3385ab6133c7bd8f97d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:31:46,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:31:46,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:31:46,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:31:46,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:31:46,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:31:46,568 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:31:46,569 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:31:46,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:31:46,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:31:46,571 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:31:46,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:31:46,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:31:46,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:31:46,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:31:46,575 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:31:46,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:31:46,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:31:46,577 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:31:46,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:31:46,579 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:31:46,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:31:46,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:31:46,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:31:46,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:31:46,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:31:46,596 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:31:46,596 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:31:46,597 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:31:46,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:31:46,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:31:46,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:31:46,599 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:31:46,600 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:31:46,600 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:31:46,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:31:46,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:31:46,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:31:46,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:31:46,602 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:31:46,603 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:31:46,604 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:31:46,604 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 13:31:46,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:31:46,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:31:46,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:31:46,623 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:31:46,623 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:31:46,623 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:31:46,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:31:46,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:31:46,624 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:31:46,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:31:46,625 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:31:46,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 13:31:46,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:31:46,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:31:46,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:31:46,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:31:46,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:31:46,626 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:31:46,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:31:46,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:31:46,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:31:46,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:31:46,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:31:46,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:31:46,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:31:46,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:31:46,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:31:46,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:31:46,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 13:31:46,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 13:31:46,628 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:31:46,628 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:31:46,629 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:31:46,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> fd27604fe9b1767824ea9ccd6f7ecdb4d002f9be3c28c3385ab6133c7bd8f97d [2022-07-19 13:31:46,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:31:46,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:31:46,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:31:46,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:31:46,841 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:31:46,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float6.c [2022-07-19 13:31:46,907 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bab8fecc0/ae89ffd62585488c8c2ebb4a7739c784/FLAG8d5a79f47 [2022-07-19 13:31:47,257 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:31:47,259 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c [2022-07-19 13:31:47,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bab8fecc0/ae89ffd62585488c8c2ebb4a7739c784/FLAG8d5a79f47 [2022-07-19 13:31:47,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bab8fecc0/ae89ffd62585488c8c2ebb4a7739c784 [2022-07-19 13:31:47,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:31:47,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:31:47,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:31:47,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:31:47,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:31:47,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20ce00aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47, skipping insertion in model container [2022-07-19 13:31:47,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,691 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:31:47,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:31:47,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[369,382] [2022-07-19 13:31:47,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[412,425] [2022-07-19 13:31:47,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[454,467] [2022-07-19 13:31:47,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[501,514] [2022-07-19 13:31:47,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[543,556] [2022-07-19 13:31:47,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[590,603] [2022-07-19 13:31:47,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[635,648] [2022-07-19 13:31:47,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[682,695] [2022-07-19 13:31:47,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[727,740] [2022-07-19 13:31:47,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[774,787] [2022-07-19 13:31:47,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[817,830] [2022-07-19 13:31:47,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[862,875] [2022-07-19 13:31:47,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[905,918] [2022-07-19 13:31:47,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[950,963] [2022-07-19 13:31:47,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[993,1006] [2022-07-19 13:31:47,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1041,1054] [2022-07-19 13:31:47,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1084,1097] [2022-07-19 13:31:47,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1132,1145] [2022-07-19 13:31:47,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1291,1304] [2022-07-19 13:31:47,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1330,1343] [2022-07-19 13:31:47,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1368,1381] [2022-07-19 13:31:47,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1411,1424] [2022-07-19 13:31:47,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1449,1462] [2022-07-19 13:31:47,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1492,1505] [2022-07-19 13:31:47,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1533,1546] [2022-07-19 13:31:47,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1576,1589] [2022-07-19 13:31:47,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1617,1630] [2022-07-19 13:31:47,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1660,1673] [2022-07-19 13:31:47,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1699,1712] [2022-07-19 13:31:47,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1740,1753] [2022-07-19 13:31:47,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1779,1792] [2022-07-19 13:31:47,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1820,1833] [2022-07-19 13:31:47,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1859,1872] [2022-07-19 13:31:47,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1903,1916] [2022-07-19 13:31:47,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1942,1955] [2022-07-19 13:31:47,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1986,1999] [2022-07-19 13:31:47,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:31:47,851 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:31:47,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[369,382] [2022-07-19 13:31:47,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[412,425] [2022-07-19 13:31:47,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[454,467] [2022-07-19 13:31:47,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[501,514] [2022-07-19 13:31:47,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[543,556] [2022-07-19 13:31:47,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[590,603] [2022-07-19 13:31:47,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[635,648] [2022-07-19 13:31:47,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[682,695] [2022-07-19 13:31:47,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[727,740] [2022-07-19 13:31:47,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[774,787] [2022-07-19 13:31:47,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[817,830] [2022-07-19 13:31:47,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[862,875] [2022-07-19 13:31:47,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[905,918] [2022-07-19 13:31:47,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[950,963] [2022-07-19 13:31:47,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[993,1006] [2022-07-19 13:31:47,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1041,1054] [2022-07-19 13:31:47,864 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1084,1097] [2022-07-19 13:31:47,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1132,1145] [2022-07-19 13:31:47,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1291,1304] [2022-07-19 13:31:47,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1330,1343] [2022-07-19 13:31:47,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1368,1381] [2022-07-19 13:31:47,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1411,1424] [2022-07-19 13:31:47,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1449,1462] [2022-07-19 13:31:47,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1492,1505] [2022-07-19 13:31:47,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1533,1546] [2022-07-19 13:31:47,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1576,1589] [2022-07-19 13:31:47,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1617,1630] [2022-07-19 13:31:47,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1660,1673] [2022-07-19 13:31:47,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1699,1712] [2022-07-19 13:31:47,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1740,1753] [2022-07-19 13:31:47,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1779,1792] [2022-07-19 13:31:47,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1820,1833] [2022-07-19 13:31:47,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1859,1872] [2022-07-19 13:31:47,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1903,1916] [2022-07-19 13:31:47,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1942,1955] [2022-07-19 13:31:47,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1986,1999] [2022-07-19 13:31:47,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:31:47,885 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:31:47,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47 WrapperNode [2022-07-19 13:31:47,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:31:47,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:31:47,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:31:47,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:31:47,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,941 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2022-07-19 13:31:47,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:31:47,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:31:47,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:31:47,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:31:47,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:31:47,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:31:47,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:31:47,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:31:47,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (1/1) ... [2022-07-19 13:31:47,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:31:47,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:31:48,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 13:31:48,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 13:31:48,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:31:48,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:31:48,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:31:48,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 13:31:48,092 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:31:48,093 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:31:48,317 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:31:48,322 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:31:48,322 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 13:31:48,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:31:48 BoogieIcfgContainer [2022-07-19 13:31:48,324 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:31:48,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:31:48,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:31:48,327 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:31:48,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:31:47" (1/3) ... [2022-07-19 13:31:48,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b46acf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:31:48, skipping insertion in model container [2022-07-19 13:31:48,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:47" (2/3) ... [2022-07-19 13:31:48,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b46acf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:31:48, skipping insertion in model container [2022-07-19 13:31:48,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:31:48" (3/3) ... [2022-07-19 13:31:48,330 INFO L111 eAbstractionObserver]: Analyzing ICFG float6.c [2022-07-19 13:31:48,340 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:31:48,340 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-07-19 13:31:48,388 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:31:48,395 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5616d547, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@508ef15b [2022-07-19 13:31:48,395 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-07-19 13:31:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 78 states have (on average 1.935897435897436) internal successors, (151), 114 states have internal predecessors, (151), 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) [2022-07-19 13:31:48,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-19 13:31:48,410 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:48,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-19 13:31:48,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:48,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:48,416 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-07-19 13:31:48,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:31:48,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704145357] [2022-07-19 13:31:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:48,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:31:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:31:48,484 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 13:31:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:31:48,510 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 13:31:48,511 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 13:31:48,512 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (35 of 36 remaining) [2022-07-19 13:31:48,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (34 of 36 remaining) [2022-07-19 13:31:48,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (33 of 36 remaining) [2022-07-19 13:31:48,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (32 of 36 remaining) [2022-07-19 13:31:48,514 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (31 of 36 remaining) [2022-07-19 13:31:48,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (30 of 36 remaining) [2022-07-19 13:31:48,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (29 of 36 remaining) [2022-07-19 13:31:48,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (28 of 36 remaining) [2022-07-19 13:31:48,515 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (27 of 36 remaining) [2022-07-19 13:31:48,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (26 of 36 remaining) [2022-07-19 13:31:48,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (25 of 36 remaining) [2022-07-19 13:31:48,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (24 of 36 remaining) [2022-07-19 13:31:48,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (23 of 36 remaining) [2022-07-19 13:31:48,516 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (22 of 36 remaining) [2022-07-19 13:31:48,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (21 of 36 remaining) [2022-07-19 13:31:48,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (20 of 36 remaining) [2022-07-19 13:31:48,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (19 of 36 remaining) [2022-07-19 13:31:48,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (18 of 36 remaining) [2022-07-19 13:31:48,517 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (17 of 36 remaining) [2022-07-19 13:31:48,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (16 of 36 remaining) [2022-07-19 13:31:48,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (15 of 36 remaining) [2022-07-19 13:31:48,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (14 of 36 remaining) [2022-07-19 13:31:48,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (13 of 36 remaining) [2022-07-19 13:31:48,518 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (12 of 36 remaining) [2022-07-19 13:31:48,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (11 of 36 remaining) [2022-07-19 13:31:48,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (10 of 36 remaining) [2022-07-19 13:31:48,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (9 of 36 remaining) [2022-07-19 13:31:48,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (8 of 36 remaining) [2022-07-19 13:31:48,519 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (7 of 36 remaining) [2022-07-19 13:31:48,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (6 of 36 remaining) [2022-07-19 13:31:48,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (5 of 36 remaining) [2022-07-19 13:31:48,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (4 of 36 remaining) [2022-07-19 13:31:48,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (3 of 36 remaining) [2022-07-19 13:31:48,520 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (2 of 36 remaining) [2022-07-19 13:31:48,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (1 of 36 remaining) [2022-07-19 13:31:48,521 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (0 of 36 remaining) [2022-07-19 13:31:48,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 13:31:48,524 INFO L356 BasicCegarLoop]: Path program histogram: [1] [2022-07-19 13:31:48,527 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 13:31:48,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 01:31:48 BoogieIcfgContainer [2022-07-19 13:31:48,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 13:31:48,538 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 13:31:48,538 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 13:31:48,538 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 13:31:48,538 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:31:48" (3/4) ... [2022-07-19 13:31:48,540 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 13:31:48,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 13:31:48,542 INFO L158 Benchmark]: Toolchain (without parser) took 861.34ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 59.7MB in the beginning and 54.5MB in the end (delta: 5.1MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2022-07-19 13:31:48,542 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:31:48,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.90ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 59.5MB in the beginning and 86.0MB in the end (delta: -26.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 13:31:48,545 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.21ms. Allocated memory is still 115.3MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:31:48,546 INFO L158 Benchmark]: Boogie Preprocessor took 37.05ms. Allocated memory is still 115.3MB. Free memory was 84.4MB in the beginning and 82.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:31:48,547 INFO L158 Benchmark]: RCFGBuilder took 343.29ms. Allocated memory is still 115.3MB. Free memory was 82.8MB in the beginning and 70.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 13:31:48,548 INFO L158 Benchmark]: TraceAbstraction took 212.65ms. Allocated memory is still 115.3MB. Free memory was 70.0MB in the beginning and 55.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 13:31:48,549 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 115.3MB. Free memory was 55.1MB in the beginning and 54.5MB in the end (delta: 549.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:31:48,554 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 92.3MB. Free memory is still 48.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.90ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 59.5MB in the beginning and 86.0MB in the end (delta: -26.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.21ms. Allocated memory is still 115.3MB. Free memory was 86.0MB in the beginning and 84.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.05ms. Allocated memory is still 115.3MB. Free memory was 84.4MB in the beginning and 82.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.29ms. Allocated memory is still 115.3MB. Free memory was 82.8MB in the beginning and 70.6MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 212.65ms. Allocated memory is still 115.3MB. Free memory was 70.0MB in the beginning and 55.1MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 115.3MB. Free memory was 55.1MB in the beginning and 54.5MB in the end (delta: 549.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 9]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 9. Possible FailurePath: [L9] COND TRUE !(1.0!=2.0) [L9] reach_error() - UnprovableResult [Line: 10]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 11]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 14]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 15]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 21]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 26]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 38]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 42]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 43]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 44]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 46]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 47]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 48]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 49]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 4 NumberOfCodeBlocks, 4 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 [2022-07-19 13:31:48,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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: /usr/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/floats-cbmc-regression/float6.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.graphml --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 fd27604fe9b1767824ea9ccd6f7ecdb4d002f9be3c28c3385ab6133c7bd8f97d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:31:50,364 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:31:50,366 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:31:50,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:31:50,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:31:50,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:31:50,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:31:50,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:31:50,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:31:50,413 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:31:50,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:31:50,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:31:50,418 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:31:50,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:31:50,420 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:31:50,422 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:31:50,423 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:31:50,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:31:50,425 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:31:50,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:31:50,430 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:31:50,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:31:50,432 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:31:50,433 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:31:50,434 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:31:50,439 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:31:50,440 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:31:50,440 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:31:50,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:31:50,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:31:50,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:31:50,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:31:50,443 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:31:50,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:31:50,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:31:50,445 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:31:50,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:31:50,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:31:50,446 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:31:50,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:31:50,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:31:50,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:31:50,452 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 13:31:50,477 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:31:50,477 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:31:50,477 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:31:50,478 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:31:50,478 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:31:50,478 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:31:50,479 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:31:50,479 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:31:50,479 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:31:50,480 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:31:50,480 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:31:50,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:31:50,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:31:50,480 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:31:50,481 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:31:50,481 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:31:50,481 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 13:31:50,481 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 13:31:50,481 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 13:31:50,481 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:31:50,482 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:31:50,482 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:31:50,482 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:31:50,482 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:31:50,482 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:31:50,482 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:31:50,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:31:50,483 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:31:50,483 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:31:50,483 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:31:50,483 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 13:31:50,483 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 13:31:50,483 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:31:50,484 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:31:50,484 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:31:50,484 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 13:31:50,484 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> fd27604fe9b1767824ea9ccd6f7ecdb4d002f9be3c28c3385ab6133c7bd8f97d [2022-07-19 13:31:50,754 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:31:50,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:31:50,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:31:50,778 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:31:50,778 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:31:50,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-cbmc-regression/float6.c [2022-07-19 13:31:50,836 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13af6acd/7739d7f1674440a2964fa816140a5b84/FLAGa1f90aaac [2022-07-19 13:31:51,213 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:31:51,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c [2022-07-19 13:31:51,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13af6acd/7739d7f1674440a2964fa816140a5b84/FLAGa1f90aaac [2022-07-19 13:31:51,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c13af6acd/7739d7f1674440a2964fa816140a5b84 [2022-07-19 13:31:51,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:31:51,684 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:31:51,686 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:31:51,686 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:31:51,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:31:51,690 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e20be7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51, skipping insertion in model container [2022-07-19 13:31:51,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:31:51,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:31:51,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[369,382] [2022-07-19 13:31:51,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[412,425] [2022-07-19 13:31:51,800 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[454,467] [2022-07-19 13:31:51,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[501,514] [2022-07-19 13:31:51,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[543,556] [2022-07-19 13:31:51,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[590,603] [2022-07-19 13:31:51,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[635,648] [2022-07-19 13:31:51,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[682,695] [2022-07-19 13:31:51,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[727,740] [2022-07-19 13:31:51,803 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[774,787] [2022-07-19 13:31:51,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[817,830] [2022-07-19 13:31:51,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[862,875] [2022-07-19 13:31:51,804 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[905,918] [2022-07-19 13:31:51,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[950,963] [2022-07-19 13:31:51,805 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[993,1006] [2022-07-19 13:31:51,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1041,1054] [2022-07-19 13:31:51,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1084,1097] [2022-07-19 13:31:51,807 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1132,1145] [2022-07-19 13:31:51,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1291,1304] [2022-07-19 13:31:51,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1330,1343] [2022-07-19 13:31:51,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1368,1381] [2022-07-19 13:31:51,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1411,1424] [2022-07-19 13:31:51,812 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1449,1462] [2022-07-19 13:31:51,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1492,1505] [2022-07-19 13:31:51,813 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1533,1546] [2022-07-19 13:31:51,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1576,1589] [2022-07-19 13:31:51,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1617,1630] [2022-07-19 13:31:51,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1660,1673] [2022-07-19 13:31:51,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1699,1712] [2022-07-19 13:31:51,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1740,1753] [2022-07-19 13:31:51,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1779,1792] [2022-07-19 13:31:51,816 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1820,1833] [2022-07-19 13:31:51,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1859,1872] [2022-07-19 13:31:51,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1903,1916] [2022-07-19 13:31:51,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1942,1955] [2022-07-19 13:31:51,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1986,1999] [2022-07-19 13:31:51,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:31:51,850 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:31:51,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[369,382] [2022-07-19 13:31:51,862 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[412,425] [2022-07-19 13:31:51,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[454,467] [2022-07-19 13:31:51,865 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[501,514] [2022-07-19 13:31:51,866 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[543,556] [2022-07-19 13:31:51,867 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[590,603] [2022-07-19 13:31:51,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[635,648] [2022-07-19 13:31:51,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[682,695] [2022-07-19 13:31:51,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[727,740] [2022-07-19 13:31:51,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[774,787] [2022-07-19 13:31:51,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[817,830] [2022-07-19 13:31:51,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[862,875] [2022-07-19 13:31:51,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[905,918] [2022-07-19 13:31:51,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[950,963] [2022-07-19 13:31:51,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[993,1006] [2022-07-19 13:31:51,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1041,1054] [2022-07-19 13:31:51,881 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1084,1097] [2022-07-19 13:31:51,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1132,1145] [2022-07-19 13:31:51,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1291,1304] [2022-07-19 13:31:51,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1330,1343] [2022-07-19 13:31:51,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1368,1381] [2022-07-19 13:31:51,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1411,1424] [2022-07-19 13:31:51,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1449,1462] [2022-07-19 13:31:51,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1492,1505] [2022-07-19 13:31:51,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1533,1546] [2022-07-19 13:31:51,894 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1576,1589] [2022-07-19 13:31:51,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1617,1630] [2022-07-19 13:31:51,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1660,1673] [2022-07-19 13:31:51,895 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1699,1712] [2022-07-19 13:31:51,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1740,1753] [2022-07-19 13:31:51,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1779,1792] [2022-07-19 13:31:51,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1820,1833] [2022-07-19 13:31:51,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1859,1872] [2022-07-19 13:31:51,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1903,1916] [2022-07-19 13:31:51,898 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1942,1955] [2022-07-19 13:31:51,899 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-cbmc-regression/float6.c[1986,1999] [2022-07-19 13:31:51,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:31:51,909 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:31:51,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51 WrapperNode [2022-07-19 13:31:51,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:31:51,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:31:51,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:31:51,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:31:51,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,936 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,951 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2022-07-19 13:31:51,952 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:31:51,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:31:51,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:31:51,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:31:51,958 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,969 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:31:51,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:31:51,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:31:51,989 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:31:51,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (1/1) ... [2022-07-19 13:31:51,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:31:52,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:31:52,027 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 13:31:52,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 13:31:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:31:52,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:31:52,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:31:52,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 13:31:52,097 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:31:52,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:31:52,309 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:31:52,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:31:52,314 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 13:31:52,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:31:52 BoogieIcfgContainer [2022-07-19 13:31:52,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:31:52,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:31:52,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:31:52,320 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:31:52,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:31:51" (1/3) ... [2022-07-19 13:31:52,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158c2678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:31:52, skipping insertion in model container [2022-07-19 13:31:52,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:51" (2/3) ... [2022-07-19 13:31:52,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158c2678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:31:52, skipping insertion in model container [2022-07-19 13:31:52,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:31:52" (3/3) ... [2022-07-19 13:31:52,323 INFO L111 eAbstractionObserver]: Analyzing ICFG float6.c [2022-07-19 13:31:52,333 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:31:52,334 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2022-07-19 13:31:52,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:31:52,374 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1de294ce, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c9ebacb [2022-07-19 13:31:52,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2022-07-19 13:31:52,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 78 states have (on average 1.935897435897436) internal successors, (151), 114 states have internal predecessors, (151), 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) [2022-07-19 13:31:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-19 13:31:52,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:52,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-19 13:31:52,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:52,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:52,387 INFO L85 PathProgramCache]: Analyzing trace with hash 925604, now seen corresponding path program 1 times [2022-07-19 13:31:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:52,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255110637] [2022-07-19 13:31:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:52,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:52,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:52,399 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:52,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 13:31:52,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:52,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 13:31:52,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:52,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:52,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:52,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255110637] [2022-07-19 13:31:52,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255110637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:52,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:52,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 13:31:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86578549] [2022-07-19 13:31:52,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:52,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 13:31:52,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:52,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 13:31:52,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 13:31:52,507 INFO L87 Difference]: Start difference. First operand has 115 states, 78 states have (on average 1.935897435897436) internal successors, (151), 114 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2022-07-19 13:31:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:52,530 INFO L93 Difference]: Finished difference Result 183 states and 254 transitions. [2022-07-19 13:31:52,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 13:31:52,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2022-07-19 13:31:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:52,537 INFO L225 Difference]: With dead ends: 183 [2022-07-19 13:31:52,537 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 13:31:52,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 13:31:52,542 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:52,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:31:52,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 13:31:52,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-19 13:31:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 67 states have internal predecessors, (67), 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) [2022-07-19 13:31:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 67 transitions. [2022-07-19 13:31:52,569 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 67 transitions. Word has length 4 [2022-07-19 13:31:52,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:52,569 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 67 transitions. [2022-07-19 13:31:52,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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) [2022-07-19 13:31:52,570 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 67 transitions. [2022-07-19 13:31:52,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 13:31:52,570 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:52,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:52,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 13:31:52,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:52,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:52,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash 271685265, now seen corresponding path program 1 times [2022-07-19 13:31:52,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:52,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243553914] [2022-07-19 13:31:52,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:52,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:52,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:52,784 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:52,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 13:31:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:52,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:52,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:52,911 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:52,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:52,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243553914] [2022-07-19 13:31:52,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243553914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:52,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:52,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:52,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763453733] [2022-07-19 13:31:52,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:52,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:52,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:52,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:52,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:52,919 INFO L87 Difference]: Start difference. First operand 68 states and 67 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-07-19 13:31:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:52,926 INFO L93 Difference]: Finished difference Result 68 states and 67 transitions. [2022-07-19 13:31:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-07-19 13:31:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:52,927 INFO L225 Difference]: With dead ends: 68 [2022-07-19 13:31:52,927 INFO L226 Difference]: Without dead ends: 66 [2022-07-19 13:31:52,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:52,928 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:52,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-07-19 13:31:52,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-19 13:31:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-19 13:31:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 65 states have internal predecessors, (65), 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) [2022-07-19 13:31:52,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 65 transitions. [2022-07-19 13:31:52,932 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 65 transitions. Word has length 24 [2022-07-19 13:31:52,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:52,932 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 65 transitions. [2022-07-19 13:31:52,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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) [2022-07-19 13:31:52,933 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 65 transitions. [2022-07-19 13:31:52,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 13:31:52,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:52,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:52,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:53,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:53,142 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:53,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:53,144 INFO L85 PathProgramCache]: Analyzing trace with hash -167687151, now seen corresponding path program 1 times [2022-07-19 13:31:53,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:53,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601730735] [2022-07-19 13:31:53,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:53,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:53,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:53,147 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:53,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 13:31:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:53,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:31:53,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:53,231 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:53,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:53,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601730735] [2022-07-19 13:31:53,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601730735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:53,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:53,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:53,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645413695] [2022-07-19 13:31:53,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:53,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:53,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:53,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:53,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:53,232 INFO L87 Difference]: Start difference. First operand 66 states and 65 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2022-07-19 13:31:53,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:53,235 INFO L93 Difference]: Finished difference Result 66 states and 65 transitions. [2022-07-19 13:31:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:53,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-07-19 13:31:53,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:53,236 INFO L225 Difference]: With dead ends: 66 [2022-07-19 13:31:53,236 INFO L226 Difference]: Without dead ends: 64 [2022-07-19 13:31:53,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:53,237 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:53,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-07-19 13:31:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-19 13:31:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-19 13:31:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 63 states have internal predecessors, (63), 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) [2022-07-19 13:31:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 63 transitions. [2022-07-19 13:31:53,243 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 63 transitions. Word has length 25 [2022-07-19 13:31:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:53,244 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 63 transitions. [2022-07-19 13:31:53,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) [2022-07-19 13:31:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 63 transitions. [2022-07-19 13:31:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 13:31:53,244 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:53,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:53,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:53,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:53,459 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:53,460 INFO L85 PathProgramCache]: Analyzing trace with hash -903330151, now seen corresponding path program 1 times [2022-07-19 13:31:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:53,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098971213] [2022-07-19 13:31:53,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:53,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:53,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:53,465 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:53,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 13:31:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:53,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:53,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:53,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:53,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:53,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098971213] [2022-07-19 13:31:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098971213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:53,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890604007] [2022-07-19 13:31:53,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:53,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:53,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:53,525 INFO L87 Difference]: Start difference. First operand 64 states and 63 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2022-07-19 13:31:53,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:53,527 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2022-07-19 13:31:53,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:53,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-07-19 13:31:53,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:53,528 INFO L225 Difference]: With dead ends: 64 [2022-07-19 13:31:53,528 INFO L226 Difference]: Without dead ends: 62 [2022-07-19 13:31:53,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:53,529 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:53,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2022-07-19 13:31:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-19 13:31:53,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-07-19 13:31:53,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.196078431372549) internal successors, (61), 61 states have internal predecessors, (61), 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) [2022-07-19 13:31:53,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 61 transitions. [2022-07-19 13:31:53,532 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 61 transitions. Word has length 26 [2022-07-19 13:31:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:53,532 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 61 transitions. [2022-07-19 13:31:53,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) [2022-07-19 13:31:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 61 transitions. [2022-07-19 13:31:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 13:31:53,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:53,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:53,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:53,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:53,739 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2061540633, now seen corresponding path program 1 times [2022-07-19 13:31:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:53,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1326389069] [2022-07-19 13:31:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:53,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:53,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:53,742 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:53,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 13:31:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:53,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:53,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:53,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:53,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1326389069] [2022-07-19 13:31:53,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1326389069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:53,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:53,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:53,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393625589] [2022-07-19 13:31:53,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:53,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:53,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:53,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:53,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:53,851 INFO L87 Difference]: Start difference. First operand 62 states and 61 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-07-19 13:31:53,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:53,853 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2022-07-19 13:31:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:53,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-07-19 13:31:53,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:53,854 INFO L225 Difference]: With dead ends: 62 [2022-07-19 13:31:53,854 INFO L226 Difference]: Without dead ends: 60 [2022-07-19 13:31:53,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:53,855 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:53,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 29 Unchecked, 0.0s Time] [2022-07-19 13:31:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-19 13:31:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-07-19 13:31:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 50 states have (on average 1.18) internal successors, (59), 59 states have internal predecessors, (59), 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) [2022-07-19 13:31:53,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 59 transitions. [2022-07-19 13:31:53,858 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 59 transitions. Word has length 27 [2022-07-19 13:31:53,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:53,859 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 59 transitions. [2022-07-19 13:31:53,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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) [2022-07-19 13:31:53,859 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 59 transitions. [2022-07-19 13:31:53,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 13:31:53,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:53,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:53,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:54,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:54,067 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:54,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:54,068 INFO L85 PathProgramCache]: Analyzing trace with hash -516745567, now seen corresponding path program 1 times [2022-07-19 13:31:54,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:54,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069279476] [2022-07-19 13:31:54,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:54,068 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:54,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:54,070 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:54,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 13:31:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:54,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:54,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:54,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:54,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:54,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:54,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069279476] [2022-07-19 13:31:54,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069279476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:54,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:54,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:54,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300573915] [2022-07-19 13:31:54,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:54,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:54,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:54,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:54,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:54,139 INFO L87 Difference]: Start difference. First operand 60 states and 59 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2022-07-19 13:31:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:54,142 INFO L93 Difference]: Finished difference Result 60 states and 59 transitions. [2022-07-19 13:31:54,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:54,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-07-19 13:31:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:54,142 INFO L225 Difference]: With dead ends: 60 [2022-07-19 13:31:54,143 INFO L226 Difference]: Without dead ends: 58 [2022-07-19 13:31:54,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:54,143 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:54,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-07-19 13:31:54,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-19 13:31:54,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-07-19 13:31:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.163265306122449) internal successors, (57), 57 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) [2022-07-19 13:31:54,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 57 transitions. [2022-07-19 13:31:54,146 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 57 transitions. Word has length 28 [2022-07-19 13:31:54,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:54,146 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 57 transitions. [2022-07-19 13:31:54,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2022-07-19 13:31:54,147 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 57 transitions. [2022-07-19 13:31:54,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 13:31:54,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:54,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:54,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:54,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:54,363 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:54,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:54,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1160760865, now seen corresponding path program 1 times [2022-07-19 13:31:54,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:54,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040192993] [2022-07-19 13:31:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:54,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:54,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:54,365 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:54,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 13:31:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:54,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:54,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:54,470 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:54,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:54,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040192993] [2022-07-19 13:31:54,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1040192993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:54,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:54,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:54,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296215083] [2022-07-19 13:31:54,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:54,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:54,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:54,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:54,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:54,472 INFO L87 Difference]: Start difference. First operand 58 states and 57 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2022-07-19 13:31:54,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:54,474 INFO L93 Difference]: Finished difference Result 58 states and 57 transitions. [2022-07-19 13:31:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-07-19 13:31:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:54,475 INFO L225 Difference]: With dead ends: 58 [2022-07-19 13:31:54,475 INFO L226 Difference]: Without dead ends: 56 [2022-07-19 13:31:54,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:54,476 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:54,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2022-07-19 13:31:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-19 13:31:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-19 13:31:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 55 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) [2022-07-19 13:31:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 55 transitions. [2022-07-19 13:31:54,479 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 55 transitions. Word has length 29 [2022-07-19 13:31:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:54,479 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 55 transitions. [2022-07-19 13:31:54,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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) [2022-07-19 13:31:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 55 transitions. [2022-07-19 13:31:54,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 13:31:54,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:54,480 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:54,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:54,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:54,688 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:54,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:54,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1367099065, now seen corresponding path program 1 times [2022-07-19 13:31:54,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:54,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820729388] [2022-07-19 13:31:54,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:54,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:54,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:54,690 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:54,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 13:31:54,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:54,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:31:54,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:54,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:54,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:54,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:54,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820729388] [2022-07-19 13:31:54,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820729388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:54,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:54,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:54,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712524431] [2022-07-19 13:31:54,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:54,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:54,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:54,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:54,780 INFO L87 Difference]: Start difference. First operand 56 states and 55 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:54,782 INFO L93 Difference]: Finished difference Result 56 states and 55 transitions. [2022-07-19 13:31:54,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:54,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 13:31:54,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:54,782 INFO L225 Difference]: With dead ends: 56 [2022-07-19 13:31:54,782 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 13:31:54,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:54,783 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:54,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-07-19 13:31:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 13:31:54,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-19 13:31:54,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.127659574468085) internal successors, (53), 53 states have internal predecessors, (53), 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) [2022-07-19 13:31:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 53 transitions. [2022-07-19 13:31:54,797 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 53 transitions. Word has length 34 [2022-07-19 13:31:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:54,798 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 53 transitions. [2022-07-19 13:31:54,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 53 transitions. [2022-07-19 13:31:54,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 13:31:54,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:54,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:54,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:55,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:55,001 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:55,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash -569597639, now seen corresponding path program 1 times [2022-07-19 13:31:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:55,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258744310] [2022-07-19 13:31:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:55,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:55,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:55,003 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:55,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 13:31:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:55,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:31:55,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:55,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:55,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:55,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258744310] [2022-07-19 13:31:55,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258744310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:55,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:55,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:55,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136036654] [2022-07-19 13:31:55,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:55,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:55,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:55,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:55,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:55,094 INFO L87 Difference]: Start difference. First operand 54 states and 53 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2022-07-19 13:31:55,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:55,096 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2022-07-19 13:31:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:55,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2022-07-19 13:31:55,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:55,097 INFO L225 Difference]: With dead ends: 54 [2022-07-19 13:31:55,097 INFO L226 Difference]: Without dead ends: 52 [2022-07-19 13:31:55,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:55,098 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:55,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-07-19 13:31:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-19 13:31:55,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-19 13:31:55,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 46 states have (on average 1.108695652173913) internal successors, (51), 51 states have internal predecessors, (51), 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) [2022-07-19 13:31:55,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 51 transitions. [2022-07-19 13:31:55,101 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 51 transitions. Word has length 35 [2022-07-19 13:31:55,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:55,101 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 51 transitions. [2022-07-19 13:31:55,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2022-07-19 13:31:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 51 transitions. [2022-07-19 13:31:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 13:31:55,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:55,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:55,111 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:55,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:55,312 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash -477653311, now seen corresponding path program 1 times [2022-07-19 13:31:55,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:55,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953632874] [2022-07-19 13:31:55,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:55,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:55,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:55,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:55,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 13:31:55,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:55,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:31:55,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:55,426 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:55,426 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:55,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953632874] [2022-07-19 13:31:55,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953632874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:55,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:55,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:55,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549451677] [2022-07-19 13:31:55,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:55,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:55,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:55,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:55,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:55,427 INFO L87 Difference]: Start difference. First operand 52 states and 51 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2022-07-19 13:31:55,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:55,429 INFO L93 Difference]: Finished difference Result 52 states and 51 transitions. [2022-07-19 13:31:55,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:55,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 36 [2022-07-19 13:31:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:55,430 INFO L225 Difference]: With dead ends: 52 [2022-07-19 13:31:55,430 INFO L226 Difference]: Without dead ends: 50 [2022-07-19 13:31:55,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:55,430 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:55,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-19 13:31:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-19 13:31:55,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-19 13:31:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0888888888888888) internal successors, (49), 49 states have internal predecessors, (49), 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) [2022-07-19 13:31:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 49 transitions. [2022-07-19 13:31:55,433 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 49 transitions. Word has length 36 [2022-07-19 13:31:55,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:55,433 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 49 transitions. [2022-07-19 13:31:55,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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) [2022-07-19 13:31:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 49 transitions. [2022-07-19 13:31:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 13:31:55,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:55,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:55,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:55,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:55,646 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:55,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:55,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1922346431, now seen corresponding path program 1 times [2022-07-19 13:31:55,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:55,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542086904] [2022-07-19 13:31:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:55,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:55,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:55,668 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:55,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-19 13:31:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:55,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:31:55,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:55,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:55,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:55,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542086904] [2022-07-19 13:31:55,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542086904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:55,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:55,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:55,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986519395] [2022-07-19 13:31:55,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:55,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:55,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:55,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:55,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:55,794 INFO L87 Difference]: Start difference. First operand 50 states and 49 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-07-19 13:31:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:55,798 INFO L93 Difference]: Finished difference Result 50 states and 49 transitions. [2022-07-19 13:31:55,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:55,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 37 [2022-07-19 13:31:55,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:55,799 INFO L225 Difference]: With dead ends: 50 [2022-07-19 13:31:55,799 INFO L226 Difference]: Without dead ends: 48 [2022-07-19 13:31:55,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:55,800 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:55,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-07-19 13:31:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-19 13:31:55,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-07-19 13:31:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 47 states have internal predecessors, (47), 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) [2022-07-19 13:31:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 47 transitions. [2022-07-19 13:31:55,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 47 transitions. Word has length 37 [2022-07-19 13:31:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:55,805 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 47 transitions. [2022-07-19 13:31:55,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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) [2022-07-19 13:31:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 47 transitions. [2022-07-19 13:31:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 13:31:55,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:55,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:55,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:56,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:56,040 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:56,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash 536807113, now seen corresponding path program 1 times [2022-07-19 13:31:56,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:56,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774911743] [2022-07-19 13:31:56,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:56,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:56,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:56,042 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:56,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-19 13:31:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:56,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:56,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:56,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:56,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774911743] [2022-07-19 13:31:56,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774911743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:56,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:56,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876304036] [2022-07-19 13:31:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:56,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:56,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:56,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:56,153 INFO L87 Difference]: Start difference. First operand 48 states and 47 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2022-07-19 13:31:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:56,154 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2022-07-19 13:31:56,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:56,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 38 [2022-07-19 13:31:56,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:56,154 INFO L225 Difference]: With dead ends: 48 [2022-07-19 13:31:56,154 INFO L226 Difference]: Without dead ends: 46 [2022-07-19 13:31:56,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:56,155 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:56,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-07-19 13:31:56,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-19 13:31:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-19 13:31:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.0465116279069768) internal successors, (45), 45 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 45 transitions. [2022-07-19 13:31:56,156 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 45 transitions. Word has length 38 [2022-07-19 13:31:56,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:56,157 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 45 transitions. [2022-07-19 13:31:56,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2022-07-19 13:31:56,157 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 45 transitions. [2022-07-19 13:31:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 13:31:56,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:56,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:56,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:56,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:56,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:56,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:56,365 INFO L85 PathProgramCache]: Analyzing trace with hash -538844343, now seen corresponding path program 1 times [2022-07-19 13:31:56,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:56,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986493830] [2022-07-19 13:31:56,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:56,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:56,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:56,366 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:56,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-19 13:31:56,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:56,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:56,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:56,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:56,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:56,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:56,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986493830] [2022-07-19 13:31:56,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986493830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:56,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:56,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:56,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206949026] [2022-07-19 13:31:56,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:56,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:56,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:56,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:56,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:56,489 INFO L87 Difference]: Start difference. First operand 46 states and 45 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2022-07-19 13:31:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:56,490 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2022-07-19 13:31:56,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:56,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 39 [2022-07-19 13:31:56,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:56,490 INFO L225 Difference]: With dead ends: 46 [2022-07-19 13:31:56,490 INFO L226 Difference]: Without dead ends: 44 [2022-07-19 13:31:56,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:56,491 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:56,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-07-19 13:31:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-19 13:31:56,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-19 13:31:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 43 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2022-07-19 13:31:56,492 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 39 [2022-07-19 13:31:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:56,492 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2022-07-19 13:31:56,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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) [2022-07-19 13:31:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2022-07-19 13:31:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-19 13:31:56,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:56,493 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:56,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:56,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:56,700 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:56,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:56,700 INFO L85 PathProgramCache]: Analyzing trace with hash 475698897, now seen corresponding path program 1 times [2022-07-19 13:31:56,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:56,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55014940] [2022-07-19 13:31:56,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:56,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:56,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:56,702 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:56,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-19 13:31:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:56,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:56,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:56,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:56,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:56,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:56,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55014940] [2022-07-19 13:31:56,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55014940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:56,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:56,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:56,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78544774] [2022-07-19 13:31:56,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:56,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:56,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:56,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:56,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:56,828 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) [2022-07-19 13:31:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:56,829 INFO L93 Difference]: Finished difference Result 44 states and 43 transitions. [2022-07-19 13:31:56,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:56,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 40 [2022-07-19 13:31:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:56,829 INFO L225 Difference]: With dead ends: 44 [2022-07-19 13:31:56,829 INFO L226 Difference]: Without dead ends: 42 [2022-07-19 13:31:56,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:56,830 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:56,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-07-19 13:31:56,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-19 13:31:56,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-19 13:31:56,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0) internal successors, (41), 41 states have internal predecessors, (41), 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) [2022-07-19 13:31:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2022-07-19 13:31:56,832 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 40 [2022-07-19 13:31:56,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:56,832 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2022-07-19 13:31:56,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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) [2022-07-19 13:31:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2022-07-19 13:31:56,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-19 13:31:56,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:56,833 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:56,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:57,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:57,040 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 33 more)] === [2022-07-19 13:31:57,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1861768273, now seen corresponding path program 1 times [2022-07-19 13:31:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:31:57,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103588336] [2022-07-19 13:31:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:57,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:31:57,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:31:57,041 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:31:57,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-19 13:31:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:57,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:57,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:57,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:57,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:31:57,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:31:57,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103588336] [2022-07-19 13:31:57,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103588336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:57,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:57,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:57,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926006761] [2022-07-19 13:31:57,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:57,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:57,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:31:57,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:57,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:57,209 INFO L87 Difference]: Start difference. First operand 42 states and 41 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-07-19 13:31:57,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:57,209 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2022-07-19 13:31:57,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:57,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 41 [2022-07-19 13:31:57,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:57,210 INFO L225 Difference]: With dead ends: 42 [2022-07-19 13:31:57,210 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 13:31:57,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:57,210 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:57,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-07-19 13:31:57,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 13:31:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 13:31:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:57,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 13:31:57,211 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-07-19 13:31:57,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:57,212 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 13:31:57,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2022-07-19 13:31:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 13:31:57,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (35 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (34 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (33 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (32 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (31 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (30 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION (29 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION (28 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION (27 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION (26 of 36 remaining) [2022-07-19 13:31:57,214 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION (25 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION (24 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION (23 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION (22 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION (21 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION (20 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION (19 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION (18 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION (17 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION (16 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION (15 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION (14 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION (13 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION (12 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION (11 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION (10 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION (9 of 36 remaining) [2022-07-19 13:31:57,215 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION (8 of 36 remaining) [2022-07-19 13:31:57,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION (7 of 36 remaining) [2022-07-19 13:31:57,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION (6 of 36 remaining) [2022-07-19 13:31:57,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION (5 of 36 remaining) [2022-07-19 13:31:57,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION (4 of 36 remaining) [2022-07-19 13:31:57,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION (3 of 36 remaining) [2022-07-19 13:31:57,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION (2 of 36 remaining) [2022-07-19 13:31:57,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION (1 of 36 remaining) [2022-07-19 13:31:57,216 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION (0 of 36 remaining) [2022-07-19 13:31:57,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:57,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:31:57,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 13:31:57,420 INFO L899 garLoopResultBuilder]: For program point L35-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,420 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 42) no Hoare annotation was computed. [2022-07-19 13:31:57,420 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 10) no Hoare annotation was computed. [2022-07-19 13:31:57,420 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2022-07-19 13:31:57,420 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L36(line 36) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L36-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L20-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L21(line 21) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L38-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L22-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 26) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr33ASSERT_VIOLATIONERROR_FUNCTION(line 47) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L23(line 23) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L23-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2022-07-19 13:31:57,421 INFO L899 garLoopResultBuilder]: For program point L40-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 38) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L24(line 24) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L24-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 33) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L41(line 41) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L41-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr35ASSERT_VIOLATIONERROR_FUNCTION(line 49) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L25-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 32) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr34ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L9-1(line 9) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L9-3(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr29ASSERT_VIOLATIONERROR_FUNCTION(line 43) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L26(line 26) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L26-2(line 26) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 22) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2022-07-19 13:31:57,422 INFO L899 garLoopResultBuilder]: For program point L10(line 10) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L44(line 44) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L44-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L11-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 34) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 24) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L45-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr31ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr30ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 23) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L46-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L13-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L30-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,423 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L47-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L14-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L48-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L15-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr32ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L32-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 41) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L33-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L17-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 40) no Hoare annotation was computed. [2022-07-19 13:31:57,424 INFO L899 garLoopResultBuilder]: For program point L34-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-07-19 13:31:57,425 INFO L899 garLoopResultBuilder]: For program point L18(line 18) no Hoare annotation was computed. [2022-07-19 13:31:57,425 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 7 50) no Hoare annotation was computed. [2022-07-19 13:31:57,425 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 35) no Hoare annotation was computed. [2022-07-19 13:31:57,425 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-07-19 13:31:57,427 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:57,429 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 13:31:57,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 01:31:57 BoogieIcfgContainer [2022-07-19 13:31:57,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 13:31:57,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 13:31:57,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 13:31:57,433 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 13:31:57,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:31:52" (3/4) ... [2022-07-19 13:31:57,438 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 13:31:57,448 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-07-19 13:31:57,450 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 13:31:57,451 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 13:31:57,451 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 13:31:57,478 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 13:31:57,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 13:31:57,479 INFO L158 Benchmark]: Toolchain (without parser) took 5795.60ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 41.2MB in the beginning and 41.6MB in the end (delta: -450.2kB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-07-19 13:31:57,479 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 42.5MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:31:57,480 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.51ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 41.1MB in the end (delta: -17.7kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-19 13:31:57,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.72ms. Allocated memory is still 60.8MB. Free memory was 40.9MB in the beginning and 39.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:31:57,480 INFO L158 Benchmark]: Boogie Preprocessor took 35.92ms. Allocated memory is still 60.8MB. Free memory was 39.1MB in the beginning and 37.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:31:57,480 INFO L158 Benchmark]: RCFGBuilder took 328.26ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 37.4MB in the beginning and 54.5MB in the end (delta: -17.0MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-07-19 13:31:57,481 INFO L158 Benchmark]: TraceAbstraction took 5113.52ms. Allocated memory is still 73.4MB. Free memory was 54.0MB in the beginning and 45.8MB in the end (delta: 8.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-07-19 13:31:57,481 INFO L158 Benchmark]: Witness Printer took 46.83ms. Allocated memory is still 73.4MB. Free memory was 45.8MB in the beginning and 41.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 13:31:57,482 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 60.8MB. Free memory was 42.5MB in the beginning and 42.5MB in the end (delta: 49.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.51ms. Allocated memory is still 60.8MB. Free memory was 41.0MB in the beginning and 41.1MB in the end (delta: -17.7kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.72ms. Allocated memory is still 60.8MB. Free memory was 40.9MB in the beginning and 39.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.92ms. Allocated memory is still 60.8MB. Free memory was 39.1MB in the beginning and 37.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 328.26ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 37.4MB in the beginning and 54.5MB in the end (delta: -17.0MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 5113.52ms. Allocated memory is still 73.4MB. Free memory was 54.0MB in the beginning and 45.8MB in the end (delta: 8.2MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Witness Printer took 46.83ms. Allocated memory is still 73.4MB. Free memory was 45.8MB in the beginning and 41.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 9]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 10]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 12]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 15]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 22]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 23]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 24]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 25]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 26]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 32]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 33]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 34]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 35]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 36]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 37]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 38]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 39]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 40]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 41]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 42]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 43]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 44]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 45]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 46]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 47]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 48]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 49]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 115 locations, 36 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 1035 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 341 IncrementalHoareTripleChecker+Unchecked, 369 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 666 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 434 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 0 LocationsWithAnnotation, 0 PreInvPairs, 0 NumberOfFragments, 0 HoareAnnotationTreeSize, 0 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 0 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 463 NumberOfCodeBlocks, 463 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 448 ConstructedInterpolants, 137 QuantifiedInterpolants, 1643 SizeOfPredicates, 37 NumberOfNonLiveVariables, 701 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 36 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-19 13:31:57,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE