./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8a2a8c059e91938ad7ee96f17aa5eb207759b3b .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8a2a8c059e91938ad7ee96f17aa5eb207759b3b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 08:08:44,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 08:08:44,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 08:08:44,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 08:08:44,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 08:08:44,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 08:08:44,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 08:08:44,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 08:08:44,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 08:08:44,500 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 08:08:44,501 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 08:08:44,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 08:08:44,504 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 08:08:44,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 08:08:44,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 08:08:44,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 08:08:44,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 08:08:44,519 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 08:08:44,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 08:08:44,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 08:08:44,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 08:08:44,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 08:08:44,538 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 08:08:44,539 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 08:08:44,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 08:08:44,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 08:08:44,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 08:08:44,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 08:08:44,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 08:08:44,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 08:08:44,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 08:08:44,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 08:08:44,559 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 08:08:44,560 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 08:08:44,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 08:08:44,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 08:08:44,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 08:08:44,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 08:08:44,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 08:08:44,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 08:08:44,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 08:08:44,569 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-13 08:08:44,617 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 08:08:44,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 08:08:44,619 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 08:08:44,625 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 08:08:44,626 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 08:08:44,626 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 08:08:44,626 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 08:08:44,626 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 08:08:44,627 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 08:08:44,627 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 08:08:44,628 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 08:08:44,628 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 08:08:44,629 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 08:08:44,629 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 08:08:44,629 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 08:08:44,630 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 08:08:44,630 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 08:08:44,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 08:08:44,630 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 08:08:44,631 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 08:08:44,631 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 08:08:44,631 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 08:08:44,631 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 08:08:44,632 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 08:08:44,632 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 08:08:44,632 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 08:08:44,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 08:08:44,633 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 08:08:44,633 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 08:08:44,633 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 08:08:44,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 08:08:44,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 08:08:44,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:08:44,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 08:08:44,635 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 08:08:44,635 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 08:08:44,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 08:08:44,635 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 08:08:44,636 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 08:08:44,636 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> c8a2a8c059e91938ad7ee96f17aa5eb207759b3b [2021-10-13 08:08:44,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 08:08:44,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 08:08:44,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 08:08:44,939 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 08:08:44,940 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 08:08:44,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2021-10-13 08:08:45,086 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data/aa7805ac6/de34d363e6dc4f2eb926803bedeb050d/FLAG7a0a18918 [2021-10-13 08:08:45,681 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 08:08:45,682 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2021-10-13 08:08:45,696 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data/aa7805ac6/de34d363e6dc4f2eb926803bedeb050d/FLAG7a0a18918 [2021-10-13 08:08:45,951 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data/aa7805ac6/de34d363e6dc4f2eb926803bedeb050d [2021-10-13 08:08:45,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 08:08:45,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 08:08:45,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 08:08:45,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 08:08:45,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 08:08:45,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:08:45" (1/1) ... [2021-10-13 08:08:45,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@709aaaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:45, skipping insertion in model container [2021-10-13 08:08:45,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:08:45" (1/1) ... [2021-10-13 08:08:45,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 08:08:46,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 08:08:46,521 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:08:46,535 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 08:08:46,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:08:46,625 INFO L208 MainTranslator]: Completed translation [2021-10-13 08:08:46,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46 WrapperNode [2021-10-13 08:08:46,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 08:08:46,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 08:08:46,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 08:08:46,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 08:08:46,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,650 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,690 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 08:08:46,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 08:08:46,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 08:08:46,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 08:08:46,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,740 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,745 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 08:08:46,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 08:08:46,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 08:08:46,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 08:08:46,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (1/1) ... [2021-10-13 08:08:46,762 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:08:46,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:08:46,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 08:08:46,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 08:08:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 08:08:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 08:08:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 08:08:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 08:08:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 08:08:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 08:08:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 08:08:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 08:08:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 08:08:47,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 08:08:47,704 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-13 08:08:47,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:08:47 BoogieIcfgContainer [2021-10-13 08:08:47,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 08:08:47,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 08:08:47,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 08:08:47,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 08:08:47,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:08:45" (1/3) ... [2021-10-13 08:08:47,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3a42a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:08:47, skipping insertion in model container [2021-10-13 08:08:47,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:08:46" (2/3) ... [2021-10-13 08:08:47,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3a42a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:08:47, skipping insertion in model container [2021-10-13 08:08:47,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:08:47" (3/3) ... [2021-10-13 08:08:47,719 INFO L111 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2021-10-13 08:08:47,730 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 08:08:47,730 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-10-13 08:08:47,775 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 08:08:47,781 INFO L339 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=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 08:08:47,781 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-10-13 08:08:47,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 147 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:47,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 08:08:47,806 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:47,807 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 08:08:47,807 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:47,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:47,812 INFO L82 PathProgramCache]: Analyzing trace with hash 8405, now seen corresponding path program 1 times [2021-10-13 08:08:47,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:47,823 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987032460] [2021-10-13 08:08:47,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:47,824 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:48,014 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:48,015 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987032460] [2021-10-13 08:08:48,016 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987032460] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:48,016 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:48,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 08:08:48,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029276452] [2021-10-13 08:08:48,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:08:48,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:48,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:08:48,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:48,062 INFO L87 Difference]: Start difference. First operand has 148 states, 62 states have (on average 2.5161290322580645) internal successors, (156), 147 states have internal predecessors, (156), 0 states have call successors, (0), 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, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:48,349 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2021-10-13 08:08:48,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:08:48,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-10-13 08:08:48,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:48,367 INFO L225 Difference]: With dead ends: 177 [2021-10-13 08:08:48,367 INFO L226 Difference]: Without dead ends: 176 [2021-10-13 08:08:48,369 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-10-13 08:08:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 144. [2021-10-13 08:08:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 62 states have (on average 2.435483870967742) internal successors, (151), 143 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:48,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 151 transitions. [2021-10-13 08:08:48,441 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 151 transitions. Word has length 2 [2021-10-13 08:08:48,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:48,442 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 151 transitions. [2021-10-13 08:08:48,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:48,442 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2021-10-13 08:08:48,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 08:08:48,443 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:48,443 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 08:08:48,443 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 08:08:48,443 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash 8406, now seen corresponding path program 1 times [2021-10-13 08:08:48,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:48,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79517105] [2021-10-13 08:08:48,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:48,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:48,526 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:48,527 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79517105] [2021-10-13 08:08:48,527 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79517105] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:48,527 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:48,527 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 08:08:48,527 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433820487] [2021-10-13 08:08:48,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:08:48,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:48,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:08:48,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:48,532 INFO L87 Difference]: Start difference. First operand 144 states and 151 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:48,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:48,714 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2021-10-13 08:08:48,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:08:48,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2021-10-13 08:08:48,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:48,720 INFO L225 Difference]: With dead ends: 143 [2021-10-13 08:08:48,720 INFO L226 Difference]: Without dead ends: 143 [2021-10-13 08:08:48,721 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:48,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-13 08:08:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2021-10-13 08:08:48,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 62 states have (on average 2.403225806451613) internal successors, (149), 141 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2021-10-13 08:08:48,741 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 2 [2021-10-13 08:08:48,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:48,742 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2021-10-13 08:08:48,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:48,742 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2021-10-13 08:08:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-13 08:08:48,743 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:48,743 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-13 08:08:48,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 08:08:48,743 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:48,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:48,744 INFO L82 PathProgramCache]: Analyzing trace with hash 8083974, now seen corresponding path program 1 times [2021-10-13 08:08:48,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:48,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081595647] [2021-10-13 08:08:48,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:48,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:48,841 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:48,841 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081595647] [2021-10-13 08:08:48,841 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081595647] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:48,842 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:48,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 08:08:48,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326459058] [2021-10-13 08:08:48,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:08:48,843 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:48,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:08:48,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:48,844 INFO L87 Difference]: Start difference. First operand 142 states and 149 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:49,034 INFO L93 Difference]: Finished difference Result 167 states and 176 transitions. [2021-10-13 08:08:49,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:08:49,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-13 08:08:49,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:49,037 INFO L225 Difference]: With dead ends: 167 [2021-10-13 08:08:49,037 INFO L226 Difference]: Without dead ends: 167 [2021-10-13 08:08:49,038 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-13 08:08:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 146. [2021-10-13 08:08:49,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 68 states have (on average 2.323529411764706) internal successors, (158), 145 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2021-10-13 08:08:49,059 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 4 [2021-10-13 08:08:49,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:49,059 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2021-10-13 08:08:49,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,060 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2021-10-13 08:08:49,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-13 08:08:49,061 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:49,061 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-13 08:08:49,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 08:08:49,062 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:49,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:49,063 INFO L82 PathProgramCache]: Analyzing trace with hash 8083975, now seen corresponding path program 1 times [2021-10-13 08:08:49,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:49,063 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926326420] [2021-10-13 08:08:49,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:49,064 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:49,126 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:49,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926326420] [2021-10-13 08:08:49,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926326420] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:49,127 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:49,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 08:08:49,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745330389] [2021-10-13 08:08:49,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:08:49,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:49,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:08:49,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:49,129 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:49,263 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2021-10-13 08:08:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:08:49,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-13 08:08:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:49,265 INFO L225 Difference]: With dead ends: 145 [2021-10-13 08:08:49,265 INFO L226 Difference]: Without dead ends: 145 [2021-10-13 08:08:49,266 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:49,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-13 08:08:49,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2021-10-13 08:08:49,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 68 states have (on average 2.2941176470588234) internal successors, (156), 143 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2021-10-13 08:08:49,271 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 4 [2021-10-13 08:08:49,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:49,271 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2021-10-13 08:08:49,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,272 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2021-10-13 08:08:49,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 08:08:49,272 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:49,272 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:49,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 08:08:49,273 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:49,274 INFO L82 PathProgramCache]: Analyzing trace with hash 311697544, now seen corresponding path program 1 times [2021-10-13 08:08:49,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:49,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802606027] [2021-10-13 08:08:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:49,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:49,322 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:49,322 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802606027] [2021-10-13 08:08:49,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802606027] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:49,323 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:49,323 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 08:08:49,323 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575738171] [2021-10-13 08:08:49,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:08:49,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:49,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:08:49,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:49,325 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:49,484 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2021-10-13 08:08:49,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:08:49,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-13 08:08:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:49,486 INFO L225 Difference]: With dead ends: 163 [2021-10-13 08:08:49,486 INFO L226 Difference]: Without dead ends: 163 [2021-10-13 08:08:49,487 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-10-13 08:08:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 134. [2021-10-13 08:08:49,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 68 states have (on average 2.1470588235294117) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2021-10-13 08:08:49,491 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 7 [2021-10-13 08:08:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:49,492 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2021-10-13 08:08:49,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2021-10-13 08:08:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-13 08:08:49,493 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:49,493 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:49,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 08:08:49,493 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:49,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:49,494 INFO L82 PathProgramCache]: Analyzing trace with hash 311697545, now seen corresponding path program 1 times [2021-10-13 08:08:49,494 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:49,494 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785670352] [2021-10-13 08:08:49,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:49,495 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:49,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:49,545 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:49,545 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785670352] [2021-10-13 08:08:49,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785670352] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:49,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:49,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 08:08:49,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949881827] [2021-10-13 08:08:49,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:08:49,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:49,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:08:49,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:49,548 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:49,670 INFO L93 Difference]: Finished difference Result 125 states and 137 transitions. [2021-10-13 08:08:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:08:49,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2021-10-13 08:08:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:49,672 INFO L225 Difference]: With dead ends: 125 [2021-10-13 08:08:49,676 INFO L226 Difference]: Without dead ends: 125 [2021-10-13 08:08:49,676 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:49,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-13 08:08:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2021-10-13 08:08:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 2.0) internal successors, (136), 123 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) [2021-10-13 08:08:49,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2021-10-13 08:08:49,680 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 7 [2021-10-13 08:08:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:49,681 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2021-10-13 08:08:49,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2021-10-13 08:08:49,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 08:08:49,682 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:49,682 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:49,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 08:08:49,682 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:49,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:49,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1072689266, now seen corresponding path program 1 times [2021-10-13 08:08:49,683 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:49,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364699434] [2021-10-13 08:08:49,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:49,684 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:49,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:49,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:49,783 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:49,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364699434] [2021-10-13 08:08:49,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364699434] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:49,783 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:49,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 08:08:49,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744774687] [2021-10-13 08:08:49,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 08:08:49,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:49,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 08:08:49,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 08:08:49,785 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2021-10-13 08:08:50,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:50,003 INFO L93 Difference]: Finished difference Result 145 states and 157 transitions. [2021-10-13 08:08:50,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:08:50,003 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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 [2021-10-13 08:08:50,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:50,005 INFO L225 Difference]: With dead ends: 145 [2021-10-13 08:08:50,005 INFO L226 Difference]: Without dead ends: 145 [2021-10-13 08:08:50,005 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 08:08:50,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-13 08:08:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 119. [2021-10-13 08:08:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 118 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 138 transitions. [2021-10-13 08:08:50,010 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 138 transitions. Word has length 8 [2021-10-13 08:08:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:50,010 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 138 transitions. [2021-10-13 08:08:50,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2021-10-13 08:08:50,011 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 138 transitions. [2021-10-13 08:08:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 08:08:50,011 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:50,011 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:50,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 08:08:50,012 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:50,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1072689267, now seen corresponding path program 1 times [2021-10-13 08:08:50,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:50,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188669828] [2021-10-13 08:08:50,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:50,013 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:50,198 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:50,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188669828] [2021-10-13 08:08:50,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188669828] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:50,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:50,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 08:08:50,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118280018] [2021-10-13 08:08:50,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 08:08:50,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:50,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 08:08:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 08:08:50,201 INFO L87 Difference]: Start difference. First operand 119 states and 138 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2021-10-13 08:08:50,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:50,507 INFO L93 Difference]: Finished difference Result 217 states and 236 transitions. [2021-10-13 08:08:50,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 08:08:50,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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 [2021-10-13 08:08:50,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:50,509 INFO L225 Difference]: With dead ends: 217 [2021-10-13 08:08:50,509 INFO L226 Difference]: Without dead ends: 217 [2021-10-13 08:08:50,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 81.6ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-13 08:08:50,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-13 08:08:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 110. [2021-10-13 08:08:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.6842105263157894) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 128 transitions. [2021-10-13 08:08:50,513 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 128 transitions. Word has length 8 [2021-10-13 08:08:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:50,513 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 128 transitions. [2021-10-13 08:08:50,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2021-10-13 08:08:50,514 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 128 transitions. [2021-10-13 08:08:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-13 08:08:50,514 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:50,514 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:50,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 08:08:50,515 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash -10163226, now seen corresponding path program 1 times [2021-10-13 08:08:50,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:50,516 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528592175] [2021-10-13 08:08:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:50,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:50,799 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:50,799 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528592175] [2021-10-13 08:08:50,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528592175] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:50,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:50,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 08:08:50,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402610300] [2021-10-13 08:08:50,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 08:08:50,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:50,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 08:08:50,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 08:08:50,802 INFO L87 Difference]: Start difference. First operand 110 states and 128 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:51,108 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2021-10-13 08:08:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 08:08:51,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-13 08:08:51,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:51,110 INFO L225 Difference]: With dead ends: 147 [2021-10-13 08:08:51,110 INFO L226 Difference]: Without dead ends: 147 [2021-10-13 08:08:51,110 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 111.7ms TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2021-10-13 08:08:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-13 08:08:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 114. [2021-10-13 08:08:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 80 states have (on average 1.65) internal successors, (132), 113 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2021-10-13 08:08:51,113 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 15 [2021-10-13 08:08:51,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:51,113 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2021-10-13 08:08:51,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2021-10-13 08:08:51,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 08:08:51,114 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:51,114 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:51,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 08:08:51,115 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:51,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:51,115 INFO L82 PathProgramCache]: Analyzing trace with hash 230349510, now seen corresponding path program 1 times [2021-10-13 08:08:51,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:51,116 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264126439] [2021-10-13 08:08:51,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:51,116 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:51,363 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:51,364 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264126439] [2021-10-13 08:08:51,364 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264126439] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:51,364 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:51,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 08:08:51,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576892702] [2021-10-13 08:08:51,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 08:08:51,365 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:51,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 08:08:51,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-13 08:08:51,366 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:51,714 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2021-10-13 08:08:51,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 08:08:51,715 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-10-13 08:08:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:51,716 INFO L225 Difference]: With dead ends: 141 [2021-10-13 08:08:51,716 INFO L226 Difference]: Without dead ends: 141 [2021-10-13 08:08:51,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 119.1ms TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2021-10-13 08:08:51,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2021-10-13 08:08:51,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 116. [2021-10-13 08:08:51,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.6341463414634145) internal successors, (134), 115 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:51,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 134 transitions. [2021-10-13 08:08:51,721 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 134 transitions. Word has length 16 [2021-10-13 08:08:51,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:51,722 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 134 transitions. [2021-10-13 08:08:51,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:51,722 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 134 transitions. [2021-10-13 08:08:51,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 08:08:51,723 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:51,723 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:51,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 08:08:51,724 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:51,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:51,724 INFO L82 PathProgramCache]: Analyzing trace with hash 752963403, now seen corresponding path program 1 times [2021-10-13 08:08:51,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:51,725 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462984016] [2021-10-13 08:08:51,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:51,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:51,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:51,766 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:51,767 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462984016] [2021-10-13 08:08:51,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462984016] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:51,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:51,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 08:08:51,768 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655541943] [2021-10-13 08:08:51,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:08:51,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:51,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:08:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:51,769 INFO L87 Difference]: Start difference. First operand 116 states and 134 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:51,787 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2021-10-13 08:08:51,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:08:51,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 08:08:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:51,790 INFO L225 Difference]: With dead ends: 143 [2021-10-13 08:08:51,790 INFO L226 Difference]: Without dead ends: 143 [2021-10-13 08:08:51,791 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:08:51,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-10-13 08:08:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 106. [2021-10-13 08:08:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.5972222222222223) internal successors, (115), 105 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) [2021-10-13 08:08:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 115 transitions. [2021-10-13 08:08:51,794 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 115 transitions. Word has length 21 [2021-10-13 08:08:51,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:51,795 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 115 transitions. [2021-10-13 08:08:51,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:51,796 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 115 transitions. [2021-10-13 08:08:51,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 08:08:51,796 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:51,797 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:51,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 08:08:51,797 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:51,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:51,798 INFO L82 PathProgramCache]: Analyzing trace with hash 752806916, now seen corresponding path program 1 times [2021-10-13 08:08:51,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:51,799 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230719433] [2021-10-13 08:08:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:51,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:51,916 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:51,917 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230719433] [2021-10-13 08:08:51,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230719433] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:51,917 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:51,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 08:08:51,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930774251] [2021-10-13 08:08:51,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 08:08:51,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:51,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 08:08:51,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 08:08:51,919 INFO L87 Difference]: Start difference. First operand 106 states and 115 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:52,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:52,084 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2021-10-13 08:08:52,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:08:52,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 08:08:52,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:52,086 INFO L225 Difference]: With dead ends: 137 [2021-10-13 08:08:52,087 INFO L226 Difference]: Without dead ends: 137 [2021-10-13 08:08:52,087 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 08:08:52,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-10-13 08:08:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2021-10-13 08:08:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.5833333333333333) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:52,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2021-10-13 08:08:52,090 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 21 [2021-10-13 08:08:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:52,091 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2021-10-13 08:08:52,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2021-10-13 08:08:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-13 08:08:52,092 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:52,092 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:52,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 08:08:52,093 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:52,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash 752806917, now seen corresponding path program 1 times [2021-10-13 08:08:52,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:52,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304800353] [2021-10-13 08:08:52,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:52,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:52,212 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:52,212 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304800353] [2021-10-13 08:08:52,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304800353] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 08:08:52,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:08:52,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 08:08:52,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991151139] [2021-10-13 08:08:52,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-13 08:08:52,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 08:08:52,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-13 08:08:52,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 08:08:52,215 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:08:52,438 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2021-10-13 08:08:52,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 08:08:52,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-13 08:08:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:08:52,440 INFO L225 Difference]: With dead ends: 114 [2021-10-13 08:08:52,440 INFO L226 Difference]: Without dead ends: 114 [2021-10-13 08:08:52,441 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 73.3ms TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-10-13 08:08:52,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-10-13 08:08:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2021-10-13 08:08:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2021-10-13 08:08:52,444 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 21 [2021-10-13 08:08:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:08:52,447 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2021-10-13 08:08:52,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:08:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2021-10-13 08:08:52,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-13 08:08:52,450 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:08:52,451 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:08:52,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 08:08:52,451 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:08:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:08:52,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1993400646, now seen corresponding path program 1 times [2021-10-13 08:08:52,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 08:08:52,452 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441874626] [2021-10-13 08:08:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:52,453 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 08:08:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:52,964 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 08:08:52,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441874626] [2021-10-13 08:08:52,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441874626] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 08:08:52,964 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983210015] [2021-10-13 08:08:52,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:08:52,965 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:08:52,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:08:52,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 08:08:52,976 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 08:08:53,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:08:53,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 36 conjunts are in the unsatisfiable core [2021-10-13 08:08:53,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:08:53,264 INFO L388 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 [2021-10-13 08:08:53,376 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-10-13 08:08:53,376 INFO L388 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 21 [2021-10-13 08:08:53,637 INFO L354 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2021-10-13 08:08:53,638 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 26 treesize of output 37 [2021-10-13 08:08:54,193 INFO L388 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 20 treesize of output 16 [2021-10-13 08:08:54,305 INFO L388 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 29 treesize of output 28 [2021-10-13 08:08:54,482 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 08:08:54,482 INFO L388 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 87 treesize of output 62 [2021-10-13 08:08:54,972 INFO L354 Elim1Store]: treesize reduction 108, result has 27.0 percent of original size [2021-10-13 08:08:54,972 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 93 treesize of output 117 [2021-10-13 08:08:55,214 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:08:55,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 106 treesize of output 73 [2021-10-13 08:08:56,084 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:08:56,085 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 104 treesize of output 82 [2021-10-13 08:08:56,341 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 08:08:56,342 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 113 treesize of output 91 [2021-10-13 08:08:56,652 INFO L354 Elim1Store]: treesize reduction 150, result has 2.0 percent of original size [2021-10-13 08:08:56,653 INFO L388 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 129 treesize of output 75 [2021-10-13 08:08:56,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:08:56,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:08:58,970 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:08:58,972 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-10-13 08:09:05,935 INFO L388 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 34382 treesize of output 34286 [2021-10-13 08:09:06,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 08:09:06,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1147324800] [2021-10-13 08:09:06,233 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2021-10-13 08:09:06,234 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 08:09:06,243 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 08:09:06,251 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 08:09:06,252 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 08:09:06,325 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:09:06,328 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 08:09:06,329 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:09:06,329 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 08:09:06,330 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 08:09:06,331 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:09:06,331 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 08:09:06,333 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-13 08:09:06,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:09:06,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:09:06,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:09:06,366 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-13 08:09:06,367 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:09:06,368 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 08:09:06,369 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:09:06,369 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 08:09:06,370 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 08:09:06,372 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 08:09:06,386 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:09:06,388 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:09:06,389 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 113 [2021-10-13 08:09:06,390 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 08:09:06,390 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:110, output treesize:113 [2021-10-13 08:09:06,432 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:06,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:09:06,613 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_149| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) 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) [2021-10-13 08:09:06,627 INFO L168 Benchmark]: Toolchain (without parser) took 20668.41 ms. Allocated memory was 102.8 MB in the beginning and 226.5 MB in the end (delta: 123.7 MB). Free memory was 68.4 MB in the beginning and 186.5 MB in the end (delta: -118.1 MB). Peak memory consumption was 6.9 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:06,627 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 102.8 MB. Free memory is still 54.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:09:06,627 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.26 ms. Allocated memory was 102.8 MB in the beginning and 157.3 MB in the end (delta: 54.5 MB). Free memory was 68.0 MB in the beginning and 124.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:06,628 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.66 ms. Allocated memory is still 157.3 MB. Free memory was 124.7 MB in the beginning and 122.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:06,628 INFO L168 Benchmark]: Boogie Preprocessor took 56.91 ms. Allocated memory is still 157.3 MB. Free memory was 122.5 MB in the beginning and 119.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:06,633 INFO L168 Benchmark]: RCFGBuilder took 955.43 ms. Allocated memory is still 157.3 MB. Free memory was 119.7 MB in the beginning and 89.9 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-10-13 08:09:06,633 INFO L168 Benchmark]: TraceAbstraction took 18915.38 ms. Allocated memory was 157.3 MB in the beginning and 226.5 MB in the end (delta: 69.2 MB). Free memory was 89.1 MB in the beginning and 186.5 MB in the end (delta: -97.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:09:06,636 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.36 ms. Allocated memory is still 102.8 MB. Free memory is still 54.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 663.26 ms. Allocated memory was 102.8 MB in the beginning and 157.3 MB in the end (delta: 54.5 MB). Free memory was 68.0 MB in the beginning and 124.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.66 ms. Allocated memory is still 157.3 MB. Free memory was 124.7 MB in the beginning and 122.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.91 ms. Allocated memory is still 157.3 MB. Free memory was 122.5 MB in the beginning and 119.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 955.43 ms. Allocated memory is still 157.3 MB. Free memory was 119.7 MB in the beginning and 89.9 MB in the end (delta: 29.8 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 18915.38 ms. Allocated memory was 157.3 MB in the beginning and 226.5 MB in the end (delta: 69.2 MB). Free memory was 89.1 MB in the beginning and 186.5 MB in the end (delta: -97.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_149| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_149|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 08:09:06,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 08:09:09,521 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 08:09:09,523 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 08:09:09,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 08:09:09,565 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 08:09:09,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 08:09:09,570 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 08:09:09,573 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 08:09:09,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 08:09:09,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 08:09:09,579 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 08:09:09,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 08:09:09,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 08:09:09,583 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 08:09:09,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 08:09:09,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 08:09:09,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 08:09:09,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 08:09:09,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 08:09:09,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 08:09:09,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 08:09:09,617 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 08:09:09,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 08:09:09,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 08:09:09,626 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 08:09:09,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 08:09:09,627 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 08:09:09,628 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 08:09:09,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 08:09:09,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 08:09:09,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 08:09:09,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 08:09:09,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 08:09:09,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 08:09:09,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 08:09:09,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 08:09:09,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 08:09:09,647 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 08:09:09,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 08:09:09,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 08:09:09,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 08:09:09,653 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2021-10-13 08:09:09,710 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 08:09:09,713 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 08:09:09,716 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 08:09:09,716 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 08:09:09,717 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 08:09:09,717 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 08:09:09,717 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 08:09:09,718 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 08:09:09,718 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 08:09:09,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 08:09:09,721 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 08:09:09,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 08:09:09,722 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 08:09:09,722 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 08:09:09,723 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 08:09:09,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 08:09:09,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 08:09:09,724 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 08:09:09,724 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 08:09:09,724 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-13 08:09:09,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 08:09:09,725 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 08:09:09,725 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 08:09:09,725 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 08:09:09,726 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 08:09:09,726 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 08:09:09,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 08:09:09,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 08:09:09,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 08:09:09,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:09:09,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 08:09:09,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 08:09:09,728 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 08:09:09,729 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 08:09:09,729 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 08:09:09,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 08:09:09,730 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> c8a2a8c059e91938ad7ee96f17aa5eb207759b3b [2021-10-13 08:09:10,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 08:09:10,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 08:09:10,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 08:09:10,208 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 08:09:10,209 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 08:09:10,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2021-10-13 08:09:10,272 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data/e77bd8029/c64879fbc65848a5af231b158dd00f5c/FLAG31562f3b6 [2021-10-13 08:09:11,022 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 08:09:11,023 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2021-10-13 08:09:11,037 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data/e77bd8029/c64879fbc65848a5af231b158dd00f5c/FLAG31562f3b6 [2021-10-13 08:09:11,295 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/data/e77bd8029/c64879fbc65848a5af231b158dd00f5c [2021-10-13 08:09:11,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 08:09:11,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 08:09:11,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 08:09:11,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 08:09:11,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 08:09:11,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:11,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5394cf7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11, skipping insertion in model container [2021-10-13 08:09:11,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:11,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 08:09:11,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 08:09:11,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:09:11,728 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 08:09:11,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 08:09:11,865 INFO L208 MainTranslator]: Completed translation [2021-10-13 08:09:11,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11 WrapperNode [2021-10-13 08:09:11,867 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 08:09:11,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 08:09:11,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 08:09:11,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 08:09:11,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:11,914 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:11,968 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 08:09:11,971 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 08:09:11,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 08:09:11,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 08:09:11,982 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:11,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:12,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:12,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:12,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:12,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:12,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:12,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 08:09:12,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 08:09:12,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 08:09:12,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 08:09:12,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (1/1) ... [2021-10-13 08:09:12,081 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 08:09:12,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:09:12,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 08:09:12,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 08:09:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 08:09:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 08:09:12,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 08:09:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 08:09:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2021-10-13 08:09:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 08:09:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 08:09:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 08:09:12,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 08:09:13,381 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 08:09:13,381 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2021-10-13 08:09:13,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:13 BoogieIcfgContainer [2021-10-13 08:09:13,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 08:09:13,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 08:09:13,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 08:09:13,392 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 08:09:13,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:09:11" (1/3) ... [2021-10-13 08:09:13,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c95079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:09:13, skipping insertion in model container [2021-10-13 08:09:13,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:09:11" (2/3) ... [2021-10-13 08:09:13,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c95079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:09:13, skipping insertion in model container [2021-10-13 08:09:13,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:13" (3/3) ... [2021-10-13 08:09:13,395 INFO L111 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2021-10-13 08:09:13,401 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 08:09:13,402 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 85 error locations. [2021-10-13 08:09:13,451 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 08:09:13,477 INFO L339 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=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 08:09:13,477 INFO L340 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2021-10-13 08:09:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 81 states have (on average 2.197530864197531) internal successors, (178), 166 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:13,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 08:09:13,511 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:13,512 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 08:09:13,512 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:09:13,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:13,525 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-10-13 08:09:13,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:13,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [998251875] [2021-10-13 08:09:13,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:13,540 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:13,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:13,545 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:13,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 08:09:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:13,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 08:09:13,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:13,785 INFO L388 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 [2021-10-13 08:09:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:13,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:13,832 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:09:13,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [998251875] [2021-10-13 08:09:13,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [998251875] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:09:13,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:09:13,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 08:09:13,836 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166226916] [2021-10-13 08:09:13,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:09:13,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:09:13,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:09:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:09:13,879 INFO L87 Difference]: Start difference. First operand has 167 states, 81 states have (on average 2.197530864197531) internal successors, (178), 166 states have internal predecessors, (178), 0 states have call successors, (0), 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, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:09:14,392 INFO L93 Difference]: Finished difference Result 201 states and 210 transitions. [2021-10-13 08:09:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:09:14,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-10-13 08:09:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:09:14,416 INFO L225 Difference]: With dead ends: 201 [2021-10-13 08:09:14,417 INFO L226 Difference]: Without dead ends: 199 [2021-10-13 08:09:14,419 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:09:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-10-13 08:09:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 162. [2021-10-13 08:09:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 80 states have (on average 2.1125) internal successors, (169), 161 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 169 transitions. [2021-10-13 08:09:14,478 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 169 transitions. Word has length 3 [2021-10-13 08:09:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:09:14,478 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 169 transitions. [2021-10-13 08:09:14,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 169 transitions. [2021-10-13 08:09:14,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-13 08:09:14,479 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:14,479 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-13 08:09:14,488 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:14,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:09:14,680 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:09:14,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:14,681 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-10-13 08:09:14,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:14,683 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123472317] [2021-10-13 08:09:14,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:14,683 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:14,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:14,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:14,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 08:09:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:14,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 08:09:14,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:14,814 INFO L388 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 [2021-10-13 08:09:14,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:14,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:14,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:14,921 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:09:14,921 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123472317] [2021-10-13 08:09:14,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123472317] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:09:14,922 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:09:14,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 08:09:14,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655882959] [2021-10-13 08:09:14,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:09:14,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:09:14,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:09:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:09:14,931 INFO L87 Difference]: Start difference. First operand 162 states and 169 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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) [2021-10-13 08:09:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:09:16,077 INFO L93 Difference]: Finished difference Result 211 states and 222 transitions. [2021-10-13 08:09:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 08:09:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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 3 [2021-10-13 08:09:16,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:09:16,080 INFO L225 Difference]: With dead ends: 211 [2021-10-13 08:09:16,080 INFO L226 Difference]: Without dead ends: 211 [2021-10-13 08:09:16,081 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:09:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-10-13 08:09:16,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 184. [2021-10-13 08:09:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 104 states have (on average 2.125) internal successors, (221), 183 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 221 transitions. [2021-10-13 08:09:16,095 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 221 transitions. Word has length 3 [2021-10-13 08:09:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:09:16,095 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 221 transitions. [2021-10-13 08:09:16,096 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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) [2021-10-13 08:09:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 221 transitions. [2021-10-13 08:09:16,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 08:09:16,096 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:16,105 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 08:09:16,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:16,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:09:16,317 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:09:16,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:16,318 INFO L82 PathProgramCache]: Analyzing trace with hash 889446152, now seen corresponding path program 1 times [2021-10-13 08:09:16,319 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:16,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [390881301] [2021-10-13 08:09:16,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:16,320 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:16,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:16,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:16,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 08:09:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:16,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 08:09:16,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:16,416 INFO L388 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 [2021-10-13 08:09:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:16,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:16,442 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:09:16,442 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [390881301] [2021-10-13 08:09:16,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [390881301] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:09:16,443 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:09:16,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 08:09:16,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857231871] [2021-10-13 08:09:16,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:09:16,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:09:16,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:09:16,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:09:16,446 INFO L87 Difference]: Start difference. First operand 184 states and 221 transitions. Second operand has 3 states, 2 states have (on average 3.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) [2021-10-13 08:09:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:09:16,870 INFO L93 Difference]: Finished difference Result 212 states and 251 transitions. [2021-10-13 08:09:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:09:16,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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 [2021-10-13 08:09:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:09:16,872 INFO L225 Difference]: With dead ends: 212 [2021-10-13 08:09:16,873 INFO L226 Difference]: Without dead ends: 212 [2021-10-13 08:09:16,873 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:09:16,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2021-10-13 08:09:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 189. [2021-10-13 08:09:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 111 states have (on average 2.081081081081081) internal successors, (231), 188 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:16,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 231 transitions. [2021-10-13 08:09:16,886 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 231 transitions. Word has length 6 [2021-10-13 08:09:16,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:09:16,887 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 231 transitions. [2021-10-13 08:09:16,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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) [2021-10-13 08:09:16,887 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 231 transitions. [2021-10-13 08:09:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 08:09:16,888 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:16,888 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 08:09:16,905 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:17,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:09:17,102 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:09:17,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:17,103 INFO L82 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2021-10-13 08:09:17,103 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:17,104 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198261373] [2021-10-13 08:09:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:17,104 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:17,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:17,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:17,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 08:09:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:17,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 08:09:17,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:17,221 INFO L388 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 [2021-10-13 08:09:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:17,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:17,294 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:09:17,294 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198261373] [2021-10-13 08:09:17,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198261373] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:09:17,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:09:17,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 08:09:17,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660637560] [2021-10-13 08:09:17,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:09:17,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:09:17,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:09:17,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:09:17,297 INFO L87 Difference]: Start difference. First operand 189 states and 231 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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) [2021-10-13 08:09:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:09:18,375 INFO L93 Difference]: Finished difference Result 272 states and 294 transitions. [2021-10-13 08:09:18,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 08:09:18,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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 6 [2021-10-13 08:09:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:09:18,377 INFO L225 Difference]: With dead ends: 272 [2021-10-13 08:09:18,378 INFO L226 Difference]: Without dead ends: 272 [2021-10-13 08:09:18,378 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:09:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2021-10-13 08:09:18,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 187. [2021-10-13 08:09:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 111 states have (on average 2.063063063063063) internal successors, (229), 186 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 229 transitions. [2021-10-13 08:09:18,388 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 229 transitions. Word has length 6 [2021-10-13 08:09:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:09:18,389 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 229 transitions. [2021-10-13 08:09:18,389 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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) [2021-10-13 08:09:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 229 transitions. [2021-10-13 08:09:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 08:09:18,390 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:18,390 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:09:18,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:18,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:09:18,601 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:09:18,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:18,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1113926380, now seen corresponding path program 1 times [2021-10-13 08:09:18,603 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:18,603 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042212186] [2021-10-13 08:09:18,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:18,604 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:18,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:18,605 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:18,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 08:09:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:18,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 08:09:18,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:18,723 INFO L388 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 [2021-10-13 08:09:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:18,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:18,765 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:09:18,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042212186] [2021-10-13 08:09:18,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042212186] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:09:18,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:09:18,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-13 08:09:18,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608135420] [2021-10-13 08:09:18,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 08:09:18,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:09:18,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 08:09:18,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:09:18,769 INFO L87 Difference]: Start difference. First operand 187 states and 229 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:09:19,095 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2021-10-13 08:09:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:09:19,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2021-10-13 08:09:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:09:19,098 INFO L225 Difference]: With dead ends: 210 [2021-10-13 08:09:19,098 INFO L226 Difference]: Without dead ends: 210 [2021-10-13 08:09:19,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 08:09:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2021-10-13 08:09:19,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 177. [2021-10-13 08:09:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 111 states have (on average 1.927927927927928) internal successors, (214), 176 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:19,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 214 transitions. [2021-10-13 08:09:19,107 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 214 transitions. Word has length 10 [2021-10-13 08:09:19,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:09:19,108 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 214 transitions. [2021-10-13 08:09:19,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:19,120 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 214 transitions. [2021-10-13 08:09:19,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 08:09:19,121 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:19,121 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:09:19,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:19,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:09:19,322 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:09:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:19,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1113926381, now seen corresponding path program 1 times [2021-10-13 08:09:19,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:19,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709426475] [2021-10-13 08:09:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:19,323 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:19,324 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:19,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 08:09:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:19,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-13 08:09:19,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:19,453 INFO L388 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 [2021-10-13 08:09:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:19,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:19,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:19,534 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:09:19,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709426475] [2021-10-13 08:09:19,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709426475] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:09:19,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:09:19,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2021-10-13 08:09:19,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194390522] [2021-10-13 08:09:19,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:09:19,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:09:19,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:09:19,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:09:19,537 INFO L87 Difference]: Start difference. First operand 177 states and 214 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2021-10-13 08:09:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:09:19,934 INFO L93 Difference]: Finished difference Result 167 states and 199 transitions. [2021-10-13 08:09:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 08:09:19,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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 10 [2021-10-13 08:09:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:09:19,937 INFO L225 Difference]: With dead ends: 167 [2021-10-13 08:09:19,937 INFO L226 Difference]: Without dead ends: 167 [2021-10-13 08:09:19,938 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:09:19,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-10-13 08:09:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2021-10-13 08:09:19,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7927927927927927) internal successors, (199), 166 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:19,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 199 transitions. [2021-10-13 08:09:19,944 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 199 transitions. Word has length 10 [2021-10-13 08:09:19,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:09:19,944 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 199 transitions. [2021-10-13 08:09:19,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 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) [2021-10-13 08:09:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 199 transitions. [2021-10-13 08:09:19,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 08:09:19,945 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:19,946 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:09:19,960 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:20,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:09:20,147 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:09:20,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:20,147 INFO L82 PathProgramCache]: Analyzing trace with hash 171979406, now seen corresponding path program 1 times [2021-10-13 08:09:20,148 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:20,148 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516573961] [2021-10-13 08:09:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:20,149 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:20,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:20,150 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:20,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 08:09:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:20,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 08:09:20,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:20,303 INFO L388 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 [2021-10-13 08:09:20,372 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:09:20,372 INFO L388 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 23 treesize of output 30 [2021-10-13 08:09:20,634 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-10-13 08:09:20,634 INFO L388 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 3 case distinctions, treesize of input 42 treesize of output 53 [2021-10-13 08:09:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:20,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:23,076 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:09:23,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516573961] [2021-10-13 08:09:23,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516573961] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:09:23,076 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:09:23,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-10-13 08:09:23,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788599708] [2021-10-13 08:09:23,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 08:09:23,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:09:23,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 08:09:23,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2021-10-13 08:09:23,078 INFO L87 Difference]: Start difference. First operand 167 states and 199 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:23,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:09:23,878 INFO L93 Difference]: Finished difference Result 187 states and 212 transitions. [2021-10-13 08:09:23,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:09:23,879 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 08:09:23,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:09:23,881 INFO L225 Difference]: With dead ends: 187 [2021-10-13 08:09:23,881 INFO L226 Difference]: Without dead ends: 187 [2021-10-13 08:09:23,881 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2259.6ms TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2021-10-13 08:09:23,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-10-13 08:09:23,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 154. [2021-10-13 08:09:23,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.6126126126126126) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2021-10-13 08:09:23,887 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 11 [2021-10-13 08:09:23,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:09:23,887 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2021-10-13 08:09:23,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2021-10-13 08:09:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 08:09:23,888 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:23,889 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:09:23,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:24,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:09:24,090 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:09:24,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:24,091 INFO L82 PathProgramCache]: Analyzing trace with hash 171979407, now seen corresponding path program 1 times [2021-10-13 08:09:24,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:24,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875459566] [2021-10-13 08:09:24,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:24,091 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:24,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:24,096 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:24,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 08:09:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:24,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 08:09:24,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:24,280 INFO L388 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 [2021-10-13 08:09:24,292 INFO L388 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 [2021-10-13 08:09:24,386 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-13 08:09:24,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 33 [2021-10-13 08:09:24,411 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-10-13 08:09:24,412 INFO L388 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 30 treesize of output 30 [2021-10-13 08:09:24,620 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-10-13 08:09:24,620 INFO L388 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 3 case distinctions, treesize of input 21 treesize of output 34 [2021-10-13 08:09:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:25,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:27,756 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:09:27,756 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875459566] [2021-10-13 08:09:27,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875459566] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:09:27,757 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:09:27,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-13 08:09:27,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959681160] [2021-10-13 08:09:27,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 08:09:27,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:09:27,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 08:09:27,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=37, Unknown=1, NotChecked=0, Total=56 [2021-10-13 08:09:27,759 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:09:36,131 INFO L93 Difference]: Finished difference Result 361 states and 396 transitions. [2021-10-13 08:09:36,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-13 08:09:36,134 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 08:09:36,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:09:36,141 INFO L225 Difference]: With dead ends: 361 [2021-10-13 08:09:36,141 INFO L226 Difference]: Without dead ends: 361 [2021-10-13 08:09:36,141 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 7415.6ms TimeCoverageRelationStatistics Valid=69, Invalid=140, Unknown=1, NotChecked=0, Total=210 [2021-10-13 08:09:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2021-10-13 08:09:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 121. [2021-10-13 08:09:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.528735632183908) internal successors, (133), 120 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 133 transitions. [2021-10-13 08:09:36,160 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 133 transitions. Word has length 11 [2021-10-13 08:09:36,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:09:36,161 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 133 transitions. [2021-10-13 08:09:36,161 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:09:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 133 transitions. [2021-10-13 08:09:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 08:09:36,162 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:09:36,162 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:09:36,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-10-13 08:09:36,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:09:36,376 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:09:36,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:09:36,377 INFO L82 PathProgramCache]: Analyzing trace with hash 719743272, now seen corresponding path program 1 times [2021-10-13 08:09:36,377 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:09:36,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816505354] [2021-10-13 08:09:36,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:09:36,378 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:09:36,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:09:36,382 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:09:36,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 08:09:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:09:36,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 08:09:36,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:09:36,638 INFO L388 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 [2021-10-13 08:09:36,679 INFO L388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 08:09:36,697 INFO L388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-13 08:09:36,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:09:36,772 INFO L388 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 21 treesize of output 20 [2021-10-13 08:09:36,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:09:36,794 INFO L388 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 21 treesize of output 20 [2021-10-13 08:09:36,941 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:09:36,942 INFO L388 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 22 treesize of output 29 [2021-10-13 08:09:37,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:09:37,144 INFO L388 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 28 treesize of output 30 [2021-10-13 08:09:37,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:09:37,205 INFO L388 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 28 treesize of output 30 [2021-10-13 08:09:37,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:09:37,489 INFO L354 Elim1Store]: treesize reduction 108, result has 18.2 percent of original size [2021-10-13 08:09:37,489 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 91 [2021-10-13 08:09:37,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 08:09:37,576 INFO L354 Elim1Store]: treesize reduction 108, result has 18.2 percent of original size [2021-10-13 08:09:37,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 82 treesize of output 87 [2021-10-13 08:09:38,106 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-10-13 08:09:38,106 INFO L388 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 70 treesize of output 72 [2021-10-13 08:09:38,579 INFO L354 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2021-10-13 08:09:38,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 103 treesize of output 100 [2021-10-13 08:09:38,720 INFO L354 Elim1Store]: treesize reduction 180, result has 14.7 percent of original size [2021-10-13 08:09:38,720 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 85 [2021-10-13 08:09:38,949 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-10-13 08:09:38,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 57 [2021-10-13 08:09:38,967 INFO L354 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2021-10-13 08:09:38,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 23 [2021-10-13 08:09:39,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:09:39,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:09:39,257 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:09:39,259 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-10-13 08:09:39,264 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:09:39,265 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-10-13 08:09:41,283 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2)) c_ULTIMATE.start_append_~head.base) c_ULTIMATE.start_append_~head.offset) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_append_~node~0.base) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1)) c_ULTIMATE.start_append_~head.base) c_ULTIMATE.start_append_~head.offset) (_ bv0 32)))) is different from false [2021-10-13 08:09:49,613 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_47 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_47) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_47) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_47))))))) is different from false [2021-10-13 08:09:51,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_47 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_47))))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32)) (ULTIMATE.start_main_~list2~0.offset (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) ULTIMATE.start_main_~list2~0.offset (_ bv0 32)) (bvadd (_ bv4 32) ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_47) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (ULTIMATE.start_main_~list2~0.offset (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) ULTIMATE.start_main_~list2~0.offset (_ bv0 32)) (bvadd (_ bv4 32) ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_47) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))))) is different from false [2021-10-13 08:10:05,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:10:05,450 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:10:05,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816505354] [2021-10-13 08:10:05,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816505354] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:10:05,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:10:05,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 20 [2021-10-13 08:10:05,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291519616] [2021-10-13 08:10:05,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-10-13 08:10:05,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:10:05,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-10-13 08:10:05,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=195, Unknown=11, NotChecked=96, Total=380 [2021-10-13 08:10:05,453 INFO L87 Difference]: Start difference. First operand 121 states and 133 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:10:12,060 WARN L207 SmtUtils]: Spent 6.15 s on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2021-10-13 08:10:16,144 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (.cse1 (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base)) (.cse5 (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base))) (and (exists ((v_arrayElimCell_13 (_ BitVec 1))) (let ((.cse0 (bvneg v_arrayElimCell_13))) (and (= (_ bv0 1) (bvadd (bvneg .cse0) (_ bv1 1))) (= (_ bv0 1) (bvadd .cse0 (select |c_#valid| c_ULTIMATE.start_main_~list~0.base)))))) (= c_ULTIMATE.start_main_~list~0.offset (_ bv0 32)) (= (select .cse1 .cse2) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~list2~0.base))) (_ bv1 1))) (forall ((v_ULTIMATE.start_append_~node~0.base_47 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse3 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse3 v_ULTIMATE.start_append_~node~0.base_47) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_2))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse4 v_ULTIMATE.start_append_~node~0.base_47 (store (select .cse4 v_ULTIMATE.start_append_~node~0.base_47) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_1))) c_ULTIMATE.start_main_~list~0.base) c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_47))))))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (= (_ bv0 32) (select .cse5 .cse2)) (= (select .cse1 c_ULTIMATE.start_main_~list~0.offset) (_ bv0 32)) (= (_ bv0 32) (select .cse5 c_ULTIMATE.start_main_~list~0.offset)) (not (= c_ULTIMATE.start_main_~list2~0.base c_ULTIMATE.start_main_~list~0.base)))) is different from false [2021-10-13 08:10:39,852 WARN L207 SmtUtils]: Spent 23.64 s on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2021-10-13 08:10:52,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:10:52,385 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2021-10-13 08:10:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-13 08:10:52,393 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 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 [2021-10-13 08:10:52,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:10:52,394 INFO L225 Difference]: With dead ends: 165 [2021-10-13 08:10:52,394 INFO L226 Difference]: Without dead ends: 165 [2021-10-13 08:10:52,395 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 58289.1ms TimeCoverageRelationStatistics Valid=136, Invalid=374, Unknown=12, NotChecked=180, Total=702 [2021-10-13 08:10:52,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-10-13 08:10:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 126. [2021-10-13 08:10:52,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 92 states have (on average 1.5) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:10:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2021-10-13 08:10:52,400 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 20 [2021-10-13 08:10:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:10:52,400 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2021-10-13 08:10:52,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:10:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2021-10-13 08:10:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 08:10:52,403 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:10:52,403 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:10:52,421 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 08:10:52,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:10:52,617 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:10:52,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:10:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1685508437, now seen corresponding path program 1 times [2021-10-13 08:10:52,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:10:52,618 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196851686] [2021-10-13 08:10:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:10:52,618 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:10:52,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:10:52,619 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:10:52,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-13 08:10:52,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:10:52,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2021-10-13 08:10:52,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:10:52,873 INFO L388 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 [2021-10-13 08:10:52,906 INFO L388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-13 08:10:52,919 INFO L388 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-10-13 08:10:53,041 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:10:53,041 INFO L388 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 23 treesize of output 30 [2021-10-13 08:10:53,167 INFO L388 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 21 treesize of output 20 [2021-10-13 08:10:53,212 INFO L388 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 21 treesize of output 20 [2021-10-13 08:10:53,415 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-10-13 08:10:53,415 INFO L388 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 74 [2021-10-13 08:10:53,482 INFO L354 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2021-10-13 08:10:53,483 INFO L388 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 70 [2021-10-13 08:10:53,878 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-10-13 08:10:53,879 INFO L388 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 70 treesize of output 72 [2021-10-13 08:10:54,240 INFO L354 Elim1Store]: treesize reduction 136, result has 16.0 percent of original size [2021-10-13 08:10:54,240 INFO L388 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 93 treesize of output 87 [2021-10-13 08:10:54,340 INFO L354 Elim1Store]: treesize reduction 136, result has 16.0 percent of original size [2021-10-13 08:10:54,340 INFO L388 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 78 treesize of output 72 [2021-10-13 08:10:54,872 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-10-13 08:10:54,873 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 51 [2021-10-13 08:10:54,888 INFO L354 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2021-10-13 08:10:54,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 20 [2021-10-13 08:10:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:10:55,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:10:55,216 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:10:55,217 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-10-13 08:10:55,220 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:10:55,222 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-10-13 08:11:08,586 WARN L207 SmtUtils]: Spent 5.91 s on a formula simplification that was a NOOP. DAG size: 26 [2021-10-13 08:11:10,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_48 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_48 (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4)) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_48 (store (select |c_#memory_$Pointer$.offset| v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3)) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_48)))))))) is different from false [2021-10-13 08:11:12,845 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_48 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_48)))))))) is different from false [2021-10-13 08:11:15,000 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_48 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_48)))))) (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (ULTIMATE.start_main_~list2~0.offset (_ BitVec 32))) (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) ULTIMATE.start_main_~list2~0.offset (_ bv0 32)) (bvadd (_ bv4 32) ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (ULTIMATE.start_main_~list2~0.offset (_ BitVec 32))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) ULTIMATE.start_main_~list2~0.offset (_ bv0 32)) (bvadd (_ bv4 32) ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse1 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse1 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))))) is different from false [2021-10-13 08:11:19,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:11:19,673 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:11:19,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196851686] [2021-10-13 08:11:19,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196851686] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:11:19,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:11:19,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 18 [2021-10-13 08:11:19,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799355392] [2021-10-13 08:11:19,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-10-13 08:11:19,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:11:19,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-10-13 08:11:19,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=158, Unknown=8, NotChecked=84, Total=306 [2021-10-13 08:11:19,676 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:28,024 WARN L207 SmtUtils]: Spent 6.08 s on a formula simplification. DAG size of input: 72 DAG size of output: 35 [2021-10-13 08:11:32,089 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))) (and (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list~0.base) .cse0) (_ bv0 32)) (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| c_ULTIMATE.start_main_~list2~0.base))) (_ bv1 1))) (= (select (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (exists ((v_arrayElimCell_44 (_ BitVec 1))) (let ((.cse1 (bvneg v_arrayElimCell_44))) (and (= (_ bv0 1) (bvadd (bvneg .cse1) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |c_#valid| c_ULTIMATE.start_main_~list~0.base) .cse1))))) (= (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list~0.base) .cse0)) (forall ((v_ULTIMATE.start_append_~node~0.base_48 (_ BitVec 32))) (or (and (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.offset| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse2 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse2 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_3))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32))) (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_main_~list2~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list2~0.offset) (_ bv0 32))))) (store .cse3 v_ULTIMATE.start_append_~node~0.base_48 (store (select .cse3 v_ULTIMATE.start_append_~node~0.base_48) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_4))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_48)))))))) (not (= c_ULTIMATE.start_main_~list2~0.base c_ULTIMATE.start_main_~list~0.base)))) is different from false [2021-10-13 08:11:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:11:46,063 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2021-10-13 08:11:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-13 08:11:46,064 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 08:11:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:11:46,065 INFO L225 Difference]: With dead ends: 164 [2021-10-13 08:11:46,065 INFO L226 Difference]: Without dead ends: 164 [2021-10-13 08:11:46,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 45017.6ms TimeCoverageRelationStatistics Valid=116, Invalid=311, Unknown=9, NotChecked=164, Total=600 [2021-10-13 08:11:46,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-10-13 08:11:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 129. [2021-10-13 08:11:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2021-10-13 08:11:46,071 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 22 [2021-10-13 08:11:46,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:11:46,071 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2021-10-13 08:11:46,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 18 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:46,072 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2021-10-13 08:11:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 08:11:46,072 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:11:46,073 INFO L512 BasicCegarLoop]: 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] [2021-10-13 08:11:46,089 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-13 08:11:46,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:11:46,273 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:11:46,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:11:46,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1028150688, now seen corresponding path program 1 times [2021-10-13 08:11:46,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:11:46,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259002829] [2021-10-13 08:11:46,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:11:46,275 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:11:46,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:11:46,276 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:11:46,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-10-13 08:11:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:11:46,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2021-10-13 08:11:46,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:11:46,556 INFO L388 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 [2021-10-13 08:11:46,630 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:11:46,631 INFO L388 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 22 treesize of output 29 [2021-10-13 08:11:47,411 INFO L354 Elim1Store]: treesize reduction 30, result has 36.2 percent of original size [2021-10-13 08:11:47,411 INFO L388 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 3 case distinctions, treesize of input 39 treesize of output 50 [2021-10-13 08:11:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:11:47,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:11:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:11:49,785 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:11:49,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259002829] [2021-10-13 08:11:49,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259002829] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:11:49,785 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:11:49,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-10-13 08:11:49,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440617817] [2021-10-13 08:11:49,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 08:11:49,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:11:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 08:11:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=26, Unknown=1, NotChecked=0, Total=42 [2021-10-13 08:11:49,787 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:11:50,696 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2021-10-13 08:11:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 08:11:50,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 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 [2021-10-13 08:11:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:11:50,699 INFO L225 Difference]: With dead ends: 173 [2021-10-13 08:11:50,699 INFO L226 Difference]: Without dead ends: 173 [2021-10-13 08:11:50,699 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 14 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2503.0ms TimeCoverageRelationStatistics Valid=22, Invalid=33, Unknown=1, NotChecked=0, Total=56 [2021-10-13 08:11:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2021-10-13 08:11:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 128. [2021-10-13 08:11:50,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 127 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) [2021-10-13 08:11:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2021-10-13 08:11:50,705 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 25 [2021-10-13 08:11:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:11:50,705 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2021-10-13 08:11:50,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2021-10-13 08:11:50,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-13 08:11:50,707 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:11:50,707 INFO L512 BasicCegarLoop]: 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] [2021-10-13 08:11:50,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-10-13 08:11:50,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:11:50,928 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:11:50,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:11:50,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1028150687, now seen corresponding path program 1 times [2021-10-13 08:11:50,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:11:50,930 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696672954] [2021-10-13 08:11:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:11:50,930 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:11:50,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:11:50,931 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:11:50,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-10-13 08:11:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:11:51,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2021-10-13 08:11:51,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:11:51,368 INFO L388 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 [2021-10-13 08:11:51,378 INFO L388 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 [2021-10-13 08:11:51,519 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-10-13 08:11:51,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 29 [2021-10-13 08:11:51,528 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-10-13 08:11:51,528 INFO L388 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 26 treesize of output 22 [2021-10-13 08:11:51,974 INFO L354 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2021-10-13 08:11:51,975 INFO L388 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 3 case distinctions, treesize of input 17 treesize of output 30 [2021-10-13 08:11:52,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:11:52,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:11:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:11:55,053 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:11:55,054 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696672954] [2021-10-13 08:11:55,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696672954] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:11:55,054 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:11:55,054 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2021-10-13 08:11:55,054 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723955223] [2021-10-13 08:11:55,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 08:11:55,055 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:11:55,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 08:11:55,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=36, Unknown=1, NotChecked=0, Total=56 [2021-10-13 08:11:55,056 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:11:56,737 INFO L93 Difference]: Finished difference Result 220 states and 233 transitions. [2021-10-13 08:11:56,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 08:11:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 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 [2021-10-13 08:11:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:11:56,739 INFO L225 Difference]: With dead ends: 220 [2021-10-13 08:11:56,740 INFO L226 Difference]: Without dead ends: 220 [2021-10-13 08:11:56,740 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 2764.0ms TimeCoverageRelationStatistics Valid=60, Invalid=95, Unknown=1, NotChecked=0, Total=156 [2021-10-13 08:11:56,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2021-10-13 08:11:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 120. [2021-10-13 08:11:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 95 states have (on average 1.368421052631579) internal successors, (130), 119 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2021-10-13 08:11:56,745 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 25 [2021-10-13 08:11:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:11:56,746 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2021-10-13 08:11:56,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2021-10-13 08:11:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 08:11:56,748 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:11:56,748 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 08:11:56,773 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-10-13 08:11:56,960 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:11:56,961 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:11:56,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:11:56,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1807900189, now seen corresponding path program 1 times [2021-10-13 08:11:56,962 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:11:56,962 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150487311] [2021-10-13 08:11:56,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:11:56,962 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:11:56,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:11:56,963 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:11:56,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-13 08:11:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:11:57,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 08:11:57,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:11:57,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:11:57,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:11:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:11:57,371 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:11:57,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150487311] [2021-10-13 08:11:57,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150487311] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 08:11:57,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:11:57,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 08:11:57,371 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268930791] [2021-10-13 08:11:57,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 08:11:57,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 08:11:57,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 08:11:57,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:11:57,373 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 08:11:57,423 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2021-10-13 08:11:57,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 08:11:57,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-10-13 08:11:57,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 08:11:57,425 INFO L225 Difference]: With dead ends: 152 [2021-10-13 08:11:57,425 INFO L226 Difference]: Without dead ends: 152 [2021-10-13 08:11:57,425 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 08:11:57,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-10-13 08:11:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 145. [2021-10-13 08:11:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 120 states have (on average 1.35) internal successors, (162), 144 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 162 transitions. [2021-10-13 08:11:57,430 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 162 transitions. Word has length 26 [2021-10-13 08:11:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 08:11:57,431 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 162 transitions. [2021-10-13 08:11:57,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 08:11:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2021-10-13 08:11:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 08:11:57,433 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 08:11:57,433 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-10-13 08:11:57,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-10-13 08:11:57,657 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 08:11:57,657 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 81 more)] === [2021-10-13 08:11:57,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 08:11:57,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1778627636, now seen corresponding path program 1 times [2021-10-13 08:11:57,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 08:11:57,659 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099331195] [2021-10-13 08:11:57,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:11:57,659 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 08:11:57,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 08:11:57,660 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 08:11:57,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-13 08:11:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:11:58,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-13 08:11:58,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:11:58,160 INFO L388 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 [2021-10-13 08:11:58,204 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-10-13 08:11:58,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2021-10-13 08:11:58,304 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:11:58,305 INFO L388 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 22 treesize of output 29 [2021-10-13 08:11:58,705 INFO L388 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 13 treesize of output 9 [2021-10-13 08:11:58,807 INFO L388 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 23 treesize of output 22 [2021-10-13 08:11:59,003 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 08:11:59,004 INFO L388 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 65 treesize of output 46 [2021-10-13 08:11:59,298 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 08:11:59,298 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 76 [2021-10-13 08:11:59,641 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:11:59,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 88 treesize of output 61 [2021-10-13 08:12:00,434 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:12:00,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 70 [2021-10-13 08:12:00,844 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 08:12:00,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 81 [2021-10-13 08:12:01,158 INFO L354 Elim1Store]: treesize reduction 92, result has 1.1 percent of original size [2021-10-13 08:12:01,159 INFO L388 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 125 treesize of output 74 [2021-10-13 08:12:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:12:01,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:12:05,863 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:12:05,863 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 08:12:18,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_55 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_55 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_55 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_55) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_55)))))) is different from false [2021-10-13 08:12:20,393 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_55 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_47 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_55 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd c_ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_55 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_55) v_ULTIMATE.start_append_~node~0.offset_47 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_55)))))) is different from false [2021-10-13 08:12:22,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_55 (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_47 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_55 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) (_ bv0 32)) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_55 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_55) v_ULTIMATE.start_append_~node~0.offset_47 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_47 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset)))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_55)))))) is different from false [2021-10-13 08:12:22,498 INFO L388 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 80045 treesize of output 79853 [2021-10-13 08:12:22,929 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 08:12:22,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099331195] [2021-10-13 08:12:22,930 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 08:12:22,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1773740934] [2021-10-13 08:12:22,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:12:22,931 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 08:12:22,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 08:12:22,937 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 08:12:22,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-10-13 08:12:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:12:23,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 28 conjunts are in the unsatisfiable core [2021-10-13 08:12:23,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:12:23,695 INFO L388 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 [2021-10-13 08:12:23,832 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:12:23,833 INFO L388 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 22 treesize of output 29 [2021-10-13 08:12:24,194 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-10-13 08:12:24,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 case distinctions, treesize of input 47 treesize of output 64 [2021-10-13 08:12:25,701 INFO L388 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 13 treesize of output 9 [2021-10-13 08:12:26,027 INFO L388 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 23 treesize of output 22 [2021-10-13 08:12:26,383 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 08:12:26,383 INFO L388 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 95 treesize of output 70 [2021-10-13 08:12:26,942 INFO L354 Elim1Store]: treesize reduction 85, result has 36.6 percent of original size [2021-10-13 08:12:26,943 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 70 treesize of output 103 [2021-10-13 08:12:27,525 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:12:27,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 101 [2021-10-13 08:12:28,883 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:12:28,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 134 treesize of output 112 [2021-10-13 08:12:29,511 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 08:12:29,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 117 [2021-10-13 08:12:30,150 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-13 08:12:30,150 INFO L388 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 105 [2021-10-13 08:12:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:12:30,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:12:30,854 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:12:30,858 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 08:12:38,332 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_append_~node~0.base_56 (_ BitVec 32)) (ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_56 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_56 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_56) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_56))))))) is different from false [2021-10-13 08:12:44,935 INFO L388 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 160110 treesize of output 159726 [2021-10-13 08:12:45,457 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 08:12:45,458 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454141513] [2021-10-13 08:12:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 08:12:45,458 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:12:45,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 08:12:45,464 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 08:12:45,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-10-13 08:12:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 08:12:45,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2021-10-13 08:12:45,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 08:12:46,079 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-10-13 08:12:46,080 INFO L388 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 24 treesize of output 31 [2021-10-13 08:12:46,333 INFO L354 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2021-10-13 08:12:46,333 INFO L388 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 37 treesize of output 39 [2021-10-13 08:12:47,160 INFO L388 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 13 treesize of output 9 [2021-10-13 08:12:47,336 INFO L388 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 23 treesize of output 22 [2021-10-13 08:12:47,573 INFO L354 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2021-10-13 08:12:47,573 INFO L388 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 64 treesize of output 45 [2021-10-13 08:12:47,947 INFO L354 Elim1Store]: treesize reduction 48, result has 43.5 percent of original size [2021-10-13 08:12:47,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 63 [2021-10-13 08:12:48,438 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:12:48,438 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 97 treesize of output 70 [2021-10-13 08:12:49,155 INFO L354 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2021-10-13 08:12:49,155 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 95 treesize of output 79 [2021-10-13 08:12:49,584 INFO L354 Elim1Store]: treesize reduction 146, result has 16.1 percent of original size [2021-10-13 08:12:49,584 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 86 [2021-10-13 08:12:49,949 INFO L354 Elim1Store]: treesize reduction 86, result has 1.1 percent of original size [2021-10-13 08:12:49,950 INFO L388 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 72 [2021-10-13 08:12:50,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 08:12:50,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 08:12:50,291 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 08:12:50,292 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-10-13 08:12:59,014 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_57 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_57))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_57 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_57 (store (store (store (select |c_#memory_$Pointer$.base| v_ULTIMATE.start_append_~node~0.base_57) ULTIMATE.start_append_~node~0.offset v_DerPreprocessor_5) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))) is different from false [2021-10-13 08:13:01,108 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_57 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_57 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_57))))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_57 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd c_ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_57 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_57) v_ULTIMATE.start_append_~node~0.offset_57 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))))))) is different from false [2021-10-13 08:13:03,177 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_append_~node~0.offset (_ BitVec 32)) (v_DerPreprocessor_5 (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.offset_57 (_ BitVec 32)) (|ULTIMATE.start_append_#t~mem9.base| (_ BitVec 32)) (v_ULTIMATE.start_append_~node~0.base_57 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_ULTIMATE.start_append_~node~0.base_57))))) (= (_ bv0 1) (bvadd (bvneg (bvneg (select (store |c_#valid| v_ULTIMATE.start_append_~node~0.base_57 (_ bv1 1)) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base (store (store (select |c_#memory_$Pointer$.base| c_ULTIMATE.start_append_~node~0.base) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv1 32)) (_ bv0 32)) (bvadd ULTIMATE.start_append_~node~0.offset (_ bv5 32)) (_ bv0 32))))) (store .cse0 v_ULTIMATE.start_append_~node~0.base_57 (store (store (store (select .cse0 v_ULTIMATE.start_append_~node~0.base_57) v_ULTIMATE.start_append_~node~0.offset_57 v_DerPreprocessor_5) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv1 32)) |ULTIMATE.start_append_#t~mem9.base|) (bvadd v_ULTIMATE.start_append_~node~0.offset_57 (_ bv5 32)) (_ bv0 32)))) c_ULTIMATE.start_main_~list~0.base) (bvadd (_ bv4 32) c_ULTIMATE.start_main_~list~0.offset))))) (_ bv1 1))))) is different from false [2021-10-13 08:13:03,217 INFO L388 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 2496494 treesize of output 2490350 [2021-10-13 08:13:10,394 WARN L207 SmtUtils]: Spent 7.18 s on a formula simplification that was a NOOP. DAG size: 1086 [2021-10-13 08:13:10,425 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-10-13 08:13:10,425 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-10-13 08:13:10,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-10-13 08:13:10,426 ERROR L172 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2021-10-13 08:13:10,426 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-10-13 08:13:10,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-13 08:13:10,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 08:13:10,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 08:13:10,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 08:13:10,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 08:13:10,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 08:13:10,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 08:13:10,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 08:13:10,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 08:13:10,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 08:13:10,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 08:13:10,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-13 08:13:10,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-13 08:13:10,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 08:13:10,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 08:13:10,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-13 08:13:10,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-13 08:13:10,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-13 08:13:10,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-13 08:13:10,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-13 08:13:10,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-13 08:13:10,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-13 08:13:10,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-13 08:13:10,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-13 08:13:10,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-13 08:13:10,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-13 08:13:10,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-13 08:13:10,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-13 08:13:10,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-13 08:13:10,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-13 08:13:10,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-13 08:13:10,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-13 08:13:10,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-13 08:13:10,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-13 08:13:10,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-13 08:13:10,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-13 08:13:10,442 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-13 08:13:10,442 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-13 08:13:10,442 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-13 08:13:10,442 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-13 08:13:10,442 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-13 08:13:10,443 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-13 08:13:10,443 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-13 08:13:10,443 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-13 08:13:10,443 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-13 08:13:10,443 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-13 08:13:10,443 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-13 08:13:10,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-13 08:13:10,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-13 08:13:10,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-13 08:13:10,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-13 08:13:10,444 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-13 08:13:10,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-13 08:13:10,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-13 08:13:10,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-13 08:13:10,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-13 08:13:10,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-13 08:13:10,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-13 08:13:10,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-13 08:13:10,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-13 08:13:10,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-13 08:13:10,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-13 08:13:10,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-13 08:13:10,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-13 08:13:10,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-13 08:13:10,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-13 08:13:10,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-13 08:13:10,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-13 08:13:10,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-13 08:13:10,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-13 08:13:10,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-13 08:13:10,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-13 08:13:10,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 08:13:10,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 08:13:10,471 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-13 08:13:10,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2021-10-13 08:13:10,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-10-13 08:13:11,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 08:13:11,062 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 08:13:11,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:13:11 BoogieIcfgContainer [2021-10-13 08:13:11,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 08:13:11,077 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 08:13:11,077 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 08:13:11,077 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 08:13:11,078 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:09:13" (3/4) ... [2021-10-13 08:13:11,081 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-13 08:13:11,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 08:13:11,082 INFO L168 Benchmark]: Toolchain (without parser) took 239780.66 ms. Allocated memory was 60.8 MB in the beginning and 318.8 MB in the end (delta: 257.9 MB). Free memory was 38.3 MB in the beginning and 221.7 MB in the end (delta: -183.5 MB). Peak memory consumption was 72.7 MB. Max. memory is 16.1 GB. [2021-10-13 08:13:11,083 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 60.8 MB. Free memory is still 41.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:13:11,083 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.24 ms. Allocated memory was 60.8 MB in the beginning and 83.9 MB in the end (delta: 23.1 MB). Free memory was 38.0 MB in the beginning and 61.3 MB in the end (delta: -23.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 08:13:11,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.84 ms. Allocated memory is still 83.9 MB. Free memory was 61.3 MB in the beginning and 58.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 08:13:11,084 INFO L168 Benchmark]: Boogie Preprocessor took 92.15 ms. Allocated memory is still 83.9 MB. Free memory was 58.7 MB in the beginning and 56.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 08:13:11,084 INFO L168 Benchmark]: RCFGBuilder took 1322.74 ms. Allocated memory is still 83.9 MB. Free memory was 56.6 MB in the beginning and 50.2 MB in the end (delta: 6.4 MB). Peak memory consumption was 16.9 MB. Max. memory is 16.1 GB. [2021-10-13 08:13:11,085 INFO L168 Benchmark]: TraceAbstraction took 237687.81 ms. Allocated memory was 83.9 MB in the beginning and 318.8 MB in the end (delta: 234.9 MB). Free memory was 49.5 MB in the beginning and 221.7 MB in the end (delta: -172.3 MB). Peak memory consumption was 188.2 MB. Max. memory is 16.1 GB. [2021-10-13 08:13:11,085 INFO L168 Benchmark]: Witness Printer took 4.75 ms. Allocated memory is still 318.8 MB. Free memory is still 221.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 08:13:11,087 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.26 ms. Allocated memory is still 60.8 MB. Free memory is still 41.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 562.24 ms. Allocated memory was 60.8 MB in the beginning and 83.9 MB in the end (delta: 23.1 MB). Free memory was 38.0 MB in the beginning and 61.3 MB in the end (delta: -23.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 101.84 ms. Allocated memory is still 83.9 MB. Free memory was 61.3 MB in the beginning and 58.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 92.15 ms. Allocated memory is still 83.9 MB. Free memory was 58.7 MB in the beginning and 56.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1322.74 ms. Allocated memory is still 83.9 MB. Free memory was 56.6 MB in the beginning and 50.2 MB in the end (delta: 6.4 MB). Peak memory consumption was 16.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 237687.81 ms. Allocated memory was 83.9 MB in the beginning and 318.8 MB in the end (delta: 234.9 MB). Free memory was 49.5 MB in the beginning and 221.7 MB in the end (delta: -172.3 MB). Peak memory consumption was 188.2 MB. Max. memory is 16.1 GB. * Witness Printer took 4.75 ms. Allocated memory is still 318.8 MB. Free memory is still 221.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L566] struct list_t *list = malloc(sizeof *list); [L567] list->first = ((void *)0) [L568] list->last = ((void *)0) [L569] struct list_t *list2 = malloc(sizeof *list2); [L570] list2->first = ((void *)0) [L571] list2->last = ((void *)0) [L572] char userInput; [L574] char userInput = __VERIFIER_nondet_char(); [L551] struct node_t *node = malloc(sizeof *node); [L552] node->data = input [L553] EXPR head->first [L553] head->first == ((void *)0) && head->last == ((void *)0) [L553] EXPR head->last [L553] head->first == ((void *)0) && head->last == ((void *)0) [L553] COND TRUE head->first == ((void *)0) && head->last == ((void *)0) [L554] head->first = node [L555] head->last= node [L556] node->prev = ((void *)0) [L557] node->next = ((void *)0) [L576] COND TRUE __VERIFIER_nondet_int() [L574] char userInput = __VERIFIER_nondet_char(); [L551] struct node_t *node = malloc(sizeof *node); [L552] node->data = input [L553] EXPR head->first [L553] head->first == ((void *)0) && head->last == ((void *)0) [L553] COND FALSE !(head->first == ((void *)0) && head->last == ((void *)0)) [L560] EXPR head->last [L560] node->prev = head->last [L561] node->next = ((void *)0) [L562] EXPR head->last [L562] head->last->next = node - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 567]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 568]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 570]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 571]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 553]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 560]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 563]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 587]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 590]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 590]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 591]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 593]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 594]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 167 locations, 85 error locations. Started 1 CEGAR loops. OverallTime: 237611.8ms, OverallIterations: 14, TraceHistogramMax: 2, EmptinessCheckTime: 23.9ms, AutomataDifference: 89140.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 21.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1086 SDtfs, 3332 SDslu, 1793 SDs, 0 SdLazy, 2290 SolverSat, 200 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 27514.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 248 SyntacticMatches, 17 SemanticMatches, 95 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 118380.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=3, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 141.0ms AutomataMinimizationTime, 13 MinimizatonAttempts, 704 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 184.0ms SsaConstructionTime, 861.2ms SatisfiabilityAnalysisTime, 69766.9ms InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 330 ConstructedInterpolants, 107 QuantifiedInterpolants, 5081 SizeOfPredicates, 66 NumberOfNonLiveVariables, 1130 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-10-13 08:13:11,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f215461-423f-49fe-bba9-d2372a1eda55/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...