./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label21.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcd01e7110ca6d1a1590515ee01ced3e05a5bcbb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label21.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fcd01e7110ca6d1a1590515ee01ced3e05a5bcbb .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 19:26:10,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:26:10,428 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:26:10,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:26:10,463 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:26:10,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:26:10,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:26:10,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:26:10,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:26:10,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:26:10,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:26:10,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:26:10,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:26:10,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:26:10,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:26:10,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:26:10,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:26:10,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:26:10,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:26:10,495 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:26:10,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:26:10,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:26:10,499 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:26:10,500 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:26:10,502 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:26:10,503 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:26:10,503 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:26:10,504 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:26:10,504 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:26:10,505 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:26:10,505 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:26:10,506 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:26:10,507 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:26:10,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:26:10,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:26:10,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:26:10,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:26:10,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:26:10,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:26:10,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:26:10,510 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:26:10,511 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 19:26:10,533 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:26:10,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:26:10,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:26:10,535 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:26:10,535 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:26:10,535 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:26:10,535 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 19:26:10,535 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:26:10,535 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:26:10,536 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 19:26:10,536 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 19:26:10,536 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:26:10,536 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 19:26:10,536 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 19:26:10,536 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 19:26:10,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:26:10,537 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:26:10,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 19:26:10,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:26:10,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:26:10,538 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 19:26:10,538 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:26:10,538 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 19:26:10,539 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:26:10,539 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:26:10,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 19:26:10,539 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:26:10,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 19:26:10,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:26:10,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:26:10,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:26:10,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:26:10,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:26:10,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 19:26:10,541 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 19:26:10,541 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 19:26:10,541 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 19:26:10,541 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:26:10,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:26:10,541 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-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/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-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> fcd01e7110ca6d1a1590515ee01ced3e05a5bcbb [2020-12-09 19:26:10,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:26:10,758 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:26:10,760 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:26:10,761 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:26:10,761 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:26:10,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2020-12-09 19:26:10,804 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data/3e149448d/0b5e00f0dbdb4464943aa8640c22f06f/FLAGdad33b751 [2020-12-09 19:26:11,234 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:26:11,235 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2020-12-09 19:26:11,246 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data/3e149448d/0b5e00f0dbdb4464943aa8640c22f06f/FLAGdad33b751 [2020-12-09 19:26:11,256 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data/3e149448d/0b5e00f0dbdb4464943aa8640c22f06f [2020-12-09 19:26:11,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:26:11,259 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:26:11,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:26:11,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:26:11,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:26:11,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ab784b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11, skipping insertion in model container [2020-12-09 19:26:11,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:26:11,314 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:26:11,445 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/sv-benchmarks/c/eca-rers2012/Problem10_label21.c[3267,3280] [2020-12-09 19:26:11,573 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:26:11,581 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:26:11,599 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/sv-benchmarks/c/eca-rers2012/Problem10_label21.c[3267,3280] [2020-12-09 19:26:11,648 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:26:11,659 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:26:11,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11 WrapperNode [2020-12-09 19:26:11,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:26:11,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:26:11,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:26:11,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:26:11,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:26:11,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:26:11,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:26:11,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:26:11,741 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,745 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... [2020-12-09 19:26:11,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:26:11,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:26:11,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:26:11,804 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:26:11,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:26:11,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 19:26:11,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:26:11,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:26:11,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:26:18,398 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:26:18,399 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 19:26:18,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:26:18 BoogieIcfgContainer [2020-12-09 19:26:18,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:26:18,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:26:18,401 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:26:18,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:26:18,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:26:11" (1/3) ... [2020-12-09 19:26:18,404 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d73816a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:26:18, skipping insertion in model container [2020-12-09 19:26:18,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:26:11" (2/3) ... [2020-12-09 19:26:18,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d73816a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:26:18, skipping insertion in model container [2020-12-09 19:26:18,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:26:18" (3/3) ... [2020-12-09 19:26:18,406 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label21.c [2020-12-09 19:26:18,415 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:26:18,418 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 19:26:18,424 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 19:26:18,440 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:26:18,440 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 19:26:18,440 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:26:18,440 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:26:18,440 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:26:18,440 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:26:18,440 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:26:18,440 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:26:18,448 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2020-12-09 19:26:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-09 19:26:18,451 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:26:18,452 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-09 19:26:18,452 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:26:18,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:26:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash 857610074, now seen corresponding path program 1 times [2020-12-09 19:26:18,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:26:18,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190447500] [2020-12-09 19:26:18,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:26:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:26:18,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:26:18,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190447500] [2020-12-09 19:26:18,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:26:18,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:26:18,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38442435] [2020-12-09 19:26:18,590 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:26:18,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 19:26:18,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:26:18,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:26:18,605 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2020-12-09 19:26:18,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:26:18,667 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-12-09 19:26:18,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:26:18,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-09 19:26:18,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:26:18,676 INFO L225 Difference]: With dead ends: 23 [2020-12-09 19:26:18,677 INFO L226 Difference]: Without dead ends: 11 [2020-12-09 19:26:18,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:26:18,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-12-09 19:26:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-12-09 19:26:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-12-09 19:26:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-12-09 19:26:18,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2020-12-09 19:26:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:26:18,705 INFO L481 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-12-09 19:26:18,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:26:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-12-09 19:26:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-09 19:26:18,705 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:26:18,706 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-12-09 19:26:18,706 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 19:26:18,706 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:26:18,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:26:18,707 INFO L82 PathProgramCache]: Analyzing trace with hash -26971468, now seen corresponding path program 1 times [2020-12-09 19:26:18,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 19:26:18,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181084743] [2020-12-09 19:26:18,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 19:26:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:26:18,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:26:18,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181084743] [2020-12-09 19:26:18,959 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792365574] [2020-12-09 19:26:18,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:26:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:26:19,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 19:26:19,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:26:19,270 WARN L197 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 1003 DAG size of output: 128 [2020-12-09 19:26:19,323 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 3, 2, 3, 2, 3, 2, 3, 2, 3, 1] term [2020-12-09 19:26:19,323 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 19:26:19,327 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 19:26:19,329 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 19:26:19,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:26:19,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:26:19,696 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 1666 DAG size of output: 865 [2020-12-09 19:26:19,736 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,737 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,743 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,743 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,749 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,749 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,750 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,751 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,756 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,756 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,757 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,757 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,761 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,762 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,765 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,765 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,765 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,766 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,769 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,769 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,770 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,770 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,774 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,774 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,777 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,777 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,780 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,780 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,783 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,784 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,786 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,786 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,789 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,789 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,792 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,792 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,795 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,795 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,797 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,797 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,800 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,800 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,802 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,802 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,805 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,805 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,805 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,806 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,809 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,809 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,811 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 5, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,811 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,813 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,813 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,816 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,816 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,818 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,818 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,820 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,821 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,822 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,823 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,823 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:26:19,824 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,824 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,824 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,825 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,825 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,827 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,828 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,828 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 1] term [2020-12-09 19:26:19,828 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,829 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 19:26:19,829 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,831 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,831 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,832 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,832 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,833 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,834 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,835 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,835 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,836 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,837 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,838 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,838 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,839 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,839 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,840 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,840 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,841 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,841 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,842 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,843 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,843 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,843 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,845 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:26:19,845 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,846 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:26:19,846 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,846 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,846 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,847 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:26:19,847 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,848 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,848 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,849 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:26:19,850 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,850 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:26:19,850 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,851 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,851 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,852 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,852 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,853 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 3, 2, 1] term [2020-12-09 19:26:19,853 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,853 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,853 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,854 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,854 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,855 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 19:26:19,855 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,856 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,856 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,857 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,857 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,859 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,859 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,860 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,860 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,862 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,862 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,863 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:26:19,863 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,864 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,864 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,865 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,865 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,866 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,866 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,867 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,867 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,868 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:26:19,868 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,869 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:26:19,869 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,870 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,870 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,871 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,871 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,872 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 19:26:19,872 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,872 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,873 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,873 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 19:26:19,873 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,876 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,876 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,878 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,878 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,880 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,880 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,883 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 9, 7, 8, 6, 8, 6, 7, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,883 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,885 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 9, 7, 8, 6, 8, 6, 7, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,885 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,887 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 7, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,887 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,889 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,889 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,891 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,891 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,893 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,893 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,894 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,895 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,896 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,896 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,898 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,898 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,899 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,900 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,901 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,901 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,903 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,903 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,904 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,904 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,906 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,906 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,907 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,907 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,909 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,909 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,910 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,910 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,911 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,911 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,913 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 10, 6, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,913 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,914 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,914 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,915 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 7, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,915 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,916 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,916 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,917 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,917 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,919 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 9, 7, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,919 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,920 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,920 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,921 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,921 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,921 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 6, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,922 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,922 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 7, 6, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,922 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,923 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 7, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,923 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:19,924 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 8, 8, 7, 2, 1] term [2020-12-09 19:26:19,924 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:26:21,243 WARN L197 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 400 DAG size of output: 101 [2020-12-09 19:26:21,579 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 93 [2020-12-09 19:26:21,589 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 6, 4, 6, 5, 5, 5, 6, 1] term [2020-12-09 19:26:21,589 INFO L639 QuantifierPusher]: Distributing 5 disjuncts over 2 conjuncts [2020-12-09 19:26:21,971 WARN L197 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2020-12-09 19:26:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:26:21,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [764660104] [2020-12-09 19:26:21,988 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2020-12-09 19:26:21,988 INFO L166 IcfgInterpreter]: Building call graph [2020-12-09 19:26:21,991 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2020-12-09 19:26:21,995 INFO L176 IcfgInterpreter]: Starting interpretation [2020-12-09 19:26:21,995 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2020-12-09 19:26:22,096 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 22 [2020-12-09 19:26:22,305 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 22 [2020-12-09 19:26:22,853 WARN L197 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 1696 DAG size of output: 1611 [2020-12-09 19:35:23,450 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-12-09 19:35:23,452 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: variable got div captured at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.findBestReplacementSbr(DualJunctionDer.java:305) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$IDerHelper.tryToEliminateSbr(DualJunctionDer.java:319) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:190) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminateOne(DualJunctionDer.java:174) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryExhaustivelyToEliminate(DualJunctionDer.java:141) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer.tryToEliminate(DualJunctionDer.java:119) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:776) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:739) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:656) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:358) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:431) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.doit(QuantifierPusher.java:523) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:378) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.convert(QuantifierPusher.java:217) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:151) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.linearterms.QuantifierPusher.eliminate(QuantifierPusher.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elimPushPull(PartialQuantifierElimination.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:139) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) 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.DagInterpreter.interpretForSingleMarker(DagInterpreter.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarizeInternal(FixpointLoopSummarizer.java:118) at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1133) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) 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:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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) [2020-12-09 19:35:23,461 INFO L168 Benchmark]: Toolchain (without parser) took 552201.29 ms. Allocated memory was 117.4 MB in the beginning and 847.2 MB in the end (delta: 729.8 MB). Free memory was 79.3 MB in the beginning and 359.0 MB in the end (delta: -279.7 MB). Peak memory consumption was 551.0 MB. Max. memory is 16.1 GB. [2020-12-09 19:35:23,462 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 117.4 MB. Free memory is still 97.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:35:23,462 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.49 ms. Allocated memory is still 117.4 MB. Free memory was 79.1 MB in the beginning and 77.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 19:35:23,463 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.32 ms. Allocated memory is still 117.4 MB. Free memory was 77.3 MB in the beginning and 69.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:35:23,463 INFO L168 Benchmark]: Boogie Preprocessor took 70.16 ms. Allocated memory is still 117.4 MB. Free memory was 69.4 MB in the beginning and 64.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 19:35:23,464 INFO L168 Benchmark]: RCFGBuilder took 6596.53 ms. Allocated memory was 117.4 MB in the beginning and 232.8 MB in the end (delta: 115.3 MB). Free memory was 63.8 MB in the beginning and 130.1 MB in the end (delta: -66.4 MB). Peak memory consumption was 139.0 MB. Max. memory is 16.1 GB. [2020-12-09 19:35:23,465 INFO L168 Benchmark]: TraceAbstraction took 545058.08 ms. Allocated memory was 232.8 MB in the beginning and 847.2 MB in the end (delta: 614.5 MB). Free memory was 129.1 MB in the beginning and 359.0 MB in the end (delta: -230.0 MB). Peak memory consumption was 485.2 MB. Max. memory is 16.1 GB. [2020-12-09 19:35:23,467 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.15 ms. Allocated memory is still 117.4 MB. Free memory is still 97.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 399.49 ms. Allocated memory is still 117.4 MB. Free memory was 79.1 MB in the beginning and 77.3 MB in the end (delta: 1.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.32 ms. Allocated memory is still 117.4 MB. Free memory was 77.3 MB in the beginning and 69.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.16 ms. Allocated memory is still 117.4 MB. Free memory was 69.4 MB in the beginning and 64.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 6596.53 ms. Allocated memory was 117.4 MB in the beginning and 232.8 MB in the end (delta: 115.3 MB). Free memory was 63.8 MB in the beginning and 130.1 MB in the end (delta: -66.4 MB). Peak memory consumption was 139.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 545058.08 ms. Allocated memory was 232.8 MB in the beginning and 847.2 MB in the end (delta: 614.5 MB). Free memory was 129.1 MB in the beginning and 359.0 MB in the end (delta: -230.0 MB). Peak memory consumption was 485.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: variable got div captured de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: variable got div captured: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.pqe.DualJunctionDer$DerHelperMcsbr.solveForSubject(DualJunctionDer.java:426) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 19:35:25,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 19:35:25,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 19:35:25,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 19:35:25,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 19:35:25,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 19:35:25,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 19:35:25,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 19:35:25,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 19:35:25,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 19:35:25,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 19:35:25,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 19:35:25,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 19:35:25,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 19:35:25,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 19:35:25,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 19:35:25,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 19:35:25,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 19:35:25,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 19:35:25,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 19:35:25,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 19:35:25,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 19:35:25,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 19:35:25,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 19:35:25,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 19:35:25,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 19:35:25,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 19:35:25,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 19:35:25,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 19:35:25,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 19:35:25,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 19:35:25,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 19:35:25,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 19:35:25,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 19:35:25,053 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 19:35:25,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 19:35:25,054 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 19:35:25,054 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 19:35:25,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 19:35:25,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 19:35:25,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 19:35:25,056 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 19:35:25,097 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 19:35:25,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 19:35:25,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 19:35:25,098 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 19:35:25,098 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 19:35:25,098 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 19:35:25,098 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 19:35:25,099 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 19:35:25,099 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 19:35:25,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 19:35:25,100 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 19:35:25,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 19:35:25,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 19:35:25,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 19:35:25,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 19:35:25,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 19:35:25,101 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 19:35:25,101 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 19:35:25,101 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 19:35:25,101 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 19:35:25,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 19:35:25,101 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 19:35:25,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 19:35:25,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 19:35:25,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 19:35:25,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 19:35:25,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:35:25,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 19:35:25,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 19:35:25,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 19:35:25,103 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 19:35:25,103 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 19:35:25,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 19:35:25,103 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 19:35:25,103 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 19:35:25,103 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-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/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-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> fcd01e7110ca6d1a1590515ee01ced3e05a5bcbb [2020-12-09 19:35:25,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 19:35:25,352 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 19:35:25,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 19:35:25,355 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 19:35:25,355 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 19:35:25,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2020-12-09 19:35:25,396 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data/769601056/cc0cb44317614a108814de376ccc767a/FLAG3c14781b7 [2020-12-09 19:35:25,856 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 19:35:25,856 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/sv-benchmarks/c/eca-rers2012/Problem10_label21.c [2020-12-09 19:35:25,867 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data/769601056/cc0cb44317614a108814de376ccc767a/FLAG3c14781b7 [2020-12-09 19:35:25,877 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/data/769601056/cc0cb44317614a108814de376ccc767a [2020-12-09 19:35:25,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 19:35:25,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 19:35:25,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 19:35:25,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 19:35:25,883 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 19:35:25,884 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:35:25" (1/1) ... [2020-12-09 19:35:25,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39efdd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:25, skipping insertion in model container [2020-12-09 19:35:25,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:35:25" (1/1) ... [2020-12-09 19:35:25,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 19:35:25,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 19:35:26,040 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/sv-benchmarks/c/eca-rers2012/Problem10_label21.c[3267,3280] [2020-12-09 19:35:26,185 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:35:26,194 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 19:35:26,210 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/sv-benchmarks/c/eca-rers2012/Problem10_label21.c[3267,3280] [2020-12-09 19:35:26,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 19:35:26,287 INFO L208 MainTranslator]: Completed translation [2020-12-09 19:35:26,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26 WrapperNode [2020-12-09 19:35:26,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 19:35:26,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 19:35:26,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 19:35:26,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 19:35:26,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... [2020-12-09 19:35:26,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... [2020-12-09 19:35:26,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 19:35:26,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 19:35:26,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 19:35:26,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 19:35:26,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... [2020-12-09 19:35:26,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... [2020-12-09 19:35:26,361 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... [2020-12-09 19:35:26,361 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... [2020-12-09 19:35:26,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... [2020-12-09 19:35:26,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... [2020-12-09 19:35:26,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... [2020-12-09 19:35:26,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 19:35:26,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 19:35:26,404 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 19:35:26,404 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 19:35:26,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 19:35:26,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 19:35:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 19:35:26,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 19:35:26,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 19:35:28,452 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 19:35:28,452 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-09 19:35:28,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:28 BoogieIcfgContainer [2020-12-09 19:35:28,454 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 19:35:28,455 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 19:35:28,455 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 19:35:28,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 19:35:28,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:35:25" (1/3) ... [2020-12-09 19:35:28,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1b73d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:35:28, skipping insertion in model container [2020-12-09 19:35:28,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:35:26" (2/3) ... [2020-12-09 19:35:28,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f1b73d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:35:28, skipping insertion in model container [2020-12-09 19:35:28,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:28" (3/3) ... [2020-12-09 19:35:28,459 INFO L111 eAbstractionObserver]: Analyzing ICFG Problem10_label21.c [2020-12-09 19:35:28,468 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 19:35:28,471 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-09 19:35:28,478 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-09 19:35:28,495 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 19:35:28,495 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 19:35:28,495 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 19:35:28,496 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 19:35:28,496 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 19:35:28,496 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 19:35:28,496 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 19:35:28,496 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 19:35:28,508 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2020-12-09 19:35:28,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-12-09 19:35:28,512 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:35:28,512 INFO L422 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, 1] [2020-12-09 19:35:28,512 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:35:28,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:35:28,516 INFO L82 PathProgramCache]: Analyzing trace with hash -438767135, now seen corresponding path program 1 times [2020-12-09 19:35:28,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:35:28,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696985576] [2020-12-09 19:35:28,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 19:35:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:28,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:35:28,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:28,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:28,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:35:28,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696985576] [2020-12-09 19:35:28,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:35:28,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:35:28,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701871435] [2020-12-09 19:35:28,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:35:28,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:35:28,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:35:28,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:35:28,686 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 3 states. [2020-12-09 19:35:31,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:35:31,464 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2020-12-09 19:35:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:35:31,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-12-09 19:35:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:35:31,474 INFO L225 Difference]: With dead ends: 552 [2020-12-09 19:35:31,475 INFO L226 Difference]: Without dead ends: 282 [2020-12-09 19:35:31,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:35:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-12-09 19:35:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-12-09 19:35:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-12-09 19:35:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 407 transitions. [2020-12-09 19:35:31,513 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 407 transitions. Word has length 27 [2020-12-09 19:35:31,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:35:31,514 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 407 transitions. [2020-12-09 19:35:31,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:35:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 407 transitions. [2020-12-09 19:35:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-09 19:35:31,517 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:35:31,517 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:35:31,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 19:35:31,719 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:35:31,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:35:31,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1940734521, now seen corresponding path program 1 times [2020-12-09 19:35:31,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:35:31,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [393866377] [2020-12-09 19:35:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 19:35:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:31,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:35:31,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:31,871 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:31,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:35:31,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [393866377] [2020-12-09 19:35:31,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:35:31,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:35:31,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363794393] [2020-12-09 19:35:31,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:35:31,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:35:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:35:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:35:31,876 INFO L87 Difference]: Start difference. First operand 282 states and 407 transitions. Second operand 3 states. [2020-12-09 19:35:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:35:34,582 INFO L93 Difference]: Finished difference Result 840 states and 1216 transitions. [2020-12-09 19:35:34,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:35:34,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2020-12-09 19:35:34,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:35:34,586 INFO L225 Difference]: With dead ends: 840 [2020-12-09 19:35:34,586 INFO L226 Difference]: Without dead ends: 560 [2020-12-09 19:35:34,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:35:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-12-09 19:35:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2020-12-09 19:35:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2020-12-09 19:35:34,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2020-12-09 19:35:34,610 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 95 [2020-12-09 19:35:34,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:35:34,610 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2020-12-09 19:35:34,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:35:34,610 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2020-12-09 19:35:34,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2020-12-09 19:35:34,612 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:35:34,612 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:35:34,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 19:35:34,814 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:35:34,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:35:34,816 INFO L82 PathProgramCache]: Analyzing trace with hash -423472339, now seen corresponding path program 1 times [2020-12-09 19:35:34,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:35:34,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585162621] [2020-12-09 19:35:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 19:35:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:34,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:35:34,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:34,963 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:34,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:35:34,963 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585162621] [2020-12-09 19:35:34,963 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:35:34,963 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 19:35:34,964 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672760982] [2020-12-09 19:35:34,964 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:35:34,964 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:35:34,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:35:34,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:35:34,965 INFO L87 Difference]: Start difference. First operand 560 states and 735 transitions. Second operand 3 states. [2020-12-09 19:35:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:35:37,434 INFO L93 Difference]: Finished difference Result 1396 states and 1872 transitions. [2020-12-09 19:35:37,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:35:37,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2020-12-09 19:35:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:35:37,442 INFO L225 Difference]: With dead ends: 1396 [2020-12-09 19:35:37,442 INFO L226 Difference]: Without dead ends: 838 [2020-12-09 19:35:37,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:35:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-12-09 19:35:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2020-12-09 19:35:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-12-09 19:35:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1044 transitions. [2020-12-09 19:35:37,466 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1044 transitions. Word has length 104 [2020-12-09 19:35:37,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:35:37,466 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 1044 transitions. [2020-12-09 19:35:37,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:35:37,467 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1044 transitions. [2020-12-09 19:35:37,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2020-12-09 19:35:37,469 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:35:37,469 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:35:37,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 19:35:37,671 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:35:37,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:35:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash 618530375, now seen corresponding path program 1 times [2020-12-09 19:35:37,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:35:37,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933999036] [2020-12-09 19:35:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 19:35:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:37,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:35:37,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:38,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:35:38,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933999036] [2020-12-09 19:35:38,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:35:38,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:35:38,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277818040] [2020-12-09 19:35:38,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 19:35:38,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:35:38,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 19:35:38,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 19:35:38,106 INFO L87 Difference]: Start difference. First operand 838 states and 1044 transitions. Second operand 4 states. [2020-12-09 19:35:40,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:35:40,152 INFO L93 Difference]: Finished difference Result 1833 states and 2255 transitions. [2020-12-09 19:35:40,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 19:35:40,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2020-12-09 19:35:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:35:40,159 INFO L225 Difference]: With dead ends: 1833 [2020-12-09 19:35:40,159 INFO L226 Difference]: Without dead ends: 997 [2020-12-09 19:35:40,160 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 19:35:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2020-12-09 19:35:40,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 977. [2020-12-09 19:35:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2020-12-09 19:35:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1188 transitions. [2020-12-09 19:35:40,177 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1188 transitions. Word has length 140 [2020-12-09 19:35:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:35:40,177 INFO L481 AbstractCegarLoop]: Abstraction has 977 states and 1188 transitions. [2020-12-09 19:35:40,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 19:35:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1188 transitions. [2020-12-09 19:35:40,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2020-12-09 19:35:40,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:35:40,180 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:35:40,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 19:35:40,381 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:35:40,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:35:40,383 INFO L82 PathProgramCache]: Analyzing trace with hash 143101306, now seen corresponding path program 1 times [2020-12-09 19:35:40,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:35:40,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165530857] [2020-12-09 19:35:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 19:35:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:40,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 2 conjunts are in the unsatisfiable core [2020-12-09 19:35:40,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:40,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:35:40,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165530857] [2020-12-09 19:35:40,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 19:35:40,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 19:35:40,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78156661] [2020-12-09 19:35:40,625 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 19:35:40,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:35:40,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 19:35:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:35:40,626 INFO L87 Difference]: Start difference. First operand 977 states and 1188 transitions. Second operand 3 states. [2020-12-09 19:35:43,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:35:43,055 INFO L93 Difference]: Finished difference Result 2091 states and 2634 transitions. [2020-12-09 19:35:43,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 19:35:43,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2020-12-09 19:35:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:35:43,060 INFO L225 Difference]: With dead ends: 2091 [2020-12-09 19:35:43,061 INFO L226 Difference]: Without dead ends: 1255 [2020-12-09 19:35:43,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 19:35:43,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-12-09 19:35:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1116. [2020-12-09 19:35:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2020-12-09 19:35:43,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1337 transitions. [2020-12-09 19:35:43,079 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1337 transitions. Word has length 170 [2020-12-09 19:35:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:35:43,080 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1337 transitions. [2020-12-09 19:35:43,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 19:35:43,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1337 transitions. [2020-12-09 19:35:43,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-12-09 19:35:43,081 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:35:43,082 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:35:43,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 19:35:43,282 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:35:43,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:35:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash -843989594, now seen corresponding path program 1 times [2020-12-09 19:35:43,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:35:43,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305754118] [2020-12-09 19:35:43,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 19:35:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:43,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:35:43,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:43,587 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 49 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:43,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:35:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 67 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:43,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305754118] [2020-12-09 19:35:43,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [473703363] [2020-12-09 19:35:43,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:35:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:44,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:35:44,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:44,457 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 19:35:44,458 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-12-09 19:35:44,459 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 3 disjuncts [2020-12-09 19:35:44,466 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 19:35:44,471 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-12-09 19:35:44,474 INFO L639 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-12-09 19:35:44,658 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 98 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:44,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:35:44,943 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:35:44,944 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 19:35:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 104 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:45,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329855999] [2020-12-09 19:35:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:35:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:45,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:35:45,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:45,585 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:45,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 19:35:45,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2020-12-09 19:35:45,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 4, 8, 8] total 21 [2020-12-09 19:35:45,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410079881] [2020-12-09 19:35:45,589 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-09 19:35:45,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:35:45,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-09 19:35:45,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2020-12-09 19:35:45,589 INFO L87 Difference]: Start difference. First operand 1116 states and 1337 transitions. Second operand 7 states. [2020-12-09 19:35:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:35:47,690 INFO L93 Difference]: Finished difference Result 2146 states and 2583 transitions. [2020-12-09 19:35:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 19:35:47,690 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 179 [2020-12-09 19:35:47,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:35:47,694 INFO L225 Difference]: With dead ends: 2146 [2020-12-09 19:35:47,694 INFO L226 Difference]: Without dead ends: 1116 [2020-12-09 19:35:47,696 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 869 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2020-12-09 19:35:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2020-12-09 19:35:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2020-12-09 19:35:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2020-12-09 19:35:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1332 transitions. [2020-12-09 19:35:47,710 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1332 transitions. Word has length 179 [2020-12-09 19:35:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:35:47,710 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1332 transitions. [2020-12-09 19:35:47,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-09 19:35:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1332 transitions. [2020-12-09 19:35:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-12-09 19:35:47,712 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 19:35:47,712 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 19:35:48,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 mathsat -unsat_core_generation=3,8 cvc4 --incremental --print-success --lang smt [2020-12-09 19:35:48,315 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 19:35:48,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 19:35:48,317 INFO L82 PathProgramCache]: Analyzing trace with hash 205771184, now seen corresponding path program 1 times [2020-12-09 19:35:48,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 19:35:48,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861316734] [2020-12-09 19:35:48,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-09 19:35:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:48,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-09 19:35:48,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:48,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:35:49,006 WARN L197 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2020-12-09 19:35:49,169 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 29 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-09 19:35:49,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861316734] [2020-12-09 19:35:49,169 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1843198044] [2020-12-09 19:35:49,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt [2020-12-09 19:35:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:49,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:35:49,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 107 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:49,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:35:49,514 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:35:49,514 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-12-09 19:35:49,516 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-12-09 19:35:49,647 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 104 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 19:35:49,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266226321] [2020-12-09 19:35:49,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 19:35:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 19:35:49,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2020-12-09 19:35:49,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 19:35:49,934 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-09 19:35:49,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 19:35:50,129 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 35 proven. 14 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2020-12-09 19:35:50,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2020-12-09 19:35:50,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 6, 6, 4, 4] total 15 [2020-12-09 19:35:50,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836879787] [2020-12-09 19:35:50,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-09 19:35:50,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 19:35:50,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-09 19:35:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2020-12-09 19:35:50,132 INFO L87 Difference]: Start difference. First operand 1116 states and 1332 transitions. Second operand 15 states. [2020-12-09 19:36:07,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 19:36:07,544 INFO L93 Difference]: Finished difference Result 3666 states and 4413 transitions. [2020-12-09 19:36:07,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-09 19:36:07,547 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 201 [2020-12-09 19:36:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 19:36:07,547 INFO L225 Difference]: With dead ends: 3666 [2020-12-09 19:36:07,547 INFO L226 Difference]: Without dead ends: 0 [2020-12-09 19:36:07,550 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1224 GetRequests, 1196 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2020-12-09 19:36:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-09 19:36:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-09 19:36:07,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-09 19:36:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-09 19:36:07,551 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201 [2020-12-09 19:36:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 19:36:07,551 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-09 19:36:07,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-12-09 19:36:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-09 19:36:07,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-09 19:36:08,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,10 mathsat -unsat_core_generation=3,11 cvc4 --incremental --print-success --lang smt [2020-12-09 19:36:08,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-09 19:36:08,372 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2020-12-09 19:36:08,482 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 33 [2020-12-09 19:36:08,485 INFO L262 CegarLoopResult]: For program point L597(line 597) no Hoare annotation was computed. [2020-12-09 19:36:08,485 INFO L262 CegarLoopResult]: For program point L564(lines 564 582) no Hoare annotation was computed. [2020-12-09 19:36:08,485 INFO L262 CegarLoopResult]: For program point L333(lines 333 582) no Hoare annotation was computed. [2020-12-09 19:36:08,485 INFO L262 CegarLoopResult]: For program point L367(lines 367 582) no Hoare annotation was computed. [2020-12-09 19:36:08,485 INFO L262 CegarLoopResult]: For program point L301(lines 301 582) no Hoare annotation was computed. [2020-12-09 19:36:08,485 INFO L262 CegarLoopResult]: For program point L235(lines 235 582) no Hoare annotation was computed. [2020-12-09 19:36:08,485 INFO L262 CegarLoopResult]: For program point L202-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L169-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L136-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L103-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L70-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L37-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L533(lines 533 582) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L203(line 203) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L170(line 170) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L104(line 104) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L38(line 38) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L567(lines 567 582) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L435(lines 435 582) no Hoare annotation was computed. [2020-12-09 19:36:08,486 INFO L262 CegarLoopResult]: For program point L336(lines 336 582) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L270(lines 270 582) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L403(lines 403 582) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L370(lines 370 582) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L205-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L172-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L139-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L106-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L73-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L40-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L536(lines 536 582) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L503(lines 503 582) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L470(lines 470 582) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L206(line 206) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L173(line 173) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L140(line 140) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-09 19:36:08,487 INFO L262 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L339(lines 339 582) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L306(lines 306 582) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L241(lines 241 582) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L208-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L175-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L142-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L109-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L76-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L43-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L539(lines 539 582) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L440(lines 440 582) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L275(lines 275 582) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L209(line 209) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L176(line 176) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L143(line 143) no Hoare annotation was computed. [2020-12-09 19:36:08,488 INFO L262 CegarLoopResult]: For program point L110(line 110) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L77(line 77) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L44(line 44) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L573(lines 573 582) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L408(lines 408 582) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L375(lines 375 582) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L475(lines 475 582) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L211-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L178-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L145-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L112-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L79-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L46-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L509(lines 509 582) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L311(lines 311 582) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L212(line 212) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L179(line 179) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L146(line 146) no Hoare annotation was computed. [2020-12-09 19:36:08,489 INFO L262 CegarLoopResult]: For program point L113(line 113) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L47(line 47) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L345(lines 345 582) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L246(lines 246 582) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L544(lines 544 582) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L181-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L148-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L115-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L82-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L49-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L446(lines 446 582) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L413(lines 413 582) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L380(lines 380 582) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L281(lines 281 582) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L182(line 182) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2020-12-09 19:36:08,490 INFO L262 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L83(line 83) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L50(line 50) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L579(lines 579 582) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L249(lines 249 582) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L514(lines 514 582) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L481(lines 481 582) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L316(lines 316 582) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L184-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L151-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L118-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L85-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L52-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L350(lines 350 582) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L185(line 185) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L152(line 152) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L119(line 119) no Hoare annotation was computed. [2020-12-09 19:36:08,491 INFO L262 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L53(line 53) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L258 CegarLoopResult]: At program point L583(lines 30 584) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) (bvadd ~a4~0 (_ bv4294967282 32)))) (.cse1 (= (_ bv0 32) ~a12~0))) (or (and .cse0 (not (bvslt (_ bv38 32) ~a1~0)) .cse1) (and .cse0 .cse1 (= (_ bv8 32) ~a19~0)) (and .cse0 .cse1 (not (bvsge (_ bv218 32) ~a1~0)) (not (= (_ bv0 32) ~a10~0))) (and (= (_ bv2 32) ~a10~0) .cse0 .cse1) (and .cse0 (= (_ bv9 32) ~a19~0) .cse1) (and .cse0 (= (_ bv1 32) ~a10~0) .cse1))) [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L550(lines 550 582) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L418(lines 418 582) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L385(lines 385 582) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L220(lines 220 582) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L187-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L154-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L121-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L88-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L55-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L452(lines 452 582) no Hoare annotation was computed. [2020-12-09 19:36:08,492 INFO L262 CegarLoopResult]: For program point L287(lines 287 582) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L254(lines 254 582) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L188(line 188) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L155(line 155) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L89(line 89) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L56(line 56) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L519(lines 519 582) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L486(lines 486 582) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L265 CegarLoopResult]: At program point L586(lines 586 602) the Hoare annotation is: true [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L388(lines 388 582) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L355(lines 355 582) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L322(lines 322 582) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L190-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L157-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L124-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L91-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,493 INFO L262 CegarLoopResult]: For program point L58-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L191(line 191) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L158(line 158) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L125(line 125) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L555(lines 555 582) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L225(lines 225 582) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L424(lines 424 582) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L259(lines 259 582) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L193-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L160-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L127-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L94-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L61-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,494 INFO L262 CegarLoopResult]: For program point L524(lines 524 582) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L491(lines 491 582) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L458(lines 458 582) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L293(lines 293 582) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L194(line 194) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L161(line 161) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L128(line 128) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L95(line 95) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L558(lines 558 582) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L393(lines 393 582) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L327(lines 327 582) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L258 CegarLoopResult]: At program point L592-2(lines 592 601) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) (bvadd ~a4~0 (_ bv4294967282 32)))) (.cse1 (= (_ bv0 32) ~a12~0))) (or (and .cse0 (not (bvslt (_ bv38 32) ~a1~0)) .cse1) (and .cse0 .cse1 (= (_ bv8 32) ~a19~0)) (and .cse0 .cse1 (not (bvsge (_ bv218 32) ~a1~0)) (not (= (_ bv0 32) ~a10~0))) (and (= (_ bv2 32) ~a10~0) .cse0 .cse1) (and .cse0 (= (_ bv9 32) ~a19~0) .cse1) (and .cse0 (= (_ bv1 32) ~a10~0) .cse1))) [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L361(lines 361 582) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L196-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L163-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,495 INFO L262 CegarLoopResult]: For program point L130-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L97-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L31(lines 31 33) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L64-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L31-2(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L527(lines 527 582) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L296(lines 296 582) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L230(lines 230 582) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L197(line 197) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L164(line 164) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L131(line 131) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L98(line 98) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L65(line 65) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L32(line 32) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 95) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L429(lines 429 582) no Hoare annotation was computed. [2020-12-09 19:36:08,496 INFO L262 CegarLoopResult]: For program point L330(lines 330 582) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L264(lines 264 582) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L364(lines 364 582) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L199-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L166-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L133-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L100-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L67-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L34-1(lines 30 584) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L497(lines 497 582) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L464(lines 464 582) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L398(lines 398 582) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L200(line 200) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L167(line 167) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L134(line 134) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2020-12-09 19:36:08,497 INFO L262 CegarLoopResult]: For program point L35(line 35) no Hoare annotation was computed. [2020-12-09 19:36:08,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:36:08 BoogieIcfgContainer [2020-12-09 19:36:08,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 19:36:08,513 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 19:36:08,513 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 19:36:08,513 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 19:36:08,514 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:35:28" (3/4) ... [2020-12-09 19:36:08,517 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-09 19:36:08,536 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-12-09 19:36:08,537 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-09 19:36:08,538 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 19:36:08,539 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-09 19:36:08,616 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ae700baf-0f79-4dec-a14f-5a0f2138ceb2/bin/utaipan/witness.graphml [2020-12-09 19:36:08,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 19:36:08,617 INFO L168 Benchmark]: Toolchain (without parser) took 42736.51 ms. Allocated memory was 60.8 MB in the beginning and 148.9 MB in the end (delta: 88.1 MB). Free memory was 40.4 MB in the beginning and 81.9 MB in the end (delta: -41.5 MB). Peak memory consumption was 44.6 MB. Max. memory is 16.1 GB. [2020-12-09 19:36:08,617 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 60.8 MB. Free memory was 43.4 MB in the beginning and 43.4 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 19:36:08,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.34 ms. Allocated memory was 60.8 MB in the beginning and 102.8 MB in the end (delta: 41.9 MB). Free memory was 40.2 MB in the beginning and 66.6 MB in the end (delta: -26.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. [2020-12-09 19:36:08,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.06 ms. Allocated memory is still 102.8 MB. Free memory was 66.6 MB in the beginning and 61.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-09 19:36:08,618 INFO L168 Benchmark]: Boogie Preprocessor took 54.66 ms. Allocated memory is still 102.8 MB. Free memory was 61.1 MB in the beginning and 81.9 MB in the end (delta: -20.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 16.1 GB. [2020-12-09 19:36:08,618 INFO L168 Benchmark]: RCFGBuilder took 2049.97 ms. Allocated memory is still 102.8 MB. Free memory was 81.9 MB in the beginning and 48.2 MB in the end (delta: 33.7 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. [2020-12-09 19:36:08,618 INFO L168 Benchmark]: TraceAbstraction took 40058.13 ms. Allocated memory was 102.8 MB in the beginning and 148.9 MB in the end (delta: 46.1 MB). Free memory was 47.5 MB in the beginning and 97.6 MB in the end (delta: -50.1 MB). Peak memory consumption was 62.8 MB. Max. memory is 16.1 GB. [2020-12-09 19:36:08,619 INFO L168 Benchmark]: Witness Printer took 102.97 ms. Allocated memory is still 148.9 MB. Free memory was 96.5 MB in the beginning and 81.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-12-09 19:36:08,620 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.16 ms. Allocated memory is still 60.8 MB. Free memory was 43.4 MB in the beginning and 43.4 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 407.34 ms. Allocated memory was 60.8 MB in the beginning and 102.8 MB in the end (delta: 41.9 MB). Free memory was 40.2 MB in the beginning and 66.6 MB in the end (delta: -26.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.06 ms. Allocated memory is still 102.8 MB. Free memory was 66.6 MB in the beginning and 61.1 MB in the end (delta: 5.5 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.66 ms. Allocated memory is still 102.8 MB. Free memory was 61.1 MB in the beginning and 81.9 MB in the end (delta: -20.8 MB). Peak memory consumption was 10.3 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2049.97 ms. Allocated memory is still 102.8 MB. Free memory was 81.9 MB in the beginning and 48.2 MB in the end (delta: 33.7 MB). Peak memory consumption was 41.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 40058.13 ms. Allocated memory was 102.8 MB in the beginning and 148.9 MB in the end (delta: 46.1 MB). Free memory was 47.5 MB in the beginning and 97.6 MB in the end (delta: -50.1 MB). Peak memory consumption was 62.8 MB. Max. memory is 16.1 GB. * Witness Printer took 102.97 ms. Allocated memory is still 148.9 MB. Free memory was 96.5 MB in the beginning and 81.9 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 95]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: ((((((0bv32 == ~bvadd64(a4, 4294967282bv32) && !~bvslt32(38bv32, a1)) && 0bv32 == a12) || ((0bv32 == ~bvadd64(a4, 4294967282bv32) && 0bv32 == a12) && 8bv32 == a19)) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 0bv32 == a12) && !~bvsge32(218bv32, a1)) && !(0bv32 == a10))) || ((2bv32 == a10 && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 0bv32 == a12)) || ((0bv32 == ~bvadd64(a4, 4294967282bv32) && 9bv32 == a19) && 0bv32 == a12)) || ((0bv32 == ~bvadd64(a4, 4294967282bv32) && 1bv32 == a10) && 0bv32 == a12) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((0bv32 == ~bvadd64(a4, 4294967282bv32) && !~bvslt32(38bv32, a1)) && 0bv32 == a12) || ((0bv32 == ~bvadd64(a4, 4294967282bv32) && 0bv32 == a12) && 8bv32 == a19)) || (((0bv32 == ~bvadd64(a4, 4294967282bv32) && 0bv32 == a12) && !~bvsge32(218bv32, a1)) && !(0bv32 == a10))) || ((2bv32 == a10 && 0bv32 == ~bvadd64(a4, 4294967282bv32)) && 0bv32 == a12)) || ((0bv32 == ~bvadd64(a4, 4294967282bv32) && 9bv32 == a19) && 0bv32 == a12)) || ((0bv32 == ~bvadd64(a4, 4294967282bv32) && 1bv32 == a10) && 0bv32 == a12) - InvariantResult [Line: 586]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 39.6s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 32.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 686 SDtfs, 3717 SDslu, 150 SDs, 0 SdLazy, 7531 SolverSat, 1178 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 27.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2646 GetRequests, 2590 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1116occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 159 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 51 NumberOfFragments, 159 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1910 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 191 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 1676 NumberOfCodeBlocks, 1676 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2621 ConstructedInterpolants, 0 QuantifiedInterpolants, 3580147 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2263 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 1132/1485 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 proved your program to be correct! Received shutdown request...