./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 eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-eb692b5 [2022-07-19 14:28:45,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:28:45,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:28:45,467 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:28:45,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:28:45,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:28:45,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:28:45,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:28:45,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:28:45,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:28:45,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:28:45,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:28:45,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:28:45,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:28:45,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:28:45,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:28:45,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:28:45,488 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:28:45,490 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:28:45,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:28:45,496 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:28:45,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:28:45,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:28:45,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:28:45,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:28:45,506 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:28:45,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:28:45,507 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:28:45,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:28:45,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:28:45,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:28:45,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:28:45,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:28:45,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:28:45,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:28:45,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:28:45,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:28:45,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:28:45,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:28:45,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:28:45,515 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:28:45,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:28:45,517 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 14:28:45,544 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:28:45,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:28:45,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:28:45,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:28:45,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:28:45,546 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:28:45,547 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:28:45,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:28:45,547 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:28:45,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:28:45,548 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:28:45,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 14:28:45,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:28:45,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:28:45,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:28:45,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:28:45,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:28:45,549 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:28:45,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:28:45,549 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:28:45,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:28:45,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:28:45,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:28:45,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:28:45,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:45,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:28:45,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:28:45,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:28:45,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 14:28:45,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 14:28:45,551 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:28:45,551 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:28:45,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:28:45,552 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-19 14:28:45,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:28:45,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:28:45,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:28:45,866 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:28:45,866 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:28:45,867 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-19 14:28:45,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4604cb09/e3281bfcb8304710bb9c798abc984f40/FLAGd25418860 [2022-07-19 14:28:46,366 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:28:46,370 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2022-07-19 14:28:46,380 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4604cb09/e3281bfcb8304710bb9c798abc984f40/FLAGd25418860 [2022-07-19 14:28:46,702 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4604cb09/e3281bfcb8304710bb9c798abc984f40 [2022-07-19 14:28:46,704 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:28:46,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:28:46,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:46,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:28:46,713 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:28:46,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:46" (1/1) ... [2022-07-19 14:28:46,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141c3ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:46, skipping insertion in model container [2022-07-19 14:28:46,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:46" (1/1) ... [2022-07-19 14:28:46,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:28:46,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:28:46,952 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-19 14:28:46,957 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-19 14:28:46,959 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-19 14:28:46,960 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-19 14:28:46,961 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-19 14:28:46,962 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-19 14:28:46,963 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-19 14:28:46,966 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-19 14:28:46,968 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-19 14:28:46,970 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-19 14:28:46,971 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-19 14:28:46,973 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-19 14:28:46,974 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-19 14:28:46,977 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-19 14:28:46,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:46,991 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:28:47,036 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-19 14:28:47,037 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-19 14:28:47,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[22605,22618] [2022-07-19 14:28:47,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[22697,22710] [2022-07-19 14:28:47,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[22774,22787] [2022-07-19 14:28:47,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[22869,22882] [2022-07-19 14:28:47,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[22946,22959] [2022-07-19 14:28:47,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[23029,23042] [2022-07-19 14:28:47,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[23124,23137] [2022-07-19 14:28:47,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[23201,23214] [2022-07-19 14:28:47,043 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-19 14:28:47,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[23373,23386] [2022-07-19 14:28:47,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[23459,23472] [2022-07-19 14:28:47,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[23604,23617] [2022-07-19 14:28:47,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:47,071 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:28:47,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47 WrapperNode [2022-07-19 14:28:47,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:47,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:47,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:28:47,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:28:47,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,095 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,118 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 223 [2022-07-19 14:28:47,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:47,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:28:47,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:28:47,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:28:47,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:28:47,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:28:47,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:28:47,214 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:28:47,215 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (1/1) ... [2022-07-19 14:28:47,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:47,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:47,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 14:28:47,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 14:28:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 14:28:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 14:28:47,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:28:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:28:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:28:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:28:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:28:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 14:28:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:28:47,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:28:47,354 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:28:47,356 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:28:47,622 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:28:47,628 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:28:47,629 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-19 14:28:47,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:47 BoogieIcfgContainer [2022-07-19 14:28:47,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:28:47,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:28:47,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:28:47,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:28:47,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:28:46" (1/3) ... [2022-07-19 14:28:47,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecdd134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:47, skipping insertion in model container [2022-07-19 14:28:47,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:47" (2/3) ... [2022-07-19 14:28:47,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ecdd134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:47, skipping insertion in model container [2022-07-19 14:28:47,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:47" (3/3) ... [2022-07-19 14:28:47,638 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2022-07-19 14:28:47,650 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:28:47,650 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-07-19 14:28:47,696 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:28:47,701 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@18562482, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5bef5846 [2022-07-19 14:28:47,706 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-07-19 14:28:47,711 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-19 14:28:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-19 14:28:47,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:47,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-19 14:28:47,730 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-19 14:28:47,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:47,733 INFO L85 PathProgramCache]: Analyzing trace with hash 28752478, now seen corresponding path program 1 times [2022-07-19 14:28:47,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:47,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685819295] [2022-07-19 14:28:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:47,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685819295] [2022-07-19 14:28:47,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685819295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:47,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:47,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 14:28:47,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108350238] [2022-07-19 14:28:47,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:47,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 14:28:47,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:47,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 14:28:47,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 14:28:47,897 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-19 14:28:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:47,926 INFO L93 Difference]: Finished difference Result 168 states and 278 transitions. [2022-07-19 14:28:47,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 14:28:47,928 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-19 14:28:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:47,937 INFO L225 Difference]: With dead ends: 168 [2022-07-19 14:28:47,937 INFO L226 Difference]: Without dead ends: 80 [2022-07-19 14:28:47,940 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-19 14:28:47,946 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-19 14:28:47,950 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-19 14:28:47,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-19 14:28:47,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-19 14:28:47,986 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-19 14:28:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-19 14:28:47,992 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 5 [2022-07-19 14:28:47,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:47,993 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-19 14:28:47,993 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-19 14:28:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-19 14:28:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-19 14:28:47,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:47,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-19 14:28:47,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 14:28:47,996 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-19 14:28:47,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:47,997 INFO L85 PathProgramCache]: Analyzing trace with hash 889571111, now seen corresponding path program 1 times [2022-07-19 14:28:47,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:47,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911317192] [2022-07-19 14:28:47,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:47,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:48,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:48,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911317192] [2022-07-19 14:28:48,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911317192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:48,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:48,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:28:48,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105580767] [2022-07-19 14:28:48,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:48,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:28:48,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:28:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:28:48,058 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-19 14:28:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:48,084 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-07-19 14:28:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:28:48,085 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-19 14:28:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:48,086 INFO L225 Difference]: With dead ends: 80 [2022-07-19 14:28:48,086 INFO L226 Difference]: Without dead ends: 70 [2022-07-19 14:28:48,086 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-19 14:28:48,087 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-19 14:28:48,088 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-19 14:28:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-19 14:28:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-19 14:28:48,093 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-19 14:28:48,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2022-07-19 14:28:48,094 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 6 [2022-07-19 14:28:48,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:48,095 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2022-07-19 14:28:48,095 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-19 14:28:48,095 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2022-07-19 14:28:48,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-19 14:28:48,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:48,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:48,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 14:28:48,096 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-19 14:28:48,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:48,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1270244236, now seen corresponding path program 1 times [2022-07-19 14:28:48,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:48,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020621358] [2022-07-19 14:28:48,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:48,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:48,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:48,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:48,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020621358] [2022-07-19 14:28:48,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020621358] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:48,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:48,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:28:48,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562761329] [2022-07-19 14:28:48,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:48,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:28:48,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:48,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:28:48,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:28:48,263 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-19 14:28:48,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:48,332 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2022-07-19 14:28:48,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 14:28:48,333 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-19 14:28:48,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:48,334 INFO L225 Difference]: With dead ends: 119 [2022-07-19 14:28:48,334 INFO L226 Difference]: Without dead ends: 117 [2022-07-19 14:28:48,334 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-19 14:28:48,335 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-19 14:28:48,339 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-19 14:28:48,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-19 14:28:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 68. [2022-07-19 14:28:48,359 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-19 14:28:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-19 14:28:48,360 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 9 [2022-07-19 14:28:48,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:48,361 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-19 14:28:48,361 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-19 14:28:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-19 14:28:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 14:28:48,362 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:48,362 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:48,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 14:28:48,363 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-19 14:28:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:48,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1286414876, now seen corresponding path program 1 times [2022-07-19 14:28:48,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:48,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092513017] [2022-07-19 14:28:48,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:48,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:48,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:48,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:48,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092513017] [2022-07-19 14:28:48,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092513017] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:48,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:48,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:28:48,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998378021] [2022-07-19 14:28:48,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:48,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:28:48,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:48,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:28:48,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:28:48,417 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-19 14:28:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:48,449 INFO L93 Difference]: Finished difference Result 153 states and 178 transitions. [2022-07-19 14:28:48,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:28:48,449 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-19 14:28:48,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:48,450 INFO L225 Difference]: With dead ends: 153 [2022-07-19 14:28:48,450 INFO L226 Difference]: Without dead ends: 87 [2022-07-19 14:28:48,451 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-19 14:28:48,452 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-19 14:28:48,452 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-19 14:28:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-19 14:28:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 76. [2022-07-19 14:28:48,458 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-19 14:28:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-19 14:28:48,459 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 12 [2022-07-19 14:28:48,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:48,459 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-19 14:28:48,460 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-19 14:28:48,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-19 14:28:48,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:28:48,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:48,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:48,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 14:28:48,461 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-19 14:28:48,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:48,462 INFO L85 PathProgramCache]: Analyzing trace with hash -138012862, now seen corresponding path program 1 times [2022-07-19 14:28:48,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:48,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752991077] [2022-07-19 14:28:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:48,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:48,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752991077] [2022-07-19 14:28:48,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752991077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:48,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:48,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 14:28:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115644135] [2022-07-19 14:28:48,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:48,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 14:28:48,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:48,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 14:28:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 14:28:48,551 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-19 14:28:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:48,635 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-07-19 14:28:48,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:28:48,635 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-19 14:28:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:48,636 INFO L225 Difference]: With dead ends: 91 [2022-07-19 14:28:48,636 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 14:28:48,637 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-19 14:28:48,638 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:48,638 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.1s Time] [2022-07-19 14:28:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 14:28:48,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-19 14:28:48,666 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-19 14:28:48,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 79 transitions. [2022-07-19 14:28:48,667 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 79 transitions. Word has length 17 [2022-07-19 14:28:48,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:48,667 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 79 transitions. [2022-07-19 14:28:48,667 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-19 14:28:48,668 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 79 transitions. [2022-07-19 14:28:48,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 14:28:48,668 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:48,669 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-19 14:28:48,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 14:28:48,669 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-19 14:28:48,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:48,670 INFO L85 PathProgramCache]: Analyzing trace with hash -472870040, now seen corresponding path program 1 times [2022-07-19 14:28:48,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:48,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415106136] [2022-07-19 14:28:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:48,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:48,763 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-19 14:28:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:48,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415106136] [2022-07-19 14:28:48,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415106136] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:48,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667076007] [2022-07-19 14:28:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:48,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:48,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:48,771 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-19 14:28:48,805 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-19 14:28:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:48,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-19 14:28:48,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:48,983 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-19 14:28:49,084 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-19 14:28:49,105 INFO L356 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-07-19 14:28:49,106 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-19 14:28:49,111 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-19 14:28:49,120 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:28:49,120 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-19 14:28:49,168 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:28:49,169 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-19 14:28:49,270 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-19 14:28:49,275 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-19 14:28:49,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:49,310 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-19 14:28:49,357 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:28:49,358 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-19 14:28:49,368 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:28:49,368 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-19 14:28:49,375 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-19 14:28:49,383 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-19 14:28:49,390 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-19 14:28:49,516 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-19 14:28:49,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667076007] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:49,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 14:28:49,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2022-07-19 14:28:49,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830386566] [2022-07-19 14:28:49,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:49,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:28:49,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:49,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:28:49,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2022-07-19 14:28:49,521 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-19 14:28:49,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:49,689 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2022-07-19 14:28:49,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:28:49,690 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-19 14:28:49,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:49,694 INFO L225 Difference]: With dead ends: 144 [2022-07-19 14:28:49,694 INFO L226 Difference]: Without dead ends: 142 [2022-07-19 14:28:49,695 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-19 14:28:49,697 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-19 14:28:49,698 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-19 14:28:49,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-19 14:28:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 84. [2022-07-19 14:28:49,704 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-19 14:28:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-07-19 14:28:49,705 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 19 [2022-07-19 14:28:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:49,705 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-07-19 14:28:49,705 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-19 14:28:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-07-19 14:28:49,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 14:28:49,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:49,706 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-19 14:28:49,732 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-19 14:28:49,907 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-19 14:28:49,907 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-19 14:28:49,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1456359625, now seen corresponding path program 1 times [2022-07-19 14:28:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:49,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851287121] [2022-07-19 14:28:49,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:49,980 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-19 14:28:49,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:49,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851287121] [2022-07-19 14:28:49,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851287121] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:49,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:49,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:28:49,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702800195] [2022-07-19 14:28:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:49,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:28:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:49,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:28:49,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:28:49,987 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-19 14:28:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:50,013 INFO L93 Difference]: Finished difference Result 174 states and 199 transitions. [2022-07-19 14:28:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:28:50,016 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-19 14:28:50,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:50,017 INFO L225 Difference]: With dead ends: 174 [2022-07-19 14:28:50,017 INFO L226 Difference]: Without dead ends: 108 [2022-07-19 14:28:50,018 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-19 14:28:50,022 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-19 14:28:50,023 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-19 14:28:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-19 14:28:50,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2022-07-19 14:28:50,029 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-19 14:28:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2022-07-19 14:28:50,030 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 20 [2022-07-19 14:28:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:50,030 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2022-07-19 14:28:50,031 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-19 14:28:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2022-07-19 14:28:50,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 14:28:50,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:50,032 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-19 14:28:50,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 14:28:50,032 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-19 14:28:50,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:50,033 INFO L85 PathProgramCache]: Analyzing trace with hash 886899864, now seen corresponding path program 1 times [2022-07-19 14:28:50,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:50,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033931577] [2022-07-19 14:28:50,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:50,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:50,122 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-19 14:28:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:50,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033931577] [2022-07-19 14:28:50,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033931577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:50,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:50,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:28:50,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762118510] [2022-07-19 14:28:50,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:50,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:28:50,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 14:28:50,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:28:50,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:28:50,125 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-19 14:28:50,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:50,155 INFO L93 Difference]: Finished difference Result 201 states and 228 transitions. [2022-07-19 14:28:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:28:50,155 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-19 14:28:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:50,156 INFO L225 Difference]: With dead ends: 201 [2022-07-19 14:28:50,156 INFO L226 Difference]: Without dead ends: 122 [2022-07-19 14:28:50,158 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-19 14:28:50,159 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-19 14:28:50,159 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-19 14:28:50,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-19 14:28:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-07-19 14:28:50,169 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-19 14:28:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-07-19 14:28:50,170 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 27 [2022-07-19 14:28:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:50,170 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-07-19 14:28:50,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 14:28:50,170 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-07-19 14:28:50,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:28:50,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:50,172 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-19 14:28:50,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 14:28:50,172 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-19 14:28:50,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2041801735, now seen corresponding path program 1 times [2022-07-19 14:28:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 14:28:50,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555536272] [2022-07-19 14:28:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:50,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 14:28:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:50,428 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-19 14:28:50,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 14:28:50,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555536272] [2022-07-19 14:28:50,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555536272] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 14:28:50,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110012087] [2022-07-19 14:28:50,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:50,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 14:28:50,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:50,431 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-19 14:28:50,432 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-19 14:28:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:50,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-19 14:28:50,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:50,581 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-19 14:28:50,623 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-19 14:28:50,639 INFO L356 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-07-19 14:28:50,639 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-19 14:28:50,647 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-19 14:28:50,662 INFO L356 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-07-19 14:28:50,662 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-19 14:28:50,715 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:28:50,715 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-19 14:28:50,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:28:50,822 INFO L356 Elim1Store]: treesize reduction 104, result has 13.3 percent of original size [2022-07-19 14:28:50,823 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 14:28:50,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:51,043 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-19 14:28:51,043 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 49 context size 49 output size 49 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:180) 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:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) 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-19 14:28:51,048 INFO L158 Benchmark]: Toolchain (without parser) took 4342.46ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 87.0MB in the beginning and 82.7MB in the end (delta: 4.4MB). Peak memory consumption was 27.9MB. Max. memory is 16.1GB. [2022-07-19 14:28:51,048 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 14:28:51,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.32ms. Allocated memory is still 109.1MB. Free memory was 86.8MB in the beginning and 67.2MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-19 14:28:51,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.79ms. Allocated memory is still 109.1MB. Free memory was 67.2MB in the beginning and 65.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:28:51,048 INFO L158 Benchmark]: Boogie Preprocessor took 93.56ms. Allocated memory is still 109.1MB. Free memory was 65.2MB in the beginning and 85.6MB in the end (delta: -20.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 14:28:51,049 INFO L158 Benchmark]: RCFGBuilder took 416.71ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 67.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-19 14:28:51,049 INFO L158 Benchmark]: TraceAbstraction took 3415.54ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 67.3MB in the beginning and 82.7MB in the end (delta: -15.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-07-19 14:28:51,050 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.19ms. Allocated memory is still 83.9MB. Free memory was 57.5MB in the beginning and 57.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.32ms. Allocated memory is still 109.1MB. Free memory was 86.8MB in the beginning and 67.2MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.79ms. Allocated memory is still 109.1MB. Free memory was 67.2MB in the beginning and 65.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.56ms. Allocated memory is still 109.1MB. Free memory was 65.2MB in the beginning and 85.6MB in the end (delta: -20.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.71ms. Allocated memory is still 109.1MB. Free memory was 85.6MB in the beginning and 67.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3415.54ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 67.3MB in the beginning and 82.7MB in the end (delta: -15.4MB). Peak memory consumption was 9.8MB. 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 49 context size 49 output size 49 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_32| input size 49 context size 49 output size 49: 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-19 14:28:51,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-eb692b5 [2022-07-19 14:28:53,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 14:28:53,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 14:28:53,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 14:28:53,123 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 14:28:53,124 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 14:28:53,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 14:28:53,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 14:28:53,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 14:28:53,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 14:28:53,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 14:28:53,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 14:28:53,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 14:28:53,143 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 14:28:53,144 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 14:28:53,150 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 14:28:53,151 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 14:28:53,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 14:28:53,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 14:28:53,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 14:28:53,160 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 14:28:53,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 14:28:53,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 14:28:53,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 14:28:53,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 14:28:53,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 14:28:53,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 14:28:53,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 14:28:53,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 14:28:53,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 14:28:53,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 14:28:53,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 14:28:53,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 14:28:53,174 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 14:28:53,175 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 14:28:53,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 14:28:53,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 14:28:53,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 14:28:53,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 14:28:53,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 14:28:53,178 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 14:28:53,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 14:28:53,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 14:28:53,221 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 14:28:53,221 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 14:28:53,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 14:28:53,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 14:28:53,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 14:28:53,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 14:28:53,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 14:28:53,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 14:28:53,224 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 14:28:53,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 14:28:53,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 14:28:53,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 14:28:53,226 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 14:28:53,226 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 14:28:53,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 14:28:53,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 14:28:53,226 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 14:28:53,227 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 14:28:53,227 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 14:28:53,227 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 14:28:53,227 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 14:28:53,227 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 14:28:53,228 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 14:28:53,228 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 14:28:53,228 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 14:28:53,228 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 14:28:53,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:53,229 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 14:28:53,229 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 14:28:53,229 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 14:28:53,229 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 14:28:53,230 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 14:28:53,230 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 14:28:53,230 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 14:28:53,230 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 14:28:53,231 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 14:28:53,231 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-19 14:28:53,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 14:28:53,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 14:28:53,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 14:28:53,542 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 14:28:53,542 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 14:28:53,544 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-19 14:28:53,607 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91b3436f/7765c4cef1d143d28fb43295b7074c85/FLAG8460286e3 [2022-07-19 14:28:54,127 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 14:28:54,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2022-07-19 14:28:54,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91b3436f/7765c4cef1d143d28fb43295b7074c85/FLAG8460286e3 [2022-07-19 14:28:54,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d91b3436f/7765c4cef1d143d28fb43295b7074c85 [2022-07-19 14:28:54,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 14:28:54,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 14:28:54,607 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:54,607 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 14:28:54,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 14:28:54,616 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43711fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:54, skipping insertion in model container [2022-07-19 14:28:54,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 02:28:54" (1/1) ... [2022-07-19 14:28:54,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 14:28:54,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 14:28:54,919 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-19 14:28:54,922 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-19 14:28:54,923 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-19 14:28:54,924 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-19 14:28:54,925 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-19 14:28:54,926 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-19 14:28:54,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[22946,22959] [2022-07-19 14:28:54,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[23029,23042] [2022-07-19 14:28:54,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[23124,23137] [2022-07-19 14:28:54,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[23201,23214] [2022-07-19 14:28:54,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[23284,23297] [2022-07-19 14:28:54,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[23373,23386] [2022-07-19 14:28:54,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[23459,23472] [2022-07-19 14:28:54,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-19 14:28:54,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:54,947 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 14:28:54,979 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-19 14:28:54,980 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-19 14:28:54,981 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-19 14:28:54,982 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-19 14:28:54,982 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-19 14:28:54,983 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-19 14:28:54,984 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-19 14:28:54,985 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-19 14:28:54,985 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-19 14:28:54,986 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-19 14:28:54,987 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-19 14:28:54,988 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-19 14:28:54,989 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-19 14:28:54,990 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-19 14:28:54,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 14:28:55,025 INFO L208 MainTranslator]: Completed translation [2022-07-19 14:28:55,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55 WrapperNode [2022-07-19 14:28:55,025 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 14:28:55,026 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:55,027 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 14:28:55,027 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 14:28:55,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,077 INFO L137 Inliner]: procedures = 122, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 217 [2022-07-19 14:28:55,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 14:28:55,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 14:28:55,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 14:28:55,082 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 14:28:55,089 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,122 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 14:28:55,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 14:28:55,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 14:28:55,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 14:28:55,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (1/1) ... [2022-07-19 14:28:55,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 14:28:55,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 14:28:55,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 14:28:55,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 14:28:55,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-19 14:28:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 14:28:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 14:28:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 14:28:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 14:28:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 14:28:55,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-19 14:28:55,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 14:28:55,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 14:28:55,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 14:28:55,343 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 14:28:55,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 14:28:55,709 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 14:28:55,715 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 14:28:55,715 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-07-19 14:28:55,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:55 BoogieIcfgContainer [2022-07-19 14:28:55,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 14:28:55,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 14:28:55,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 14:28:55,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 14:28:55,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 02:28:54" (1/3) ... [2022-07-19 14:28:55,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c9346a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:55, skipping insertion in model container [2022-07-19 14:28:55,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 02:28:55" (2/3) ... [2022-07-19 14:28:55,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c9346a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 02:28:55, skipping insertion in model container [2022-07-19 14:28:55,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 02:28:55" (3/3) ... [2022-07-19 14:28:55,724 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2022-07-19 14:28:55,736 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 14:28:55,737 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-07-19 14:28:55,776 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 14:28:55,782 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@37988721, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f8db31d [2022-07-19 14:28:55,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-07-19 14:28:55,786 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-19 14:28:55,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-19 14:28:55,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:55,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-19 14:28:55,792 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-19 14:28:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash 28699591, now seen corresponding path program 1 times [2022-07-19 14:28:55,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:28:55,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456746529] [2022-07-19 14:28:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:55,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:28:55,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:28:55,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:28:55,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 14:28:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:55,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:28:55,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:55,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:28:55,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:28:55,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456746529] [2022-07-19 14:28:55,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456746529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:55,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:55,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:28:55,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601915872] [2022-07-19 14:28:55,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:55,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:28:55,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:28:56,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:28:56,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:28:56,019 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-19 14:28:56,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:56,107 INFO L93 Difference]: Finished difference Result 153 states and 263 transitions. [2022-07-19 14:28:56,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:28:56,109 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-19 14:28:56,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:56,117 INFO L225 Difference]: With dead ends: 153 [2022-07-19 14:28:56,118 INFO L226 Difference]: Without dead ends: 67 [2022-07-19 14:28:56,124 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-19 14:28:56,128 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-19 14:28:56,132 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-19 14:28:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-19 14:28:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-07-19 14:28:56,172 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-19 14:28:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-07-19 14:28:56,175 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 5 [2022-07-19 14:28:56,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:56,175 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-07-19 14:28:56,175 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-19 14:28:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-07-19 14:28:56,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 14:28:56,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:56,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:56,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:56,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:28:56,390 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-19 14:28:56,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:56,390 INFO L85 PathProgramCache]: Analyzing trace with hash 296515339, now seen corresponding path program 1 times [2022-07-19 14:28:56,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:28:56,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044374354] [2022-07-19 14:28:56,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:56,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:28:56,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:28:56,393 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:28:56,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 14:28:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:56,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-19 14:28:56,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:56,578 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-19 14:28:56,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:28:56,648 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:28:56,648 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-19 14:28:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:56,660 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:28:56,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:28:56,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044374354] [2022-07-19 14:28:56,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044374354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:56,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:56,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:28:56,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122810768] [2022-07-19 14:28:56,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:56,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:28:56,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:28:56,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:28:56,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:28:56,663 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-19 14:28:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:56,751 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-07-19 14:28:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:28:56,752 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-19 14:28:56,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:56,753 INFO L225 Difference]: With dead ends: 67 [2022-07-19 14:28:56,753 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 14:28:56,753 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-19 14:28:56,754 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 117 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-19 14:28:56,755 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-19 14:28:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 14:28:56,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-19 14:28:56,760 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-19 14:28:56,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-07-19 14:28:56,761 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 8 [2022-07-19 14:28:56,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:56,761 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-07-19 14:28:56,761 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-19 14:28:56,761 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-07-19 14:28:56,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-19 14:28:56,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:56,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:56,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:56,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:28:56,974 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-19 14:28:56,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:56,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1137960540, now seen corresponding path program 1 times [2022-07-19 14:28:56,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:28:56,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838837279] [2022-07-19 14:28:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:56,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:28:56,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:28:56,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:28:56,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 14:28:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:57,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:28:57,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:57,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:57,049 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:28:57,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:28:57,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838837279] [2022-07-19 14:28:57,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838837279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:57,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:57,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:28:57,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067159010] [2022-07-19 14:28:57,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:57,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:28:57,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:28:57,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:28:57,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:28:57,051 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-19 14:28:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:57,094 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2022-07-19 14:28:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:28:57,095 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-19 14:28:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:57,095 INFO L225 Difference]: With dead ends: 144 [2022-07-19 14:28:57,095 INFO L226 Difference]: Without dead ends: 81 [2022-07-19 14:28:57,096 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-19 14:28:57,097 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-19 14:28:57,097 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-19 14:28:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-19 14:28:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2022-07-19 14:28:57,103 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-19 14:28:57,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-07-19 14:28:57,104 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 11 [2022-07-19 14:28:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:57,104 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-07-19 14:28:57,104 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-19 14:28:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-07-19 14:28:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 14:28:57,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:57,105 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:57,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:57,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:28:57,315 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-19 14:28:57,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:57,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1315213501, now seen corresponding path program 1 times [2022-07-19 14:28:57,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:28:57,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962838903] [2022-07-19 14:28:57,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:57,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:28:57,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:28:57,318 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:28:57,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 14:28:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:57,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 14:28:57,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:57,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 14:28:57,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:28:57,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:28:57,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962838903] [2022-07-19 14:28:57,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962838903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:28:57,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:28:57,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 14:28:57,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710163174] [2022-07-19 14:28:57,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:28:57,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 14:28:57,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:28:57,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 14:28:57,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 14:28:57,434 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-19 14:28:57,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:28:57,522 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2022-07-19 14:28:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 14:28:57,523 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-19 14:28:57,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:28:57,524 INFO L225 Difference]: With dead ends: 88 [2022-07-19 14:28:57,524 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 14:28:57,524 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-19 14:28:57,525 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-07-19 14:28:57,525 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.1s Time] [2022-07-19 14:28:57,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 14:28:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-07-19 14:28:57,532 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-19 14:28:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-19 14:28:57,533 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 14 [2022-07-19 14:28:57,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:28:57,533 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-19 14:28:57,533 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-19 14:28:57,533 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-19 14:28:57,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 14:28:57,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:28:57,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:28:57,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 14:28:57,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:28:57,735 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-19 14:28:57,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:28:57,736 INFO L85 PathProgramCache]: Analyzing trace with hash 129337073, now seen corresponding path program 1 times [2022-07-19 14:28:57,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:28:57,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922419648] [2022-07-19 14:28:57,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:28:57,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:28:57,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:28:57,739 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:28:57,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 14:28:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:28:57,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-19 14:28:57,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:28:57,912 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-19 14:28:57,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:28:57,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:28:57,974 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-19 14:28:57,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:28:57,983 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-19 14:28:57,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 5 treesize of output 3 [2022-07-19 14:28:58,001 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 14:28:58,002 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-19 14:28:58,045 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:28:58,046 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-19 14:28:58,149 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-19 14:28:58,160 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-19 14:28:58,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:28:58,208 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-19 14:28:58,267 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-19 14:28:58,268 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 79 [2022-07-19 14:28:58,412 INFO L356 Elim1Store]: treesize reduction 10, result has 83.6 percent of original size [2022-07-19 14:28:58,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1074 treesize of output 1082 [2022-07-19 14:28:58,506 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 233 treesize of output 221 [2022-07-19 14:28:59,359 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 67 treesize of output 53 [2022-07-19 14:28:59,422 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:28:59,422 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 49 treesize of output 37 [2022-07-19 14:28:59,442 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 22 [2022-07-19 14:28:59,464 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-19 14:28:59,483 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-19 14:28:59,502 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-19 14:28:59,506 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 22 [2022-07-19 14:28:59,523 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-19 14:28:59,527 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-19 14:28:59,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:28:59,542 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 18 treesize of output 22 [2022-07-19 14:28:59,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:28:59,557 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 37 treesize of output 35 [2022-07-19 14:28:59,656 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-19 14:28:59,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:28:59,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922419648] [2022-07-19 14:28:59,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922419648] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:28:59,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:28:59,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-07-19 14:28:59,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553647438] [2022-07-19 14:28:59,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:28:59,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 14:28:59,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:28:59,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 14:28:59,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2022-07-19 14:28:59,659 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-19 14:29:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:29:00,147 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-07-19 14:29:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 14:29:00,147 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-19 14:29:00,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:29:00,148 INFO L225 Difference]: With dead ends: 138 [2022-07-19 14:29:00,149 INFO L226 Difference]: Without dead ends: 136 [2022-07-19 14:29:00,149 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-19 14:29:00,150 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 126 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-19 14:29:00,150 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.5s Time] [2022-07-19 14:29:00,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-19 14:29:00,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 80. [2022-07-19 14:29:00,155 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-19 14:29:00,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-07-19 14:29:00,156 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 17 [2022-07-19 14:29:00,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:29:00,156 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-07-19 14:29:00,156 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-19 14:29:00,156 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-07-19 14:29:00,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 14:29:00,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:00,157 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-19 14:29:00,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-19 14:29:00,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:29:00,368 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-19 14:29:00,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:00,369 INFO L85 PathProgramCache]: Analyzing trace with hash 32191693, now seen corresponding path program 1 times [2022-07-19 14:29:00,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:00,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1703885197] [2022-07-19 14:29:00,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:29:00,370 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:00,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:00,371 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:29:00,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-19 14:29:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:29:00,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:29:00,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:00,484 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-19 14:29:00,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:29:00,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:29:00,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1703885197] [2022-07-19 14:29:00,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1703885197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:29:00,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:29:00,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:29:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460236908] [2022-07-19 14:29:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:29:00,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:29:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:29:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:29:00,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:29:00,489 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-19 14:29:00,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:29:00,537 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2022-07-19 14:29:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:29:00,538 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-19 14:29:00,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:29:00,539 INFO L225 Difference]: With dead ends: 166 [2022-07-19 14:29:00,539 INFO L226 Difference]: Without dead ends: 102 [2022-07-19 14:29:00,539 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-19 14:29:00,540 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-19 14:29:00,540 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-19 14:29:00,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-19 14:29:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-07-19 14:29:00,562 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-19 14:29:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-07-19 14:29:00,563 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 18 [2022-07-19 14:29:00,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:29:00,564 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-07-19 14:29:00,564 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-19 14:29:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-07-19 14:29:00,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 14:29:00,566 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:00,566 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-19 14:29:00,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-19 14:29:00,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:29:00,777 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-19 14:29:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:00,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1241125015, now seen corresponding path program 1 times [2022-07-19 14:29:00,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:00,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323979982] [2022-07-19 14:29:00,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:29:00,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:00,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:00,779 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:29:00,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-19 14:29:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:29:00,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 14:29:00,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:00,922 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-19 14:29:00,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 14:29:00,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:29:00,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323979982] [2022-07-19 14:29:00,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323979982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 14:29:00,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 14:29:00,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 14:29:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478042184] [2022-07-19 14:29:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 14:29:00,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 14:29:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:29:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 14:29:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:29:00,924 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-19 14:29:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:29:00,977 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2022-07-19 14:29:00,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 14:29:00,977 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-19 14:29:00,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:29:00,978 INFO L225 Difference]: With dead ends: 191 [2022-07-19 14:29:00,978 INFO L226 Difference]: Without dead ends: 115 [2022-07-19 14:29:00,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 14:29:00,979 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-19 14:29:00,979 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-19 14:29:00,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-19 14:29:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2022-07-19 14:29:00,985 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-19 14:29:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2022-07-19 14:29:00,985 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 24 [2022-07-19 14:29:00,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:29:00,985 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2022-07-19 14:29:00,986 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-19 14:29:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-07-19 14:29:00,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:29:00,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:00,986 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 14:29:00,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-19 14:29:01,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:29:01,198 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-19 14:29:01,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash 43662915, now seen corresponding path program 1 times [2022-07-19 14:29:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:01,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74251964] [2022-07-19 14:29:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:29:01,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:01,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:01,201 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:29:01,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-19 14:29:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:29:01,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-19 14:29:01,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:01,348 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-19 14:29:01,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:01,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:01,416 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-19 14:29:01,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:01,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:01,424 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-19 14:29:01,444 INFO L356 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-07-19 14:29:01,444 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-19 14:29:01,458 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-19 14:29:01,458 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-19 14:29:01,465 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-19 14:29:01,470 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-19 14:29:01,477 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-19 14:29:01,527 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-19 14:29:01,528 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-19 14:29:01,532 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-19 14:29:01,536 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-19 14:29:01,705 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-19 14:29:01,707 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-19 14:29:01,734 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-19 14:29:01,744 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-19 14:29:01,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:29:01,837 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-19 14:29:01,847 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-19 14:29:01,896 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-19 14:29:01,897 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 70 treesize of output 81 [2022-07-19 14:29:01,997 INFO L356 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2022-07-19 14:29:01,998 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 3 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 79 [2022-07-19 14:29:02,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:02,018 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 56 treesize of output 58 [2022-07-19 14:29:02,025 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 58 treesize of output 54 [2022-07-19 14:29:02,045 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-19 14:29:02,070 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-19 14:29:02,096 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-19 14:29:02,135 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:29:02,135 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 13 treesize of output 9 [2022-07-19 14:29:02,253 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-19 14:29:02,268 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-19 14:29:02,268 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 17 treesize of output 16 [2022-07-19 14:29:02,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:02,313 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 64 treesize of output 78 [2022-07-19 14:29:02,493 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 14:29:02,499 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-07-19 14:29:02,499 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 2 case distinctions, treesize of input 62 treesize of output 1 [2022-07-19 14:29:02,579 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-19 14:29:02,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:29:02,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74251964] [2022-07-19 14:29:02,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74251964] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:29:02,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:29:02,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-07-19 14:29:02,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114846654] [2022-07-19 14:29:02,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:29:02,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 14:29:02,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:29:02,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 14:29:02,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=71, Unknown=1, NotChecked=16, Total=110 [2022-07-19 14:29:02,581 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-19 14:29:03,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:29:03,426 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2022-07-19 14:29:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 14:29:03,427 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-19 14:29:03,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:29:03,429 INFO L225 Difference]: With dead ends: 180 [2022-07-19 14:29:03,429 INFO L226 Difference]: Without dead ends: 178 [2022-07-19 14:29:03,430 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-19 14:29:03,430 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 120 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-07-19 14:29:03,430 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.7s Time] [2022-07-19 14:29:03,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-19 14:29:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 111. [2022-07-19 14:29:03,444 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-19 14:29:03,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2022-07-19 14:29:03,446 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 25 [2022-07-19 14:29:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:29:03,451 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2022-07-19 14:29:03,451 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-19 14:29:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2022-07-19 14:29:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-19 14:29:03,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:29:03,453 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-19 14:29:03,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-19 14:29:03,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:29:03,659 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-19 14:29:03,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:29:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash 137879527, now seen corresponding path program 1 times [2022-07-19 14:29:03,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:29:03,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464878955] [2022-07-19 14:29:03,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:29:03,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:29:03,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:29:03,662 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:29:03,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-19 14:29:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:29:03,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-19 14:29:03,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:29:03,866 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-19 14:29:03,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:03,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:03,894 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-19 14:29:03,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:03,900 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-19 14:29:03,921 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:29:03,921 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-19 14:29:03,926 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-19 14:29:03,976 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-19 14:29:04,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:29:04,063 INFO L356 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2022-07-19 14:29:04,064 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-19 14:29:04,103 INFO L356 Elim1Store]: treesize reduction 71, result has 13.4 percent of original size [2022-07-19 14:29:04,104 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 124 treesize of output 95 [2022-07-19 14:29:04,129 INFO L356 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-07-19 14:29:04,129 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 29 treesize of output 39 [2022-07-19 14:29:04,140 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 9 treesize of output 7 [2022-07-19 14:29:04,206 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-19 14:29:04,207 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-19 14:29:04,366 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-19 14:29:04,366 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-19 14:29:04,377 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-19 14:29:04,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:29:04,410 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-19 14:29:04,446 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-19 14:29:04,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:04,519 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-19 14:29:04,534 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-19 14:29:04,754 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-19 14:29:04,754 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 159 [2022-07-19 14:29:05,360 INFO L356 Elim1Store]: treesize reduction 22, result has 79.0 percent of original size [2022-07-19 14:29:05,362 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 802385 treesize of output 797543 [2022-07-19 14:29:09,171 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 796941 treesize of output 775213 [2022-07-19 14:29:11,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:11,122 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 884508 treesize of output 726374 [2022-07-19 14:29:27,102 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 75 treesize of output 59 [2022-07-19 14:29:27,184 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-19 14:29:27,197 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 14:29:27,198 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 66 [2022-07-19 14:29:27,245 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:27,245 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 69 treesize of output 61 [2022-07-19 14:29:27,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:29:27,322 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 64 [2022-07-19 14:29:27,373 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-19 14:29:27,383 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 62 treesize of output 48 [2022-07-19 14:29:27,436 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-19 14:29:27,440 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 33 treesize of output 25 [2022-07-19 14:30:44,827 WARN L233 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 111 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-19 14:30:44,830 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-19 14:30:44,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 14:30:44,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464878955] [2022-07-19 14:30:44,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464878955] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 14:30:44,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 14:30:44,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2022-07-19 14:30:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275116291] [2022-07-19 14:30:44,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 14:30:44,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 14:30:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 14:30:44,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 14:30:44,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=54, Unknown=4, NotChecked=48, Total=132 [2022-07-19 14:30:44,831 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-19 14:30:45,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 14:30:45,279 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-07-19 14:30:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 14:30:45,280 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-19 14:30:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 14:30:45,280 INFO L225 Difference]: With dead ends: 140 [2022-07-19 14:30:45,281 INFO L226 Difference]: Without dead ends: 138 [2022-07-19 14:30:45,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 77.5s TimeCoverageRelationStatistics Valid=32, Invalid=66, Unknown=4, NotChecked=54, Total=156 [2022-07-19 14:30:45,281 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 27 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-07-19 14:30:45,282 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.4s Time] [2022-07-19 14:30:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-19 14:30:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 126. [2022-07-19 14:30:45,287 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-19 14:30:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2022-07-19 14:30:45,287 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 25 [2022-07-19 14:30:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 14:30:45,287 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2022-07-19 14:30:45,287 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-19 14:30:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2022-07-19 14:30:45,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 14:30:45,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 14:30:45,288 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-19 14:30:45,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-19 14:30:45,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 14:30:45,489 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-19 14:30:45,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 14:30:45,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1584320444, now seen corresponding path program 1 times [2022-07-19 14:30:45,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 14:30:45,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716275283] [2022-07-19 14:30:45,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 14:30:45,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 14:30:45,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 14:30:45,491 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 14:30:45,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-19 14:30:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 14:30:45,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-19 14:30:45,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 14:30:45,727 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-19 14:30:45,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:45,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:45,766 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-19 14:30:45,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:45,782 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-19 14:30:45,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:45,789 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-19 14:30:45,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:45,797 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-19 14:30:45,821 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-19 14:30:45,821 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-19 14:30:45,826 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-19 14:30:45,868 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-19 14:30:45,876 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-19 14:30:45,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:45,987 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-19 14:30:45,988 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-19 14:30:46,023 INFO L356 Elim1Store]: treesize reduction 71, result has 13.4 percent of original size [2022-07-19 14:30:46,024 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 106 [2022-07-19 14:30:46,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:46,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:46,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 43 [2022-07-19 14:30:46,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:46,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 14:30:46,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2022-07-19 14:30:46,068 INFO L356 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-07-19 14:30:46,068 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 30 treesize of output 40 [2022-07-19 14:30:46,074 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 9 treesize of output 7 [2022-07-19 14:30:46,167 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-19 14:30:46,167 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-19 14:30:46,174 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-19 14:30:46,415 INFO L356 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2022-07-19 14:30:46,416 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-19 14:30:46,420 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-19 14:30:46,431 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-19 14:30:46,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 14:30:46,486 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-19 14:30:46,545 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-19 14:30:46,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:46,791 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-19 14:30:46,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:30:46,810 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-19 14:30:46,860 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-19 14:30:47,718 INFO L356 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-07-19 14:30:47,718 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-19 14:30:48,538 INFO L356 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-07-19 14:30:48,539 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-19 14:31:19,762 WARN L233 SmtUtils]: Spent 31.16s on a formula simplification. DAG size of input: 370 DAG size of output: 150 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-19 14:31:19,763 INFO L356 Elim1Store]: treesize reduction 798, result has 27.9 percent of original size [2022-07-19 14:31:19,764 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 158618 [2022-07-19 14:31:23,189 INFO L356 Elim1Store]: treesize reduction 12, result has 88.6 percent of original size [2022-07-19 14:31:23,194 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 1150021 treesize of output 1122745 [2022-07-19 14:31:26,595 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 1122628 treesize of output 1079044 [2022-07-19 14:31:30,455 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:31:30,459 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 1169377 treesize of output 1144991 [2022-07-19 14:31:35,351 INFO L244 Elim1Store]: Index analysis took 239 ms [2022-07-19 14:31:49,834 WARN L233 SmtUtils]: Spent 14.46s 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-19 14:31:49,836 INFO L356 Elim1Store]: treesize reduction 191, result has 79.9 percent of original size [2022-07-19 14:31:49,844 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 4909869 treesize of output 4387640 [2022-07-19 14:32:01,924 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 6535 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:32:13,795 WARN L233 SmtUtils]: Spent 11.85s on a formula simplification that was a NOOP. DAG size: 6523 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-19 14:32:17,009 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 14:32:17,017 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 5137947 treesize of output 4578207