./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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/forester-heap/dll-queue-2.i -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 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:41:04,508 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:41:04,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:41:04,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:41:04,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:41:04,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:41:04,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:41:04,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:41:04,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:41:04,554 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:41:04,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:41:04,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:41:04,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:41:04,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:41:04,558 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:41:04,560 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:41:04,561 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:41:04,562 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:41:04,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:41:04,568 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:41:04,569 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:41:04,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:41:04,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:41:04,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:41:04,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:41:04,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:41:04,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:41:04,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:41:04,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:41:04,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:41:04,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:41:04,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:41:04,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:41:04,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:41:04,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:41:04,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:41:04,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:41:04,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:41:04,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:41:04,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:41:04,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:41:04,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:41:04,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:41:04,609 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:41:04,610 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:41:04,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:41:04,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:41:04,610 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:41:04,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:41:04,611 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:41:04,611 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:41:04,611 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:41:04,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:41:04,612 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:41:04,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:41:04,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:41:04,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:41:04,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:41:04,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:41:04,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:41:04,613 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:41:04,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:41:04,613 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:41:04,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:41:04,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:41:04,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:41:04,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:41:04,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:41:04,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:41:04,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:41:04,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:41:04,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:41:04,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:41:04,615 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:41:04,615 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:41:04,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:41:04,615 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 -> 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 [2022-07-22 14:41:04,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:41:04,789 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:41:04,791 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:41:04,792 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:41:04,793 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:41:04,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-queue-2.i [2022-07-22 14:41:04,855 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fed77b5/7ebb6394f2224345a2a7557daa51958c/FLAGd7982a0ec [2022-07-22 14:41:05,228 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:41:05,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2022-07-22 14:41:05,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fed77b5/7ebb6394f2224345a2a7557daa51958c/FLAGd7982a0ec [2022-07-22 14:41:05,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6fed77b5/7ebb6394f2224345a2a7557daa51958c [2022-07-22 14:41:05,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:41:05,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:41:05,641 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:41:05,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:41:05,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:41:05,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:05,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63db722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05, skipping insertion in model container [2022-07-22 14:41:05,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:05,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:41:05,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[22460,22473] [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[22531,22544] [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[22605,22618] [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[22697,22710] [2022-07-22 14:41:05,878 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/forester-heap/dll-queue-2.i[22774,22787] [2022-07-22 14:41:05,879 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/forester-heap/dll-queue-2.i[22869,22882] [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[22946,22959] [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[23029,23042] [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[23124,23137] [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[23201,23214] [2022-07-22 14:41:05,887 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/forester-heap/dll-queue-2.i[23284,23297] [2022-07-22 14:41:05,888 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/forester-heap/dll-queue-2.i[23373,23386] [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[23459,23472] [2022-07-22 14:41:05,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/forester-heap/dll-queue-2.i[23604,23617] [2022-07-22 14:41:05,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:41:05,903 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:41:05,927 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/forester-heap/dll-queue-2.i[22460,22473] [2022-07-22 14:41:05,928 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/forester-heap/dll-queue-2.i[22531,22544] [2022-07-22 14:41:05,928 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/forester-heap/dll-queue-2.i[22605,22618] [2022-07-22 14:41:05,929 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/forester-heap/dll-queue-2.i[22697,22710] [2022-07-22 14:41:05,929 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/forester-heap/dll-queue-2.i[22774,22787] [2022-07-22 14:41:05,929 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/forester-heap/dll-queue-2.i[22869,22882] [2022-07-22 14:41:05,930 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/forester-heap/dll-queue-2.i[22946,22959] [2022-07-22 14:41:05,930 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/forester-heap/dll-queue-2.i[23029,23042] [2022-07-22 14:41:05,931 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/forester-heap/dll-queue-2.i[23124,23137] [2022-07-22 14:41:05,931 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/forester-heap/dll-queue-2.i[23201,23214] [2022-07-22 14:41:05,932 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/forester-heap/dll-queue-2.i[23284,23297] [2022-07-22 14:41:05,933 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/forester-heap/dll-queue-2.i[23373,23386] [2022-07-22 14:41:05,933 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/forester-heap/dll-queue-2.i[23459,23472] [2022-07-22 14:41:05,934 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/forester-heap/dll-queue-2.i[23604,23617] [2022-07-22 14:41:05,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:41:05,953 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:41:05,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05 WrapperNode [2022-07-22 14:41:05,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:41:05,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:41:05,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:41:05,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:41:05,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:05,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:05,986 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2022-07-22 14:41:05,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:41:05,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:41:05,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:41:05,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:41:05,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:05,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:05,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:05,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:06,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:06,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:06,013 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:06,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:41:06,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:41:06,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:41:06,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:41:06,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (1/1) ... [2022-07-22 14:41:06,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:41:06,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:41:06,042 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-22 14:41:06,043 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-22 14:41:06,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 14:41:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 14:41:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:41:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:41:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:41:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:41:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:41:06,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:41:06,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:41:06,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:41:06,169 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:41:06,170 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:41:06,362 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:41:06,367 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:41:06,367 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-22 14:41:06,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:41:06 BoogieIcfgContainer [2022-07-22 14:41:06,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:41:06,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:41:06,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:41:06,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:41:06,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:41:05" (1/3) ... [2022-07-22 14:41:06,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258f0f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:41:06, skipping insertion in model container [2022-07-22 14:41:06,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:05" (2/3) ... [2022-07-22 14:41:06,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258f0f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:41:06, skipping insertion in model container [2022-07-22 14:41:06,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:41:06" (3/3) ... [2022-07-22 14:41:06,375 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2022-07-22 14:41:06,385 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:41:06,385 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-07-22 14:41:06,418 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:41:06,423 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@404ea9bf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@46607992 [2022-07-22 14:41:06,423 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-07-22 14:41:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 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-22 14:41:06,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-22 14:41:06,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:06,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-22 14:41:06,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:06,438 INFO L85 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2022-07-22 14:41:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:41:06,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712795854] [2022-07-22 14:41:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:06,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:41:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:06,541 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-22 14:41:06,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:41:06,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712795854] [2022-07-22 14:41:06,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712795854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:06,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:06,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:41:06,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224587315] [2022-07-22 14:41:06,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:06,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:41:06,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:41:06,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:41:06,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:41:06,566 INFO L87 Difference]: Start difference. First operand has 85 states, 70 states have (on average 2.0) internal successors, (140), 84 states have internal predecessors, (140), 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.5) internal successors, (5), 2 states have internal predecessors, (5), 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-22 14:41:06,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:06,588 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2022-07-22 14:41:06,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:41:06,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-07-22 14:41:06,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:06,597 INFO L225 Difference]: With dead ends: 168 [2022-07-22 14:41:06,597 INFO L226 Difference]: Without dead ends: 80 [2022-07-22 14:41:06,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:41:06,604 INFO L413 NwaCegarLoop]: 95 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, 95 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-22 14:41:06,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-22 14:41:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-22 14:41:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.3484848484848484) internal successors, (89), 79 states have internal predecessors, (89), 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-22 14:41:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-22 14:41:06,637 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2022-07-22 14:41:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:06,638 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-22 14:41:06,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-22 14:41:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-22 14:41:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-22 14:41:06,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:06,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-22 14:41:06,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:41:06,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:06,641 INFO L85 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2022-07-22 14:41:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:41:06,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540717146] [2022-07-22 14:41:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:41:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:06,713 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-22 14:41:06,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:41:06,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540717146] [2022-07-22 14:41:06,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540717146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:06,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:06,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:41:06,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834213528] [2022-07-22 14:41:06,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:06,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:41:06,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:41:06,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:41:06,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:41:06,719 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-22 14:41:06,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:06,755 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-22 14:41:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:41:06,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-07-22 14:41:06,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:06,757 INFO L225 Difference]: With dead ends: 80 [2022-07-22 14:41:06,758 INFO L226 Difference]: Without dead ends: 70 [2022-07-22 14:41:06,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 14:41:06,759 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 75 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:06,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 67 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-22 14:41:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-22 14:41:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 69 states have internal predecessors, (79), 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-22 14:41:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-07-22 14:41:06,770 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2022-07-22 14:41:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:06,770 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-07-22 14:41:06,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-22 14:41:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-07-22 14:41:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 14:41:06,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:06,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:06,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:41:06,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:06,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2022-07-22 14:41:06,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:41:06,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140578072] [2022-07-22 14:41:06,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:06,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:41:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:06,931 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-22 14:41:06,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:41:06,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140578072] [2022-07-22 14:41:06,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140578072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:06,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:06,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:41:06,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906036899] [2022-07-22 14:41:06,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:06,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:41:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:41:06,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:41:06,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:41:06,934 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:07,023 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2022-07-22 14:41:07,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 14:41:07,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 14:41:07,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:07,025 INFO L225 Difference]: With dead ends: 119 [2022-07-22 14:41:07,026 INFO L226 Difference]: Without dead ends: 117 [2022-07-22 14:41:07,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:41:07,026 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 159 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:07,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 124 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-22 14:41:07,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 68. [2022-07-22 14:41:07,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 67 states have internal predecessors, (77), 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-22 14:41:07,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-22 14:41:07,034 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2022-07-22 14:41:07,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:07,034 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-22 14:41:07,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:07,034 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-22 14:41:07,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 14:41:07,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:07,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:07,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 14:41:07,035 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:07,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:07,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2022-07-22 14:41:07,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:41:07,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673314240] [2022-07-22 14:41:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:07,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:41:07,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:07,076 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-22 14:41:07,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:41:07,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673314240] [2022-07-22 14:41:07,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673314240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:07,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:07,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:41:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573682648] [2022-07-22 14:41:07,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:07,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:41:07,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:41:07,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:41:07,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:41:07,080 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:07,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:07,100 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2022-07-22 14:41:07,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:41:07,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 14:41:07,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:07,102 INFO L225 Difference]: With dead ends: 153 [2022-07-22 14:41:07,102 INFO L226 Difference]: Without dead ends: 87 [2022-07-22 14:41:07,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 14:41:07,106 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:07,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:07,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-22 14:41:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2022-07-22 14:41:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 75 states have internal predecessors, (86), 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-22 14:41:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-22 14:41:07,116 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2022-07-22 14:41:07,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:07,116 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-22 14:41:07,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-22 14:41:07,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 14:41:07,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:07,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:07,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-22 14:41:07,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:07,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:07,118 INFO L85 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2022-07-22 14:41:07,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:41:07,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576035514] [2022-07-22 14:41:07,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:07,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:41:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:07,159 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-22 14:41:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:41:07,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576035514] [2022-07-22 14:41:07,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576035514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:07,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:07,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 14:41:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306265668] [2022-07-22 14:41:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:07,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 14:41:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:41:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 14:41:07,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:41:07,161 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:07,227 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-07-22 14:41:07,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:41:07,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-22 14:41:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:07,228 INFO L225 Difference]: With dead ends: 91 [2022-07-22 14:41:07,228 INFO L226 Difference]: Without dead ends: 71 [2022-07-22 14:41:07,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-22 14:41:07,229 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:07,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 265 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:07,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-22 14:41:07,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-22 14:41:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 63 states have (on average 1.253968253968254) internal successors, (79), 70 states have internal predecessors, (79), 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-22 14:41:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-07-22 14:41:07,232 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2022-07-22 14:41:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:07,233 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-07-22 14:41:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-07-22 14:41:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-22 14:41:07,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:07,234 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:07,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-22 14:41:07,234 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:07,235 INFO L85 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2022-07-22 14:41:07,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:41:07,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992628865] [2022-07-22 14:41:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:07,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:41:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:07,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:41:07,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992628865] [2022-07-22 14:41:07,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992628865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:41:07,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552196637] [2022-07-22 14:41:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:41:07,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:41:07,314 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:41:07,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-22 14:41:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:07,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-22 14:41:07,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:07,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:41:07,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-07-22 14:41:07,596 INFO L356 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-07-22 14:41:07,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 53 [2022-07-22 14:41:07,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-22 14:41:07,612 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:41:07,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-22 14:41:07,652 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:41:07,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-22 14:41:07,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-22 14:41:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:07,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:41:07,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_285 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-22 14:41:07,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:07,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-07-22 14:41:07,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:07,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 225 [2022-07-22 14:41:07,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 204 treesize of output 192 [2022-07-22 14:41:07,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 188 [2022-07-22 14:41:07,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 180 [2022-07-22 14:41:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:07,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552196637] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:41:07,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 14:41:07,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-07-22 14:41:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801569886] [2022-07-22 14:41:07,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 14:41:07,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 14:41:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:41:07,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 14:41:07,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2022-07-22 14:41:07,932 INFO L87 Difference]: Start difference. First operand 71 states and 79 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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-22 14:41:08,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:08,050 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2022-07-22 14:41:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:41:08,050 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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 19 [2022-07-22 14:41:08,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:08,052 INFO L225 Difference]: With dead ends: 144 [2022-07-22 14:41:08,052 INFO L226 Difference]: Without dead ends: 142 [2022-07-22 14:41:08,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=79, Unknown=1, NotChecked=18, Total=132 [2022-07-22 14:41:08,054 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 186 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:08,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 400 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 95 Unchecked, 0.1s Time] [2022-07-22 14:41:08,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-22 14:41:08,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2022-07-22 14:41:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 76 states have (on average 1.236842105263158) internal successors, (94), 83 states have internal predecessors, (94), 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-22 14:41:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-07-22 14:41:08,067 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2022-07-22 14:41:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:08,067 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-07-22 14:41:08,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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-22 14:41:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-07-22 14:41:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-22 14:41:08,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:08,069 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:08,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:41:08,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-22 14:41:08,283 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:08,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2022-07-22 14:41:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:41:08,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093674710] [2022-07-22 14:41:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:41:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:08,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:08,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:41:08,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093674710] [2022-07-22 14:41:08,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093674710] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:08,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:08,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:41:08,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917781159] [2022-07-22 14:41:08,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:08,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:41:08,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:41:08,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:41:08,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:41:08,314 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:08,332 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2022-07-22 14:41:08,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:41:08,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-22 14:41:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:08,333 INFO L225 Difference]: With dead ends: 174 [2022-07-22 14:41:08,333 INFO L226 Difference]: Without dead ends: 108 [2022-07-22 14:41:08,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 14:41:08,334 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 24 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:08,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 127 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:08,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-22 14:41:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-07-22 14:41:08,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 89 states have (on average 1.202247191011236) internal successors, (107), 96 states have internal predecessors, (107), 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-22 14:41:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-07-22 14:41:08,337 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2022-07-22 14:41:08,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:08,337 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-07-22 14:41:08,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-07-22 14:41:08,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-22 14:41:08,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:08,339 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:08,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-22 14:41:08,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:08,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:08,339 INFO L85 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2022-07-22 14:41:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:41:08,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093099196] [2022-07-22 14:41:08,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:08,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:41:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-22 14:41:08,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:41:08,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093099196] [2022-07-22 14:41:08,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093099196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:08,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:08,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:41:08,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67418870] [2022-07-22 14:41:08,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:08,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:41:08,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:41:08,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:41:08,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:41:08,379 INFO L87 Difference]: Start difference. First operand 97 states and 107 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-22 14:41:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:08,399 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2022-07-22 14:41:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:41:08,400 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 27 [2022-07-22 14:41:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:08,401 INFO L225 Difference]: With dead ends: 201 [2022-07-22 14:41:08,401 INFO L226 Difference]: Without dead ends: 122 [2022-07-22 14:41:08,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-22 14:41:08,402 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 30 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:08,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 142 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:08,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-22 14:41:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-07-22 14:41:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 109 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-07-22 14:41:08,405 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2022-07-22 14:41:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:08,405 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-07-22 14:41:08,405 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-22 14:41:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-07-22 14:41:08,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 14:41:08,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:08,406 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:08,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-22 14:41:08,407 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2022-07-22 14:41:08,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:41:08,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723922829] [2022-07-22 14:41:08,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:08,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:41:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:08,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:41:08,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723922829] [2022-07-22 14:41:08,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723922829] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 14:41:08,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752611380] [2022-07-22 14:41:08,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:08,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 14:41:08,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:41:08,570 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 14:41:08,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-22 14:41:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:08,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-22 14:41:08,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:08,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:41:08,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-07-22 14:41:08,736 INFO L356 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-07-22 14:41:08,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 61 [2022-07-22 14:41:08,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-07-22 14:41:08,751 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-22 14:41:08,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-22 14:41:08,783 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:41:08,784 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2022-07-22 14:41:08,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:08,860 INFO L356 Elim1Store]: treesize reduction 104, result has 13.3 percent of original size [2022-07-22 14:41:08,861 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-22 14:41:08,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-22 14:41:09,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-22 14:41:09,087 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_32| input size 51 context size 51 output size 51 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:284) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-22 14:41:09,091 INFO L158 Benchmark]: Toolchain (without parser) took 3456.14ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 82.3MB in the beginning and 61.8MB in the end (delta: 20.5MB). Peak memory consumption was 49.8MB. Max. memory is 16.1GB. [2022-07-22 14:41:09,091 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 77.6MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:41:09,091 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.34ms. Allocated memory is still 115.3MB. Free memory was 82.1MB in the beginning and 81.7MB in the end (delta: 333.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:41:09,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.34ms. Allocated memory is still 115.3MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:41:09,092 INFO L158 Benchmark]: Boogie Preprocessor took 27.55ms. Allocated memory is still 115.3MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:41:09,092 INFO L158 Benchmark]: RCFGBuilder took 353.93ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 59.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-22 14:41:09,092 INFO L158 Benchmark]: TraceAbstraction took 2720.26ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 58.6MB in the beginning and 61.8MB in the end (delta: -3.2MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-07-22 14:41:09,094 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.16ms. Allocated memory is still 77.6MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.34ms. Allocated memory is still 115.3MB. Free memory was 82.1MB in the beginning and 81.7MB in the end (delta: 333.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.34ms. Allocated memory is still 115.3MB. Free memory was 81.1MB in the beginning and 79.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.55ms. Allocated memory is still 115.3MB. Free memory was 79.0MB in the beginning and 76.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 353.93ms. Allocated memory is still 115.3MB. Free memory was 76.9MB in the beginning and 59.2MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2720.26ms. Allocated memory was 115.3MB in the beginning and 144.7MB in the end (delta: 29.4MB). Free memory was 58.6MB in the beginning and 61.8MB in the end (delta: -3.2MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_32| input size 51 context size 51 output size 51 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_32| input size 51 context size 51 output size 51: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-22 14:41:09,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /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/forester-heap/dll-queue-2.i -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 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:41:10,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:41:10,817 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:41:10,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:41:10,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:41:10,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:41:10,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:41:10,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:41:10,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:41:10,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:41:10,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:41:10,859 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:41:10,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:41:10,861 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:41:10,862 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:41:10,865 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:41:10,866 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:41:10,867 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:41:10,869 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:41:10,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:41:10,875 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:41:10,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:41:10,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:41:10,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:41:10,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:41:10,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:41:10,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:41:10,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:41:10,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:41:10,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:41:10,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:41:10,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:41:10,889 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:41:10,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:41:10,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:41:10,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:41:10,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:41:10,893 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:41:10,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:41:10,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:41:10,894 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:41:10,895 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:41:10,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:41:10,935 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:41:10,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:41:10,935 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:41:10,936 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:41:10,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:41:10,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:41:10,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:41:10,937 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:41:10,938 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:41:10,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:41:10,938 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:41:10,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:41:10,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:41:10,939 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:41:10,939 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:41:10,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:41:10,940 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:41:10,940 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:41:10,940 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:41:10,940 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:41:10,940 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:41:10,941 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:41:10,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:41:10,941 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:41:10,941 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:41:10,941 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:41:10,941 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:41:10,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:41:10,942 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:41:10,942 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:41:10,942 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:41:10,943 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:41:10,943 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:41:10,943 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:41:10,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:41:10,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:41:10,944 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 -> 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 [2022-07-22 14:41:11,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:41:11,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:41:11,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:41:11,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:41:11,231 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:41:11,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-queue-2.i [2022-07-22 14:41:11,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380612f77/956344c422ce4fd69c6e5e72bbdb0f48/FLAGd1e728639 [2022-07-22 14:41:11,706 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:41:11,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2022-07-22 14:41:11,719 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380612f77/956344c422ce4fd69c6e5e72bbdb0f48/FLAGd1e728639 [2022-07-22 14:41:11,734 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/380612f77/956344c422ce4fd69c6e5e72bbdb0f48 [2022-07-22 14:41:11,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:41:11,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:41:11,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:41:11,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:41:11,742 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:41:11,743 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:41:11" (1/1) ... [2022-07-22 14:41:11,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae743c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:11, skipping insertion in model container [2022-07-22 14:41:11,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:41:11" (1/1) ... [2022-07-22 14:41:11,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:41:11,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:41:12,034 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/forester-heap/dll-queue-2.i[22460,22473] [2022-07-22 14:41:12,038 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/forester-heap/dll-queue-2.i[22531,22544] [2022-07-22 14:41:12,039 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/forester-heap/dll-queue-2.i[22605,22618] [2022-07-22 14:41:12,040 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/forester-heap/dll-queue-2.i[22697,22710] [2022-07-22 14:41:12,041 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/forester-heap/dll-queue-2.i[22774,22787] [2022-07-22 14:41:12,042 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/forester-heap/dll-queue-2.i[22869,22882] [2022-07-22 14:41:12,044 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/forester-heap/dll-queue-2.i[22946,22959] [2022-07-22 14:41:12,045 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/forester-heap/dll-queue-2.i[23029,23042] [2022-07-22 14:41:12,046 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/forester-heap/dll-queue-2.i[23124,23137] [2022-07-22 14:41:12,048 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/forester-heap/dll-queue-2.i[23201,23214] [2022-07-22 14:41:12,049 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/forester-heap/dll-queue-2.i[23284,23297] [2022-07-22 14:41:12,049 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/forester-heap/dll-queue-2.i[23373,23386] [2022-07-22 14:41:12,050 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/forester-heap/dll-queue-2.i[23459,23472] [2022-07-22 14:41:12,052 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/forester-heap/dll-queue-2.i[23604,23617] [2022-07-22 14:41:12,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:41:12,067 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:41:12,097 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/forester-heap/dll-queue-2.i[22460,22473] [2022-07-22 14:41:12,097 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/forester-heap/dll-queue-2.i[22531,22544] [2022-07-22 14:41:12,099 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/forester-heap/dll-queue-2.i[22605,22618] [2022-07-22 14:41:12,099 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/forester-heap/dll-queue-2.i[22697,22710] [2022-07-22 14:41:12,100 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/forester-heap/dll-queue-2.i[22774,22787] [2022-07-22 14:41:12,100 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/forester-heap/dll-queue-2.i[22869,22882] [2022-07-22 14:41:12,101 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/forester-heap/dll-queue-2.i[22946,22959] [2022-07-22 14:41:12,101 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/forester-heap/dll-queue-2.i[23029,23042] [2022-07-22 14:41:12,102 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/forester-heap/dll-queue-2.i[23124,23137] [2022-07-22 14:41:12,102 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/forester-heap/dll-queue-2.i[23201,23214] [2022-07-22 14:41:12,103 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/forester-heap/dll-queue-2.i[23284,23297] [2022-07-22 14:41:12,103 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/forester-heap/dll-queue-2.i[23373,23386] [2022-07-22 14:41:12,104 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/forester-heap/dll-queue-2.i[23459,23472] [2022-07-22 14:41:12,105 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/forester-heap/dll-queue-2.i[23604,23617] [2022-07-22 14:41:12,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:41:12,123 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:41:12,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12 WrapperNode [2022-07-22 14:41:12,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:41:12,124 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:41:12,124 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:41:12,124 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:41:12,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,164 INFO L137 Inliner]: procedures = 122, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 217 [2022-07-22 14:41:12,165 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:41:12,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:41:12,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:41:12,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:41:12,171 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,178 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,190 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,192 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:41:12,193 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:41:12,193 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:41:12,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:41:12,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (1/1) ... [2022-07-22 14:41:12,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:41:12,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:41:12,224 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-22 14:41:12,228 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-22 14:41:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-22 14:41:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-22 14:41:12,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:41:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-22 14:41:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-22 14:41:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 14:41:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-22 14:41:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:41:12,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:41:12,251 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:41:12,332 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:41:12,333 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:41:12,686 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:41:12,690 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:41:12,690 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-22 14:41:12,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:41:12 BoogieIcfgContainer [2022-07-22 14:41:12,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:41:12,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:41:12,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:41:12,697 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:41:12,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:41:11" (1/3) ... [2022-07-22 14:41:12,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c117a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:41:12, skipping insertion in model container [2022-07-22 14:41:12,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:41:12" (2/3) ... [2022-07-22 14:41:12,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c117a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:41:12, skipping insertion in model container [2022-07-22 14:41:12,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:41:12" (3/3) ... [2022-07-22 14:41:12,699 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2022-07-22 14:41:12,708 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:41:12,711 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-07-22 14:41:12,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:41:12,759 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@7b7a122b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2dabfb23 [2022-07-22 14:41:12,760 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-07-22 14:41:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 67 states have (on average 2.029850746268657) internal successors, (136), 81 states have internal predecessors, (136), 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-22 14:41:12,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-22 14:41:12,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:12,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-22 14:41:12,769 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:12,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:12,774 INFO L85 PathProgramCache]: Analyzing trace with hash 28699591, now seen corresponding path program 1 times [2022-07-22 14:41:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:12,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746778630] [2022-07-22 14:41:12,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:12,783 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:12,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:12,785 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-22 14:41:12,786 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-22 14:41:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:12,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 14:41:12,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:12,896 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-22 14:41:12,896 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:41:12,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:41:12,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746778630] [2022-07-22 14:41:12,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746778630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:12,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:12,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:41:12,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805507559] [2022-07-22 14:41:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:12,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:41:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:41:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:41:12,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:41:12,928 INFO L87 Difference]: Start difference. First operand has 82 states, 67 states have (on average 2.029850746268657) internal successors, (136), 81 states have internal predecessors, (136), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-22 14:41:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:12,993 INFO L93 Difference]: Finished difference Result 153 states and 263 transitions. [2022-07-22 14:41:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:41:12,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-07-22 14:41:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:13,013 INFO L225 Difference]: With dead ends: 153 [2022-07-22 14:41:13,013 INFO L226 Difference]: Without dead ends: 67 [2022-07-22 14:41:13,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-22 14:41:13,017 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:13,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 71 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-22 14:41:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-07-22 14:41:13,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.293103448275862) internal successors, (75), 66 states have internal predecessors, (75), 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-22 14:41:13,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-07-22 14:41:13,041 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 5 [2022-07-22 14:41:13,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:13,041 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-07-22 14:41:13,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-22 14:41:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-07-22 14:41:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 14:41:13,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:13,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:13,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 14:41:13,252 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-22 14:41:13,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:13,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:13,254 INFO L85 PathProgramCache]: Analyzing trace with hash 296515339, now seen corresponding path program 1 times [2022-07-22 14:41:13,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:13,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1948693631] [2022-07-22 14:41:13,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:13,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:13,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:13,256 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-22 14:41:13,257 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-22 14:41:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:13,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-22 14:41:13,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:13,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:41:13,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:13,480 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:41:13,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:41:13,493 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-22 14:41:13,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:41:13,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:41:13,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1948693631] [2022-07-22 14:41:13,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1948693631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:13,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:13,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:41:13,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061652810] [2022-07-22 14:41:13,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:13,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:41:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:41:13,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:41:13,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:41:13,497 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-22 14:41:13,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:13,565 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-07-22 14:41:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:41:13,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-07-22 14:41:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:13,566 INFO L225 Difference]: With dead ends: 67 [2022-07-22 14:41:13,567 INFO L226 Difference]: Without dead ends: 65 [2022-07-22 14:41:13,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:41:13,568 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 117 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:13,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 81 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-22 14:41:13,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-22 14:41:13,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-22 14:41:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.280701754385965) internal successors, (73), 64 states have internal predecessors, (73), 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-22 14:41:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-22 14:41:13,581 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 8 [2022-07-22 14:41:13,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:13,581 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-22 14:41:13,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-22 14:41:13,581 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-22 14:41:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-22 14:41:13,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:13,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:13,595 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-22 14:41:13,795 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-22 14:41:13,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:13,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:13,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1137960540, now seen corresponding path program 1 times [2022-07-22 14:41:13,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:13,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307285974] [2022-07-22 14:41:13,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:13,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:13,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:13,800 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-22 14:41:13,808 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-22 14:41:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:13,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 14:41:13,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:13,864 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-22 14:41:13,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:41:13,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:41:13,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307285974] [2022-07-22 14:41:13,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307285974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:13,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:13,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:41:13,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689487058] [2022-07-22 14:41:13,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:13,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:41:13,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:41:13,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:41:13,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:41:13,866 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:13,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:13,898 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2022-07-22 14:41:13,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:41:13,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-22 14:41:13,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:13,899 INFO L225 Difference]: With dead ends: 144 [2022-07-22 14:41:13,899 INFO L226 Difference]: Without dead ends: 81 [2022-07-22 14:41:13,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-22 14:41:13,900 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:13,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 127 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:13,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-22 14:41:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2022-07-22 14:41:13,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 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-22 14:41:13,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-07-22 14:41:13,905 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 11 [2022-07-22 14:41:13,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:13,905 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-07-22 14:41:13,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-07-22 14:41:13,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 14:41:13,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:13,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:13,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-22 14:41:14,113 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-22 14:41:14,113 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:14,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1315213501, now seen corresponding path program 1 times [2022-07-22 14:41:14,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:14,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229860544] [2022-07-22 14:41:14,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:14,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:14,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:14,115 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-22 14:41:14,117 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-22 14:41:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:14,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-22 14:41:14,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:14,183 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-22 14:41:14,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:41:14,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:41:14,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229860544] [2022-07-22 14:41:14,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229860544] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:14,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:14,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 14:41:14,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279628658] [2022-07-22 14:41:14,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:14,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 14:41:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:41:14,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 14:41:14,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 14:41:14,185 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-22 14:41:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:14,240 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-07-22 14:41:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 14:41:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-07-22 14:41:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:14,241 INFO L225 Difference]: With dead ends: 88 [2022-07-22 14:41:14,241 INFO L226 Difference]: Without dead ends: 68 [2022-07-22 14:41:14,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 14:41:14,242 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:14,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 187 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-22 14:41:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-22 14:41:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 67 states have internal predecessors, (76), 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-22 14:41:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-22 14:41:14,246 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 14 [2022-07-22 14:41:14,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:14,246 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-22 14:41:14,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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-22 14:41:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-22 14:41:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-22 14:41:14,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:14,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:14,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-22 14:41:14,454 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-22 14:41:14,455 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:14,455 INFO L85 PathProgramCache]: Analyzing trace with hash 129337073, now seen corresponding path program 1 times [2022-07-22 14:41:14,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:14,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1749538290] [2022-07-22 14:41:14,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:14,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:14,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:14,457 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-22 14:41:14,458 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-22 14:41:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:14,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 14:41:14,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:14,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:41:14,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:14,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:14,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-07-22 14:41:14,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:14,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-22 14:41:14,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:41:14,643 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 14:41:14,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-22 14:41:14,679 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:41:14,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-22 14:41:14,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-22 14:41:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:14,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:41:14,798 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_218 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_218) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-22 14:41:14,841 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-22 14:41:14,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 84 [2022-07-22 14:41:14,917 INFO L356 Elim1Store]: treesize reduction 57, result has 41.2 percent of original size [2022-07-22 14:41:14,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 132 [2022-07-22 14:41:14,939 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:14,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 102 [2022-07-22 14:41:14,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2022-07-22 14:41:15,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-22 14:41:15,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:41:15,077 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 14:41:15,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2022-07-22 14:41:15,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:15,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-07-22 14:41:15,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:41:15,199 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:15,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 86 [2022-07-22 14:41:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:15,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:41:15,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1749538290] [2022-07-22 14:41:15,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1749538290] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:41:15,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:41:15,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-07-22 14:41:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897472460] [2022-07-22 14:41:15,353 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:41:15,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 14:41:15,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:41:15,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 14:41:15,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2022-07-22 14:41:15,354 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 14:41:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:15,773 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-07-22 14:41:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 14:41:15,774 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-22 14:41:15,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:15,775 INFO L225 Difference]: With dead ends: 138 [2022-07-22 14:41:15,775 INFO L226 Difference]: Without dead ends: 136 [2022-07-22 14:41:15,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2022-07-22 14:41:15,776 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 126 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:15,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 268 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 90 Invalid, 0 Unknown, 103 Unchecked, 0.4s Time] [2022-07-22 14:41:15,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-22 14:41:15,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 80. [2022-07-22 14:41:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.25) internal successors, (90), 79 states have internal predecessors, (90), 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-22 14:41:15,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-07-22 14:41:15,781 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 17 [2022-07-22 14:41:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:15,781 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-07-22 14:41:15,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-22 14:41:15,782 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-07-22 14:41:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-22 14:41:15,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:15,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:15,793 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-22 14:41:15,991 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-22 14:41:15,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash 32191693, now seen corresponding path program 1 times [2022-07-22 14:41:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:15,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321558619] [2022-07-22 14:41:15,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:15,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:15,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:15,993 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-22 14:41:15,994 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-22 14:41:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:16,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 14:41:16,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:16,099 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:41:16,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:41:16,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321558619] [2022-07-22 14:41:16,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321558619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:16,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:16,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:41:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120024195] [2022-07-22 14:41:16,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:16,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:41:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:41:16,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:41:16,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:41:16,100 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:16,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:16,151 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2022-07-22 14:41:16,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:41:16,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-22 14:41:16,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:16,154 INFO L225 Difference]: With dead ends: 166 [2022-07-22 14:41:16,154 INFO L226 Difference]: Without dead ends: 102 [2022-07-22 14:41:16,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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-22 14:41:16,160 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 22 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:16,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 120 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-22 14:41:16,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-07-22 14:41:16,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 91 states have internal predecessors, (102), 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-22 14:41:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-07-22 14:41:16,166 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 18 [2022-07-22 14:41:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:16,166 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-07-22 14:41:16,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-07-22 14:41:16,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-22 14:41:16,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:16,167 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:16,177 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-22 14:41:16,375 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-22 14:41:16,376 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:16,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1241125015, now seen corresponding path program 1 times [2022-07-22 14:41:16,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:16,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054308628] [2022-07-22 14:41:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:16,377 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:16,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:16,378 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-22 14:41:16,378 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-22 14:41:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:16,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 14:41:16,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:16,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-22 14:41:16,504 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:41:16,504 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:41:16,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054308628] [2022-07-22 14:41:16,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054308628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:41:16,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:41:16,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 14:41:16,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471824610] [2022-07-22 14:41:16,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:41:16,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 14:41:16,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:41:16,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 14:41:16,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 14:41:16,506 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:16,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:16,553 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2022-07-22 14:41:16,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 14:41:16,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-22 14:41:16,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:16,554 INFO L225 Difference]: With dead ends: 191 [2022-07-22 14:41:16,554 INFO L226 Difference]: Without dead ends: 115 [2022-07-22 14:41:16,554 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-22 14:41:16,555 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 28 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:16,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 133 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:41:16,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-22 14:41:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2022-07-22 14:41:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 103 states have internal predecessors, (115), 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-22 14:41:16,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2022-07-22 14:41:16,559 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 24 [2022-07-22 14:41:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:16,560 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2022-07-22 14:41:16,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:41:16,560 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-07-22 14:41:16,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 14:41:16,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:16,561 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-22 14:41:16,587 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-22 14:41:16,770 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-22 14:41:16,770 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:16,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:16,770 INFO L85 PathProgramCache]: Analyzing trace with hash 43662915, now seen corresponding path program 1 times [2022-07-22 14:41:16,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:16,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1567940973] [2022-07-22 14:41:16,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:16,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:16,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:16,773 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-22 14:41:16,773 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-22 14:41:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:16,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-22 14:41:16,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:16,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:41:16,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:16,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:16,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-07-22 14:41:16,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:16,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:16,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 28 [2022-07-22 14:41:16,979 INFO L356 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-07-22 14:41:16,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 42 [2022-07-22 14:41:16,993 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-22 14:41:16,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-22 14:41:16,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-22 14:41:17,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:41:17,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:41:17,047 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-22 14:41:17,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-07-22 14:41:17,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-22 14:41:17,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-22 14:41:17,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:41:17,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-22 14:41:17,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-22 14:41:17,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:17,258 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:41:17,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2022-07-22 14:41:17,353 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_519) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) is different from false [2022-07-22 14:41:17,424 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-07-22 14:41:17,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 233 treesize of output 212 [2022-07-22 14:41:17,469 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-22 14:41:17,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 203 [2022-07-22 14:41:17,558 INFO L356 Elim1Store]: treesize reduction 57, result has 41.2 percent of original size [2022-07-22 14:41:17,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 290 treesize of output 268 [2022-07-22 14:41:17,592 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:17,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 213 [2022-07-22 14:41:17,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 177 [2022-07-22 14:41:17,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:17,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 260 treesize of output 271 [2022-07-22 14:41:17,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 205 [2022-07-22 14:41:17,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-22 14:41:17,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:41:17,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:41:18,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:18,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 74 [2022-07-22 14:41:18,136 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:18,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 72 [2022-07-22 14:41:18,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:18,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:41:18,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1567940973] [2022-07-22 14:41:18,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1567940973] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:41:18,240 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:41:18,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-22 14:41:18,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759362149] [2022-07-22 14:41:18,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:41:18,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-22 14:41:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:41:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 14:41:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=71, Unknown=1, NotChecked=16, Total=110 [2022-07-22 14:41:18,241 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 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-22 14:41:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:19,247 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2022-07-22 14:41:19,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 14:41:19,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 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) Word has length 25 [2022-07-22 14:41:19,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:19,249 INFO L225 Difference]: With dead ends: 180 [2022-07-22 14:41:19,249 INFO L226 Difference]: Without dead ends: 178 [2022-07-22 14:41:19,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=115, Unknown=1, NotChecked=22, Total=182 [2022-07-22 14:41:19,250 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 120 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:19,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 480 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 127 Invalid, 0 Unknown, 163 Unchecked, 0.9s Time] [2022-07-22 14:41:19,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-22 14:41:19,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 111. [2022-07-22 14:41:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 103 states have (on average 1.1941747572815533) internal successors, (123), 110 states have internal predecessors, (123), 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-22 14:41:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-07-22 14:41:19,254 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 25 [2022-07-22 14:41:19,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:19,255 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-07-22 14:41:19,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 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-22 14:41:19,255 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-07-22 14:41:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-22 14:41:19,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:19,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:19,266 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-22 14:41:19,463 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-22 14:41:19,463 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash 137879527, now seen corresponding path program 1 times [2022-07-22 14:41:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:19,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761452138] [2022-07-22 14:41:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:19,464 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:19,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:19,465 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-22 14:41:19,466 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-22 14:41:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:19,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-22 14:41:19,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:19,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:41:19,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:19,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:19,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-07-22 14:41:19,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:19,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-22 14:41:19,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:41:19,725 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:41:19,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:41:19,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:41:19,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:19,824 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-22 14:41:19,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 112 treesize of output 68 [2022-07-22 14:41:19,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:19,854 INFO L356 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2022-07-22 14:41:19,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 82 [2022-07-22 14:41:19,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 66 [2022-07-22 14:41:19,878 INFO L356 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-07-22 14:41:19,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 41 [2022-07-22 14:41:19,963 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-22 14:41:19,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 52 [2022-07-22 14:41:20,092 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-22 14:41:20,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2022-07-22 14:41:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:20,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:41:20,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_678) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-22 14:41:20,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_ArrVal_673 (_ BitVec 32)) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_673)))) (store .cse1 v_ArrVal_673 (store (select .cse1 v_ArrVal_673) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_678)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_673))))) is different from false [2022-07-22 14:41:20,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:20,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2022-07-22 14:41:20,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~item~0#1.offset| (_ BitVec 32)) (v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (_ bv0 1) (select |c_#valid| .cse0))) (not (= (_ bv0 32) (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_11))) (store .cse2 .cse0 (store (select .cse2 .cse0) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_678)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-22 14:41:20,323 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-22 14:41:20,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 248 treesize of output 164 [2022-07-22 14:41:20,638 INFO L356 Elim1Store]: treesize reduction 123, result has 34.6 percent of original size [2022-07-22 14:41:20,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 6219 treesize of output 5942 [2022-07-22 14:41:20,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-22 14:41:20,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:20,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 6513 treesize of output 6493 [2022-07-22 14:41:20,809 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:20,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7404 treesize of output 6342 [2022-07-22 14:41:20,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6289 treesize of output 6065 [2022-07-22 14:41:21,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-22 14:41:21,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:41:21,339 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-22 14:41:21,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 62 [2022-07-22 14:41:21,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:21,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-07-22 14:41:21,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-22 14:41:21,511 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:21,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 124 [2022-07-22 14:41:46,447 WARN L233 SmtUtils]: Spent 18.40s on a formula simplification. DAG size of input: 102 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 14:41:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-22 14:41:46,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:41:46,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761452138] [2022-07-22 14:41:46,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761452138] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 14:41:46,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 14:41:46,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-07-22 14:41:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441219246] [2022-07-22 14:41:46,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 14:41:46,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 14:41:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:41:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 14:41:46,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=54, Unknown=4, NotChecked=48, Total=132 [2022-07-22 14:41:46,451 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 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-22 14:41:46,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:41:46,823 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-07-22 14:41:46,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:41:46,824 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 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) Word has length 25 [2022-07-22 14:41:46,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:41:46,825 INFO L225 Difference]: With dead ends: 140 [2022-07-22 14:41:46,825 INFO L226 Difference]: Without dead ends: 138 [2022-07-22 14:41:46,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=32, Invalid=66, Unknown=4, NotChecked=54, Total=156 [2022-07-22 14:41:46,826 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 27 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-22 14:41:46,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 467 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 254 Unchecked, 0.3s Time] [2022-07-22 14:41:46,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-22 14:41:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2022-07-22 14:41:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 118 states have (on average 1.1779661016949152) internal successors, (139), 125 states have internal predecessors, (139), 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-22 14:41:46,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2022-07-22 14:41:46,831 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 25 [2022-07-22 14:41:46,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:41:46,831 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2022-07-22 14:41:46,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 12 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-22 14:41:46,831 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2022-07-22 14:41:46,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-22 14:41:46,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:41:46,832 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:41:46,851 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-22 14:41:47,042 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-22 14:41:47,042 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-07-22 14:41:47,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:41:47,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1584320444, now seen corresponding path program 1 times [2022-07-22 14:41:47,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:41:47,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425106212] [2022-07-22 14:41:47,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:41:47,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:41:47,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:41:47,044 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-22 14:41:47,046 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-22 14:41:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:41:47,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-22 14:41:47,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:41:47,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-22 14:41:47,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:47,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:47,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2022-07-22 14:41:47,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:47,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2022-07-22 14:41:47,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:47,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-22 14:41:47,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:47,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:41:47,312 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-22 14:41:47,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-22 14:41:47,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-22 14:41:47,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:41:47,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-22 14:41:47,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:47,431 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-22 14:41:47,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 73 [2022-07-22 14:41:47,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:47,450 INFO L356 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-07-22 14:41:47,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 64 [2022-07-22 14:41:47,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-22 14:41:47,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:47,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-22 14:41:47,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-07-22 14:41:47,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-07-22 14:41:47,485 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-22 14:41:47,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 23 [2022-07-22 14:41:47,562 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-22 14:41:47,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 69 [2022-07-22 14:41:47,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-07-22 14:41:47,793 INFO L356 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2022-07-22 14:41:47,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 33 [2022-07-22 14:41:47,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-22 14:41:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 14:41:47,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 14:41:47,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_870 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_871))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_870) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-22 14:41:47,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_846 (_ BitVec 32)) (v_ArrVal_870 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= v_ArrVal_846 (_ bv0 32)) (not (= (_ bv0 1) (select |c_#valid| v_ArrVal_846))) (not (= (let ((.cse1 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| v_ArrVal_846)))) (store .cse4 v_ArrVal_846 (store (select .cse4 v_ArrVal_846) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_871))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32))))) (store .cse3 v_ArrVal_846 (store (select .cse3 v_ArrVal_846) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))) .cse2 v_ArrVal_870) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (_ bv0 32))))) is different from false [2022-07-22 14:41:48,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:48,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 158 [2022-07-22 14:41:48,099 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:41:48,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 128 [2022-07-22 14:41:48,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_871 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_870 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select v_arrayElimArr_19 |c_ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (let ((.cse1 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_19))) (store .cse5 .cse4 (store (select .cse5 .cse4) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.base|))))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_871))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_18))) (store .cse3 .cse4 (store (select .cse3 .cse4) (_ bv4 32) |c_ULTIMATE.start_main_~item~0#1.offset|))) .cse2 v_ArrVal_870) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| .cse4))) (= .cse4 (_ bv0 32)) (not (= (select v_arrayElimArr_18 |c_ULTIMATE.start_main_~item~0#1.offset|) (_ bv0 32)))))) is different from false [2022-07-22 14:41:48,760 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-07-22 14:41:48,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 2102 treesize of output 2032 [2022-07-22 14:41:49,407 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-22 14:41:49,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1274 treesize of output 678 [2022-07-22 14:42:07,326 WARN L233 SmtUtils]: Spent 17.88s on a formula simplification. DAG size of input: 370 DAG size of output: 147 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 14:42:07,327 INFO L356 Elim1Store]: treesize reduction 808, result has 27.0 percent of original size [2022-07-22 14:42:07,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 15 new quantified variables, introduced 66 case distinctions, treesize of input 184007 treesize of output 158608 [2022-07-22 14:42:10,251 INFO L356 Elim1Store]: treesize reduction 12, result has 88.6 percent of original size [2022-07-22 14:42:10,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1146613 treesize of output 1119353 [2022-07-22 14:42:14,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:42:14,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1208771 treesize of output 1184405 [2022-07-22 14:42:17,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1184350 treesize of output 1140798 [2022-07-22 14:42:22,370 INFO L244 Elim1Store]: Index analysis took 165 ms [2022-07-22 14:42:37,329 WARN L233 SmtUtils]: Spent 14.93s on a formula simplification. DAG size of input: 353 DAG size of output: 301 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-22 14:42:37,330 INFO L356 Elim1Store]: treesize reduction 191, result has 79.9 percent of original size [2022-07-22 14:42:37,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 16 new quantified variables, introduced 78 case distinctions, treesize of input 11327541 treesize of output 10292320 [2022-07-22 14:43:01,474 WARN L233 SmtUtils]: Spent 24.13s on a formula simplification that was a NOOP. DAG size: 7491 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 14:43:25,685 WARN L233 SmtUtils]: Spent 24.19s on a formula simplification that was a NOOP. DAG size: 7479 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-22 14:43:29,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-22 14:43:29,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 12289508 treesize of output 10922558