./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/busybox-1.22.0/basename_false-unreach-call_true-no-overflow_true-valid-memsafety.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/busybox-1.22.0/basename_false-unreach-call_true-no-overflow_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c57ebc44b313bf301635c00d4458ecfdd41286b1 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/config using search string *Overflow*64bit*_Bitvector*.epf No suitable settings file found using Overflow*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_9 input size 57 context size 57 output size 57 --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 22:32:09,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:32:09,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:32:09,720 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:32:09,720 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:32:09,721 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:32:09,722 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:32:09,723 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:32:09,724 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:32:09,725 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:32:09,725 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:32:09,725 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:32:09,726 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:32:09,727 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:32:09,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:32:09,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:32:09,728 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:32:09,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:32:09,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:32:09,732 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:32:09,733 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:32:09,733 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:32:09,735 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:32:09,735 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:32:09,735 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:32:09,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:32:09,736 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:32:09,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:32:09,737 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:32:09,738 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:32:09,738 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:32:09,738 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:32:09,738 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:32:09,738 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:32:09,739 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:32:09,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:32:09,739 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-22 22:32:09,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:32:09,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:32:09,748 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 22:32:09,748 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 22:32:09,748 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 22:32:09,749 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 22:32:09,749 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 22:32:09,749 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 22:32:09,749 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 22:32:09,749 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 22:32:09,749 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 22:32:09,749 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 22:32:09,749 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 22:32:09,750 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:32:09,750 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:32:09,750 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:32:09,750 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:32:09,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 22:32:09,751 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 22:32:09,751 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 22:32:09,751 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-22 22:32:09,751 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:32:09,751 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:32:09,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 22:32:09,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:32:09,752 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:32:09,752 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 22:32:09,752 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 22:32:09,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 22:32:09,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:32:09,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 22:32:09,752 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 22:32:09,753 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 22:32:09,753 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 22:32:09,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 22:32:09,753 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 22:32:09,753 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c57ebc44b313bf301635c00d4458ecfdd41286b1 [2018-11-22 22:32:09,776 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:32:09,786 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:32:09,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:32:09,789 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:32:09,790 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:32:09,790 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/../../sv-benchmarks/c/busybox-1.22.0/basename_false-unreach-call_true-no-overflow_true-valid-memsafety.i [2018-11-22 22:32:09,830 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/data/7876162cf/14c0ce8ae98c48c2a38429b49808048c/FLAGb5cc8040d [2018-11-22 22:32:10,318 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:32:10,319 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/sv-benchmarks/c/busybox-1.22.0/basename_false-unreach-call_true-no-overflow_true-valid-memsafety.i [2018-11-22 22:32:10,332 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/data/7876162cf/14c0ce8ae98c48c2a38429b49808048c/FLAGb5cc8040d [2018-11-22 22:32:10,811 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/data/7876162cf/14c0ce8ae98c48c2a38429b49808048c [2018-11-22 22:32:10,813 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:32:10,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:32:10,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:32:10,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:32:10,817 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:32:10,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:32:10" (1/1) ... [2018-11-22 22:32:10,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6b7d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:10, skipping insertion in model container [2018-11-22 22:32:10,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:32:10" (1/1) ... [2018-11-22 22:32:10,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:32:10,866 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:32:11,332 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:32:11,346 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:32:11,394 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:32:11,529 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:32:11,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11 WrapperNode [2018-11-22 22:32:11,529 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:32:11,530 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:32:11,530 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:32:11,530 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:32:11,535 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... [2018-11-22 22:32:11,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... [2018-11-22 22:32:11,561 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:32:11,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:32:11,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:32:11,561 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:32:11,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... [2018-11-22 22:32:11,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... [2018-11-22 22:32:11,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... [2018-11-22 22:32:11,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... [2018-11-22 22:32:11,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... [2018-11-22 22:32:11,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... [2018-11-22 22:32:11,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... [2018-11-22 22:32:11,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:32:11,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:32:11,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:32:11,630 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:32:11,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/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 [2018-11-22 22:32:11,676 INFO L130 BoogieDeclarations]: Found specification of procedure __main [2018-11-22 22:32:11,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __main [2018-11-22 22:32:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure last_char_is [2018-11-22 22:32:11,677 INFO L138 BoogieDeclarations]: Found implementation of procedure last_char_is [2018-11-22 22:32:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 22:32:11,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 22:32:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-22 22:32:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 22:32:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure safe_write [2018-11-22 22:32:11,677 INFO L138 BoogieDeclarations]: Found implementation of procedure safe_write [2018-11-22 22:32:11,677 INFO L130 BoogieDeclarations]: Found specification of procedure bb_get_last_path_component_nostrip [2018-11-22 22:32:11,678 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_get_last_path_component_nostrip [2018-11-22 22:32:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure bb_get_last_path_component_strip [2018-11-22 22:32:11,678 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_get_last_path_component_strip [2018-11-22 22:32:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 22:32:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 22:32:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure write [2018-11-22 22:32:11,678 INFO L138 BoogieDeclarations]: Found implementation of procedure write [2018-11-22 22:32:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 22:32:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2018-11-22 22:32:11,678 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 22:32:11,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 22:32:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-22 22:32:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure full_write [2018-11-22 22:32:11,679 INFO L138 BoogieDeclarations]: Found implementation of procedure full_write [2018-11-22 22:32:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-22 22:32:11,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:32:11,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:32:12,472 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:32:12,473 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-22 22:32:12,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:32:12 BoogieIcfgContainer [2018-11-22 22:32:12,473 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:32:12,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 22:32:12,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 22:32:12,476 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 22:32:12,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:32:10" (1/3) ... [2018-11-22 22:32:12,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd2b430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:32:12, skipping insertion in model container [2018-11-22 22:32:12,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:32:11" (2/3) ... [2018-11-22 22:32:12,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd2b430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:32:12, skipping insertion in model container [2018-11-22 22:32:12,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:32:12" (3/3) ... [2018-11-22 22:32:12,478 INFO L112 eAbstractionObserver]: Analyzing ICFG basename_false-unreach-call_true-no-overflow_true-valid-memsafety.i [2018-11-22 22:32:12,487 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 22:32:12,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2018-11-22 22:32:12,507 INFO L257 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2018-11-22 22:32:12,532 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 22:32:12,533 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 22:32:12,533 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 22:32:12,533 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:32:12,533 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:32:12,533 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 22:32:12,533 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:32:12,534 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 22:32:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-11-22 22:32:12,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-22 22:32:12,555 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:12,556 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:12,558 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:12,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:12,563 INFO L82 PathProgramCache]: Analyzing trace with hash -51273939, now seen corresponding path program 1 times [2018-11-22 22:32:12,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:12,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:12,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:12,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:12,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:32:12,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:12,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:32:12,830 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:12,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:12,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:12,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:12,843 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 3 states. [2018-11-22 22:32:12,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:12,928 INFO L93 Difference]: Finished difference Result 298 states and 388 transitions. [2018-11-22 22:32:12,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:12,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-22 22:32:12,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:12,939 INFO L225 Difference]: With dead ends: 298 [2018-11-22 22:32:12,939 INFO L226 Difference]: Without dead ends: 149 [2018-11-22 22:32:12,943 INFO L631 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 [2018-11-22 22:32:12,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-22 22:32:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-22 22:32:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-22 22:32:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 183 transitions. [2018-11-22 22:32:12,984 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 183 transitions. Word has length 8 [2018-11-22 22:32:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:12,984 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 183 transitions. [2018-11-22 22:32:12,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 183 transitions. [2018-11-22 22:32:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-22 22:32:12,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:12,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:12,986 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:12,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1589491972, now seen corresponding path program 1 times [2018-11-22 22:32:12,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:12,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:12,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:12,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:12,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:32:13,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:13,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:32:13,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:13,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:13,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:13,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:13,097 INFO L87 Difference]: Start difference. First operand 149 states and 183 transitions. Second operand 3 states. [2018-11-22 22:32:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:13,124 INFO L93 Difference]: Finished difference Result 152 states and 186 transitions. [2018-11-22 22:32:13,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:13,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-22 22:32:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:13,127 INFO L225 Difference]: With dead ends: 152 [2018-11-22 22:32:13,127 INFO L226 Difference]: Without dead ends: 151 [2018-11-22 22:32:13,128 INFO L631 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 [2018-11-22 22:32:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-22 22:32:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-11-22 22:32:13,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-22 22:32:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 185 transitions. [2018-11-22 22:32:13,139 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 185 transitions. Word has length 9 [2018-11-22 22:32:13,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:13,139 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 185 transitions. [2018-11-22 22:32:13,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:13,139 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions. [2018-11-22 22:32:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-22 22:32:13,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:13,140 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:13,140 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:13,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:13,141 INFO L82 PathProgramCache]: Analyzing trace with hash -540770008, now seen corresponding path program 1 times [2018-11-22 22:32:13,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:13,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:13,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:13,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:32:13,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:13,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:32:13,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:13,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:13,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:13,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:13,248 INFO L87 Difference]: Start difference. First operand 151 states and 185 transitions. Second operand 3 states. [2018-11-22 22:32:13,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:13,287 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2018-11-22 22:32:13,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:13,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-22 22:32:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:13,289 INFO L225 Difference]: With dead ends: 151 [2018-11-22 22:32:13,289 INFO L226 Difference]: Without dead ends: 147 [2018-11-22 22:32:13,289 INFO L631 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 [2018-11-22 22:32:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-22 22:32:13,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-11-22 22:32:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-11-22 22:32:13,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 181 transitions. [2018-11-22 22:32:13,298 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 181 transitions. Word has length 12 [2018-11-22 22:32:13,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:13,298 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 181 transitions. [2018-11-22 22:32:13,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 181 transitions. [2018-11-22 22:32:13,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-22 22:32:13,298 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:13,299 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:13,299 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:13,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:13,299 INFO L82 PathProgramCache]: Analyzing trace with hash -540768278, now seen corresponding path program 1 times [2018-11-22 22:32:13,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:13,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:13,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:13,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:32:13,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:13,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:32:13,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:13,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:13,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:13,354 INFO L87 Difference]: Start difference. First operand 147 states and 181 transitions. Second operand 3 states. [2018-11-22 22:32:13,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:13,372 INFO L93 Difference]: Finished difference Result 147 states and 181 transitions. [2018-11-22 22:32:13,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:13,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-22 22:32:13,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:13,373 INFO L225 Difference]: With dead ends: 147 [2018-11-22 22:32:13,374 INFO L226 Difference]: Without dead ends: 146 [2018-11-22 22:32:13,374 INFO L631 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 [2018-11-22 22:32:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-22 22:32:13,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-11-22 22:32:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-11-22 22:32:13,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 178 transitions. [2018-11-22 22:32:13,382 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 178 transitions. Word has length 12 [2018-11-22 22:32:13,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:13,382 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 178 transitions. [2018-11-22 22:32:13,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 178 transitions. [2018-11-22 22:32:13,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-22 22:32:13,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:13,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:13,384 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:13,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:13,384 INFO L82 PathProgramCache]: Analyzing trace with hash 415999081, now seen corresponding path program 1 times [2018-11-22 22:32:13,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:13,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:13,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,394 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:32:13,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:13,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:32:13,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:13,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:13,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:13,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:13,477 INFO L87 Difference]: Start difference. First operand 144 states and 178 transitions. Second operand 3 states. [2018-11-22 22:32:13,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:13,527 INFO L93 Difference]: Finished difference Result 144 states and 178 transitions. [2018-11-22 22:32:13,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:13,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-22 22:32:13,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:13,529 INFO L225 Difference]: With dead ends: 144 [2018-11-22 22:32:13,529 INFO L226 Difference]: Without dead ends: 142 [2018-11-22 22:32:13,529 INFO L631 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 [2018-11-22 22:32:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-22 22:32:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-11-22 22:32:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-22 22:32:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2018-11-22 22:32:13,540 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 13 [2018-11-22 22:32:13,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:13,540 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2018-11-22 22:32:13,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:13,540 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2018-11-22 22:32:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-22 22:32:13,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:13,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:13,542 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:13,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:13,543 INFO L82 PathProgramCache]: Analyzing trace with hash 343163019, now seen corresponding path program 1 times [2018-11-22 22:32:13,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:13,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:13,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:32:13,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:13,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:32:13,634 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:13,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:13,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:13,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:13,634 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand 3 states. [2018-11-22 22:32:13,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:13,666 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2018-11-22 22:32:13,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:13,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-22 22:32:13,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:13,667 INFO L225 Difference]: With dead ends: 142 [2018-11-22 22:32:13,667 INFO L226 Difference]: Without dead ends: 140 [2018-11-22 22:32:13,668 INFO L631 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 [2018-11-22 22:32:13,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-22 22:32:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-11-22 22:32:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-22 22:32:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2018-11-22 22:32:13,675 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 15 [2018-11-22 22:32:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:13,675 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2018-11-22 22:32:13,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2018-11-22 22:32:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 22:32:13,677 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:13,677 INFO L402 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] [2018-11-22 22:32:13,677 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:13,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1254383198, now seen corresponding path program 1 times [2018-11-22 22:32:13,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:13,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:13,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:32:13,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:13,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:32:13,763 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:13,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:13,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:13,764 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand 3 states. [2018-11-22 22:32:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:13,796 INFO L93 Difference]: Finished difference Result 264 states and 334 transitions. [2018-11-22 22:32:13,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:13,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-22 22:32:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:13,797 INFO L225 Difference]: With dead ends: 264 [2018-11-22 22:32:13,797 INFO L226 Difference]: Without dead ends: 143 [2018-11-22 22:32:13,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-11-22 22:32:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-11-22 22:32:13,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-22 22:32:13,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 177 transitions. [2018-11-22 22:32:13,803 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 177 transitions. Word has length 22 [2018-11-22 22:32:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:13,804 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 177 transitions. [2018-11-22 22:32:13,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2018-11-22 22:32:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 22:32:13,806 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:13,806 INFO L402 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] [2018-11-22 22:32:13,806 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:13,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1182405925, now seen corresponding path program 1 times [2018-11-22 22:32:13,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:13,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:13,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:13,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:32:13,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:13,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 22:32:13,908 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:13,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:32:13,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:32:13,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:32:13,908 INFO L87 Difference]: Start difference. First operand 143 states and 177 transitions. Second operand 4 states. [2018-11-22 22:32:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:14,001 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2018-11-22 22:32:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:32:14,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-22 22:32:14,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:14,003 INFO L225 Difference]: With dead ends: 151 [2018-11-22 22:32:14,003 INFO L226 Difference]: Without dead ends: 150 [2018-11-22 22:32:14,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:32:14,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-22 22:32:14,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 142. [2018-11-22 22:32:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-22 22:32:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2018-11-22 22:32:14,012 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 25 [2018-11-22 22:32:14,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:14,012 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2018-11-22 22:32:14,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:32:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2018-11-22 22:32:14,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 22:32:14,013 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:14,013 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:14,014 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:14,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:14,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1182405980, now seen corresponding path program 1 times [2018-11-22 22:32:14,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:14,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:14,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:14,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:32:14,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:14,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:32:14,111 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:14,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:14,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:14,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:14,112 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand 3 states. [2018-11-22 22:32:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:14,128 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2018-11-22 22:32:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:14,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 22:32:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:14,129 INFO L225 Difference]: With dead ends: 142 [2018-11-22 22:32:14,129 INFO L226 Difference]: Without dead ends: 141 [2018-11-22 22:32:14,130 INFO L631 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 [2018-11-22 22:32:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-22 22:32:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-11-22 22:32:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-11-22 22:32:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 175 transitions. [2018-11-22 22:32:14,135 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 175 transitions. Word has length 25 [2018-11-22 22:32:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:14,135 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 175 transitions. [2018-11-22 22:32:14,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions. [2018-11-22 22:32:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 22:32:14,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:14,136 INFO L402 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] [2018-11-22 22:32:14,137 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:14,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1458323352, now seen corresponding path program 1 times [2018-11-22 22:32:14,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:14,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:14,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:14,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:14,144 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:32:14,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:14,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:14,221 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-22 22:32:14,222 INFO L202 CegarAbsIntRunner]: [94], [100], [102], [105], [107], [111], [113], [115], [117], [119], [121], [123], [125], [127], [133], [179], [180], [181], [184], [189], [202], [206], [207], [364], [370], [371], [372] [2018-11-22 22:32:14,258 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 22:32:14,258 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 22:32:14,514 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-22 22:32:14,516 INFO L272 AbstractInterpreter]: Visited 26 different actions 34 times. Merged at 3 different actions 6 times. Never widened. Performed 1221 root evaluator evaluations with a maximum evaluation depth of 8. Performed 1221 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 86 variables. [2018-11-22 22:32:14,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:14,539 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-22 22:32:14,703 INFO L227 lantSequenceWeakener]: Weakened 24 states. On average, predicates are now at 82.7% of their original sizes. [2018-11-22 22:32:14,703 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-22 22:32:14,800 INFO L415 sIntCurrentIteration]: We unified 26 AI predicates to 26 [2018-11-22 22:32:14,800 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-22 22:32:14,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-22 22:32:14,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2018-11-22 22:32:14,801 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:14,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 22:32:14,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 22:32:14,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-22 22:32:14,802 INFO L87 Difference]: Start difference. First operand 141 states and 175 transitions. Second operand 10 states. [2018-11-22 22:32:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:16,187 INFO L93 Difference]: Finished difference Result 280 states and 354 transitions. [2018-11-22 22:32:16,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:32:16,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-22 22:32:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:16,190 INFO L225 Difference]: With dead ends: 280 [2018-11-22 22:32:16,191 INFO L226 Difference]: Without dead ends: 176 [2018-11-22 22:32:16,191 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-11-22 22:32:16,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-22 22:32:16,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 151. [2018-11-22 22:32:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-11-22 22:32:16,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 188 transitions. [2018-11-22 22:32:16,199 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 188 transitions. Word has length 27 [2018-11-22 22:32:16,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:16,199 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 188 transitions. [2018-11-22 22:32:16,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 22:32:16,199 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 188 transitions. [2018-11-22 22:32:16,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 22:32:16,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:16,200 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:16,203 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:16,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash -2000120106, now seen corresponding path program 1 times [2018-11-22 22:32:16,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:16,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:16,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:16,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:16,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 22:32:16,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:16,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:32:16,282 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:16,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:16,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:16,283 INFO L87 Difference]: Start difference. First operand 151 states and 188 transitions. Second operand 3 states. [2018-11-22 22:32:16,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:16,302 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2018-11-22 22:32:16,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:16,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 22:32:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:16,305 INFO L225 Difference]: With dead ends: 158 [2018-11-22 22:32:16,305 INFO L226 Difference]: Without dead ends: 157 [2018-11-22 22:32:16,306 INFO L631 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 [2018-11-22 22:32:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-22 22:32:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2018-11-22 22:32:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-22 22:32:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 182 transitions. [2018-11-22 22:32:16,313 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 182 transitions. Word has length 26 [2018-11-22 22:32:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:16,313 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 182 transitions. [2018-11-22 22:32:16,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2018-11-22 22:32:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 22:32:16,314 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:16,314 INFO L402 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, 1] [2018-11-22 22:32:16,315 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:16,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:16,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2038217546, now seen corresponding path program 1 times [2018-11-22 22:32:16,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:16,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:16,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:16,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:32:16,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:16,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:16,407 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2018-11-22 22:32:16,408 INFO L202 CegarAbsIntRunner]: [94], [100], [102], [105], [107], [111], [113], [115], [117], [119], [121], [123], [125], [127], [133], [179], [180], [181], [184], [191], [194], [198], [206], [207], [364], [370], [371], [372] [2018-11-22 22:32:16,410 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 22:32:16,410 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 22:32:16,517 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 22:32:16,518 INFO L272 AbstractInterpreter]: Visited 28 different actions 62 times. Merged at 14 different actions 23 times. Widened at 1 different actions 1 times. Performed 1626 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1626 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 2 fixpoints after 2 different actions. Largest state had 88 variables. [2018-11-22 22:32:16,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:16,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 22:32:16,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:16,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:16,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:16,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:32:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:16,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:32:16,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:32:16,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:16,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-22 22:32:16,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:16,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:32:16,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:32:16,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:32:16,818 INFO L87 Difference]: Start difference. First operand 146 states and 182 transitions. Second operand 5 states. [2018-11-22 22:32:16,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:16,844 INFO L93 Difference]: Finished difference Result 287 states and 359 transitions. [2018-11-22 22:32:16,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:32:16,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-22 22:32:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:16,850 INFO L225 Difference]: With dead ends: 287 [2018-11-22 22:32:16,850 INFO L226 Difference]: Without dead ends: 151 [2018-11-22 22:32:16,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:32:16,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-22 22:32:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-11-22 22:32:16,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-22 22:32:16,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 185 transitions. [2018-11-22 22:32:16,858 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 185 transitions. Word has length 28 [2018-11-22 22:32:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:16,858 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 185 transitions. [2018-11-22 22:32:16,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:32:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2018-11-22 22:32:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 22:32:16,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:16,859 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:16,859 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:16,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 633849756, now seen corresponding path program 2 times [2018-11-22 22:32:16,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:16,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:16,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:16,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:16,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:32:16,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:16,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:16,945 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:16,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:16,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:16,945 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:16,973 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:32:16,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:32:17,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-22 22:32:17,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:17,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:17,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 22:32:17,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 22:32:17,148 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-22 22:32:17,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 9 [2018-11-22 22:32:17,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:17,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-22 22:32:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:32:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:32:17,149 INFO L87 Difference]: Start difference. First operand 149 states and 185 transitions. Second operand 4 states. [2018-11-22 22:32:17,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:17,212 INFO L93 Difference]: Finished difference Result 261 states and 328 transitions. [2018-11-22 22:32:17,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:32:17,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-22 22:32:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:17,214 INFO L225 Difference]: With dead ends: 261 [2018-11-22 22:32:17,214 INFO L226 Difference]: Without dead ends: 149 [2018-11-22 22:32:17,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:32:17,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-22 22:32:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-11-22 22:32:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-11-22 22:32:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 184 transitions. [2018-11-22 22:32:17,223 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 184 transitions. Word has length 31 [2018-11-22 22:32:17,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:17,223 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 184 transitions. [2018-11-22 22:32:17,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-22 22:32:17,223 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 184 transitions. [2018-11-22 22:32:17,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 22:32:17,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:17,224 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-22 22:32:17,224 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:17,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:17,224 INFO L82 PathProgramCache]: Analyzing trace with hash -478501859, now seen corresponding path program 1 times [2018-11-22 22:32:17,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:17,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:17,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:32:17,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:17,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-22 22:32:17,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:32:17,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:32:17,307 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 22:32:17,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 22:32:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:32:17,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:32:17,308 INFO L87 Difference]: Start difference. First operand 149 states and 184 transitions. Second operand 3 states. [2018-11-22 22:32:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:17,329 INFO L93 Difference]: Finished difference Result 149 states and 184 transitions. [2018-11-22 22:32:17,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:32:17,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-22 22:32:17,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:17,331 INFO L225 Difference]: With dead ends: 149 [2018-11-22 22:32:17,332 INFO L226 Difference]: Without dead ends: 148 [2018-11-22 22:32:17,332 INFO L631 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 [2018-11-22 22:32:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-22 22:32:17,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2018-11-22 22:32:17,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-22 22:32:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 176 transitions. [2018-11-22 22:32:17,341 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 176 transitions. Word has length 36 [2018-11-22 22:32:17,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:17,342 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 176 transitions. [2018-11-22 22:32:17,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 22:32:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2018-11-22 22:32:17,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-22 22:32:17,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:17,344 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:17,344 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:17,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:17,344 INFO L82 PathProgramCache]: Analyzing trace with hash -268863245, now seen corresponding path program 1 times [2018-11-22 22:32:17,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:17,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:17,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:17,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:17,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:32:17,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:17,447 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:17,448 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-11-22 22:32:17,448 INFO L202 CegarAbsIntRunner]: [94], [100], [102], [105], [107], [111], [113], [115], [117], [119], [121], [123], [125], [127], [133], [135], [141], [143], [146], [148], [153], [155], [179], [180], [181], [184], [191], [194], [198], [206], [207], [364], [370], [371], [372] [2018-11-22 22:32:17,450 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 22:32:17,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 22:32:17,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 22:32:17,601 INFO L272 AbstractInterpreter]: Visited 35 different actions 81 times. Merged at 11 different actions 24 times. Widened at 1 different actions 1 times. Performed 1867 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1867 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 5 fixpoints after 4 different actions. Largest state had 91 variables. [2018-11-22 22:32:17,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:17,613 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 22:32:17,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:17,613 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:17,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:17,639 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:32:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:17,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:17,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:32:17,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-22 22:32:17,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:17,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-22 22:32:17,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:17,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 22:32:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:32:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:32:17,846 INFO L87 Difference]: Start difference. First operand 142 states and 176 transitions. Second operand 6 states. [2018-11-22 22:32:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:17,892 INFO L93 Difference]: Finished difference Result 276 states and 344 transitions. [2018-11-22 22:32:17,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:32:17,892 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-11-22 22:32:17,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:17,893 INFO L225 Difference]: With dead ends: 276 [2018-11-22 22:32:17,893 INFO L226 Difference]: Without dead ends: 147 [2018-11-22 22:32:17,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 22:32:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-22 22:32:17,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-11-22 22:32:17,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-22 22:32:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 179 transitions. [2018-11-22 22:32:17,902 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 179 transitions. Word has length 38 [2018-11-22 22:32:17,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:17,902 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 179 transitions. [2018-11-22 22:32:17,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 22:32:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 179 transitions. [2018-11-22 22:32:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-22 22:32:17,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:17,903 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:17,903 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:17,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:17,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1680262853, now seen corresponding path program 2 times [2018-11-22 22:32:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:17,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:17,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:17,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:17,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:32:17,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:17,971 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:17,971 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:17,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:17,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:17,972 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:17,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:32:17,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:32:18,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 22:32:18,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:18,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:32:18,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:32:18,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:18,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-22 22:32:18,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:18,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 22:32:18,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:32:18,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:32:18,247 INFO L87 Difference]: Start difference. First operand 145 states and 179 transitions. Second operand 5 states. [2018-11-22 22:32:18,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:18,274 INFO L93 Difference]: Finished difference Result 269 states and 337 transitions. [2018-11-22 22:32:18,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:32:18,275 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-11-22 22:32:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:18,276 INFO L225 Difference]: With dead ends: 269 [2018-11-22 22:32:18,276 INFO L226 Difference]: Without dead ends: 150 [2018-11-22 22:32:18,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 22:32:18,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-22 22:32:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-22 22:32:18,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-22 22:32:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 182 transitions. [2018-11-22 22:32:18,283 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 182 transitions. Word has length 41 [2018-11-22 22:32:18,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:18,283 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 182 transitions. [2018-11-22 22:32:18,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 22:32:18,283 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 182 transitions. [2018-11-22 22:32:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-22 22:32:18,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:18,284 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-11-22 22:32:18,284 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:18,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:18,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1413256610, now seen corresponding path program 3 times [2018-11-22 22:32:18,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:18,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:18,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:32:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:18,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-22 22:32:18,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:18,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:18,394 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:18,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:18,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:18,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:18,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:32:18,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 22:32:18,489 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:32:18,490 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:18,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:32:18,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:18,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-22 22:32:18,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:18,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-11-22 22:32:18,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:18,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:32:18,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:32:18,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:32:18,585 INFO L87 Difference]: Start difference. First operand 148 states and 182 transitions. Second operand 9 states. [2018-11-22 22:32:18,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:18,638 INFO L93 Difference]: Finished difference Result 290 states and 359 transitions. [2018-11-22 22:32:18,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 22:32:18,641 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 44 [2018-11-22 22:32:18,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:18,642 INFO L225 Difference]: With dead ends: 290 [2018-11-22 22:32:18,642 INFO L226 Difference]: Without dead ends: 158 [2018-11-22 22:32:18,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:32:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-22 22:32:18,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2018-11-22 22:32:18,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-22 22:32:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 188 transitions. [2018-11-22 22:32:18,650 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 188 transitions. Word has length 44 [2018-11-22 22:32:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:18,650 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 188 transitions. [2018-11-22 22:32:18,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:32:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 188 transitions. [2018-11-22 22:32:18,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-22 22:32:18,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:18,651 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:18,651 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:18,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:18,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1211589613, now seen corresponding path program 4 times [2018-11-22 22:32:18,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:18,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:32:18,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:18,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-22 22:32:18,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:18,764 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:18,764 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:18,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:18,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:18,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:18,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:18,793 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:32:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:18,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:19,001 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-22 22:32:19,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-22 22:32:19,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:19,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2018-11-22 22:32:19,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:19,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 22:32:19,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 22:32:19,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-22 22:32:19,095 INFO L87 Difference]: Start difference. First operand 154 states and 188 transitions. Second operand 11 states. [2018-11-22 22:32:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:19,185 INFO L93 Difference]: Finished difference Result 299 states and 368 transitions. [2018-11-22 22:32:19,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 22:32:19,189 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2018-11-22 22:32:19,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:19,190 INFO L225 Difference]: With dead ends: 299 [2018-11-22 22:32:19,190 INFO L226 Difference]: Without dead ends: 164 [2018-11-22 22:32:19,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-22 22:32:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-22 22:32:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-11-22 22:32:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-22 22:32:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2018-11-22 22:32:19,196 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 50 [2018-11-22 22:32:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:19,196 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2018-11-22 22:32:19,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 22:32:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2018-11-22 22:32:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 22:32:19,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:19,197 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:19,197 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:19,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:19,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1484183166, now seen corresponding path program 5 times [2018-11-22 22:32:19,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:19,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:19,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-22 22:32:19,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:19,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:19,289 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:19,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:19,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:19,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:19,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:32:19,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:32:20,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-22 22:32:20,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:20,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:20,563 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-22 22:32:20,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:20,612 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-22 22:32:20,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:20,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-22 22:32:20,628 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:20,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 22:32:20,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 22:32:20,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:32:20,629 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand 8 states. [2018-11-22 22:32:20,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:20,673 INFO L93 Difference]: Finished difference Result 293 states and 361 transitions. [2018-11-22 22:32:20,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 22:32:20,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2018-11-22 22:32:20,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:20,674 INFO L225 Difference]: With dead ends: 293 [2018-11-22 22:32:20,675 INFO L226 Difference]: Without dead ends: 165 [2018-11-22 22:32:20,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:32:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-22 22:32:20,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-11-22 22:32:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-22 22:32:20,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 197 transitions. [2018-11-22 22:32:20,683 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 197 transitions. Word has length 56 [2018-11-22 22:32:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:20,683 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 197 transitions. [2018-11-22 22:32:20,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 22:32:20,683 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 197 transitions. [2018-11-22 22:32:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-22 22:32:20,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:20,684 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:20,684 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:20,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:20,684 INFO L82 PathProgramCache]: Analyzing trace with hash -360915515, now seen corresponding path program 6 times [2018-11-22 22:32:20,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:20,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:20,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:32:20,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:20,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:20,811 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-22 22:32:20,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:20,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:20,811 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:20,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:20,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:20,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:20,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:32:20,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 22:32:20,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:32:20,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:20,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-22 22:32:20,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-22 22:32:21,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:21,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-22 22:32:21,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:21,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 22:32:21,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 22:32:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:32:21,030 INFO L87 Difference]: Start difference. First operand 163 states and 197 transitions. Second operand 9 states. [2018-11-22 22:32:21,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:21,073 INFO L93 Difference]: Finished difference Result 309 states and 377 transitions. [2018-11-22 22:32:21,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 22:32:21,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-11-22 22:32:21,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:21,075 INFO L225 Difference]: With dead ends: 309 [2018-11-22 22:32:21,075 INFO L226 Difference]: Without dead ends: 168 [2018-11-22 22:32:21,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:32:21,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-11-22 22:32:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-11-22 22:32:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-22 22:32:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2018-11-22 22:32:21,082 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 59 [2018-11-22 22:32:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:21,083 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2018-11-22 22:32:21,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 22:32:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2018-11-22 22:32:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-22 22:32:21,083 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:21,083 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:21,084 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:21,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:21,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1464125235, now seen corresponding path program 7 times [2018-11-22 22:32:21,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:21,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:21,089 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:32:21,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:21,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-22 22:32:21,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:21,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:21,201 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:21,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:21,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:21,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:21,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:21,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:32:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:21,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-22 22:32:21,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-22 22:32:21,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:21,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2018-11-22 22:32:21,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:21,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 22:32:21,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 22:32:21,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-22 22:32:21,493 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand 15 states. [2018-11-22 22:32:21,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:21,608 INFO L93 Difference]: Finished difference Result 317 states and 386 transitions. [2018-11-22 22:32:21,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 22:32:21,609 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-11-22 22:32:21,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:21,610 INFO L225 Difference]: With dead ends: 317 [2018-11-22 22:32:21,610 INFO L226 Difference]: Without dead ends: 176 [2018-11-22 22:32:21,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 111 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-22 22:32:21,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-11-22 22:32:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 172. [2018-11-22 22:32:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-11-22 22:32:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2018-11-22 22:32:21,616 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 62 [2018-11-22 22:32:21,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:21,617 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2018-11-22 22:32:21,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 22:32:21,617 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2018-11-22 22:32:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-22 22:32:21,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:21,617 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:21,617 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:21,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:21,618 INFO L82 PathProgramCache]: Analyzing trace with hash -420268702, now seen corresponding path program 8 times [2018-11-22 22:32:21,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:21,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:21,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:21,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:21,622 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:21,756 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2018-11-22 22:32:21,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:21,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:21,756 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:21,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:21,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:21,757 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:21,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:32:21,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:32:26,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-22 22:32:26,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:26,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:26,841 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-22 22:32:26,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-22 22:32:26,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:26,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2018-11-22 22:32:26,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 22:32:26,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 22:32:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:32:26,965 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand 17 states. [2018-11-22 22:32:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:27,044 INFO L93 Difference]: Finished difference Result 326 states and 395 transitions. [2018-11-22 22:32:27,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 22:32:27,044 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 68 [2018-11-22 22:32:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:27,045 INFO L225 Difference]: With dead ends: 326 [2018-11-22 22:32:27,045 INFO L226 Difference]: Without dead ends: 182 [2018-11-22 22:32:27,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:32:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-22 22:32:27,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2018-11-22 22:32:27,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-22 22:32:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 212 transitions. [2018-11-22 22:32:27,052 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 212 transitions. Word has length 68 [2018-11-22 22:32:27,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:27,052 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 212 transitions. [2018-11-22 22:32:27,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 22:32:27,052 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 212 transitions. [2018-11-22 22:32:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-22 22:32:27,053 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:27,053 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:27,053 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:27,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1212679597, now seen corresponding path program 9 times [2018-11-22 22:32:27,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:27,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:32:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:27,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-11-22 22:32:27,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:27,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:27,154 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:27,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:27,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:27,154 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:27,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:32:27,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 22:32:27,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:32:27,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:27,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-22 22:32:27,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:27,538 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2018-11-22 22:32:27,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:27,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20 [2018-11-22 22:32:27,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:27,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-22 22:32:27,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-22 22:32:27,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:32:27,556 INFO L87 Difference]: Start difference. First operand 178 states and 212 transitions. Second operand 19 states. [2018-11-22 22:32:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:27,675 INFO L93 Difference]: Finished difference Result 335 states and 404 transitions. [2018-11-22 22:32:27,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-22 22:32:27,681 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 74 [2018-11-22 22:32:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:27,682 INFO L225 Difference]: With dead ends: 335 [2018-11-22 22:32:27,682 INFO L226 Difference]: Without dead ends: 188 [2018-11-22 22:32:27,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 131 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-22 22:32:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-22 22:32:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 184. [2018-11-22 22:32:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-22 22:32:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 218 transitions. [2018-11-22 22:32:27,688 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 218 transitions. Word has length 74 [2018-11-22 22:32:27,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:27,688 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 218 transitions. [2018-11-22 22:32:27,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-22 22:32:27,688 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 218 transitions. [2018-11-22 22:32:27,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-22 22:32:27,689 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:27,689 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:27,689 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:27,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:27,690 INFO L82 PathProgramCache]: Analyzing trace with hash -38749886, now seen corresponding path program 10 times [2018-11-22 22:32:27,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:27,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:32:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:27,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:27,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 1 proven. 92 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2018-11-22 22:32:27,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:27,812 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:27,813 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:27,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:27,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:27,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:27,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:27,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 22:32:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:27,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:28,070 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-22 22:32:28,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2018-11-22 22:32:28,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:28,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 21 [2018-11-22 22:32:28,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:28,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-22 22:32:28,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-22 22:32:28,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-11-22 22:32:28,233 INFO L87 Difference]: Start difference. First operand 184 states and 218 transitions. Second operand 21 states. [2018-11-22 22:32:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:28,347 INFO L93 Difference]: Finished difference Result 342 states and 411 transitions. [2018-11-22 22:32:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-22 22:32:28,348 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-11-22 22:32:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:28,349 INFO L225 Difference]: With dead ends: 342 [2018-11-22 22:32:28,349 INFO L226 Difference]: Without dead ends: 192 [2018-11-22 22:32:28,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-11-22 22:32:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-22 22:32:28,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-11-22 22:32:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-22 22:32:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 224 transitions. [2018-11-22 22:32:28,358 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 224 transitions. Word has length 80 [2018-11-22 22:32:28,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:28,358 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 224 transitions. [2018-11-22 22:32:28,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-22 22:32:28,358 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 224 transitions. [2018-11-22 22:32:28,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-22 22:32:28,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:28,359 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:28,359 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:28,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:28,360 INFO L82 PathProgramCache]: Analyzing trace with hash -622054029, now seen corresponding path program 11 times [2018-11-22 22:32:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:28,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:32:28,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:28,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-22 22:32:28,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:28,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:28,525 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:28,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:28,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:28,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:28,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:32:28,580 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 22:32:46,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-22 22:32:46,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:46,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:46,780 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-22 22:32:46,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:46,846 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 1 proven. 117 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-22 22:32:46,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 22:32:46,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-22 22:32:46,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 22:32:46,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 22:32:46,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 22:32:46,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:32:46,867 INFO L87 Difference]: Start difference. First operand 190 states and 224 transitions. Second operand 13 states. [2018-11-22 22:32:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:32:46,912 INFO L93 Difference]: Finished difference Result 336 states and 404 transitions. [2018-11-22 22:32:46,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 22:32:46,913 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2018-11-22 22:32:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 22:32:46,913 INFO L225 Difference]: With dead ends: 336 [2018-11-22 22:32:46,914 INFO L226 Difference]: Without dead ends: 193 [2018-11-22 22:32:46,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 162 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 22:32:46,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-22 22:32:46,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-11-22 22:32:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-11-22 22:32:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 227 transitions. [2018-11-22 22:32:46,922 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 227 transitions. Word has length 86 [2018-11-22 22:32:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 22:32:46,923 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 227 transitions. [2018-11-22 22:32:46,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 22:32:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 227 transitions. [2018-11-22 22:32:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-22 22:32:46,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 22:32:46,924 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 22:32:46,924 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, __mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, full_writeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-22 22:32:46,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:32:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -576225228, now seen corresponding path program 12 times [2018-11-22 22:32:46,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 22:32:46,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:46,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:32:46,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:32:46,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 22:32:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:32:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-11-22 22:32:47,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:47,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 22:32:47,811 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 22:32:47,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 22:32:47,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:32:47,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_aab77daf-9807-476a-a154-60f632e8fff3/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:32:47,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 22:32:47,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 22:32:47,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 22:32:47,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:32:47,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:32:47,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-22 22:32:47,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:47,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:47,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-22 22:32:48,011 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:48,014 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:48,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-22 22:32:48,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-22 22:32:48,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-22 22:32:48,055 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,060 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-22 22:32:48,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-22 22:32:48,096 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,101 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,127 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:56, output treesize:46 [2018-11-22 22:32:48,185 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:48,189 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:48,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:48,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-22 22:32:48,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 634 treesize of output 500 [2018-11-22 22:32:48,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:48,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-11-22 22:32:48,357 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 190 [2018-11-22 22:32:48,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-22 22:32:48,406 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:48,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:48,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 238 [2018-11-22 22:32:48,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 1 [2018-11-22 22:32:48,462 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,480 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,509 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 125 [2018-11-22 22:32:48,586 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:48,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-11-22 22:32:48,589 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 82 [2018-11-22 22:32:48,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-22 22:32:48,611 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 86 [2018-11-22 22:32:48,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-11-22 22:32:48,640 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,652 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,659 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,667 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:48,693 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:673, output treesize:98 [2018-11-22 22:32:48,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 166 [2018-11-22 22:32:48,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2018-11-22 22:32:48,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2018-11-22 22:32:48,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:48,837 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,849 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:48,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:48,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 166 [2018-11-22 22:32:48,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:48,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2018-11-22 22:32:48,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:48,960 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:48,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:48,993 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:49,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 166 [2018-11-22 22:32:49,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2018-11-22 22:32:49,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,068 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,080 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:49,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:49,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2018-11-22 22:32:49,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 107 [2018-11-22 22:32:49,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2018-11-22 22:32:49,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:49,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:49,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2018-11-22 22:32:49,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,281 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 107 [2018-11-22 22:32:49,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2018-11-22 22:32:49,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,336 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:49,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:49,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 166 [2018-11-22 22:32:49,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2018-11-22 22:32:49,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:49,470 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:49,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2018-11-22 22:32:49,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,534 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 107 [2018-11-22 22:32:49,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2018-11-22 22:32:49,578 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,587 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:49,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:49,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 166 [2018-11-22 22:32:49,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,652 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2018-11-22 22:32:49,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,694 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:49,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:49,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 166 [2018-11-22 22:32:49,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2018-11-22 22:32:49,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2018-11-22 22:32:49,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:49,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:49,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 169 [2018-11-22 22:32:49,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2018-11-22 22:32:49,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 107 [2018-11-22 22:32:49,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 1 [2018-11-22 22:32:49,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:49,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:49,953 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-22 22:32:50,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2018-11-22 22:32:50,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 22:32:50,095 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 22:32:50,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 43 [2018-11-22 22:32:50,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-22 22:32:50,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2018-11-22 22:32:50,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-11-22 22:32:50,142 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,157 INFO L683 Elim1Store]: detected equality via solver [2018-11-22 22:32:50,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-22 22:32:50,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,165 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,179 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:121, output treesize:7 [2018-11-22 22:32:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2018-11-22 22:32:50,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 22:32:50,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,401 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,436 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,443 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,463 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,471 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-11-22 22:32:50,490 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:271, output treesize:99 [2018-11-22 22:32:50,699 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-22 22:32:50,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,719 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,735 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,747 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:50,748 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,763 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,936 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,948 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,949 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,961 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,962 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:50,977 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,133 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,142 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,142 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,154 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,155 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,164 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,165 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,175 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,318 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:51,327 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:51,328 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,337 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,338 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,353 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:51,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 15 dim-0 vars, and 7 xjuncts. [2018-11-22 22:32:51,483 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 10 variables, input treesize:339, output treesize:440 [2018-11-22 22:32:55,223 WARN L180 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 103 DAG size of output: 62 [2018-11-22 22:32:55,757 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2018-11-22 22:32:55,759 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:55,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:55,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:55,790 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:55,792 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:55,809 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:55,810 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:55,830 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,220 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,233 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,234 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,252 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,253 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,276 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,776 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,792 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,793 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:56,814 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,217 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:57,226 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:57,227 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,238 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,552 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,574 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,575 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,586 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,588 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,603 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,604 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,618 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,926 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,935 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,937 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,953 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:32:57,954 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-22 22:32:57,968 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:32:58,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-22 22:32:58,196 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 16 variables, input treesize:601, output treesize:566 [2018-11-22 22:33:00,935 WARN L180 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2018-11-22 22:33:00,937 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:00,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:00,962 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,000 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,002 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,020 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,021 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,033 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,486 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,499 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,499 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,511 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,979 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,995 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:01,996 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:02,009 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:02,010 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:02,024 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:02,025 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:02,034 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:02,445 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:02,453 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:02,454 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:02,464 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:02,794 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:02,815 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:02,816 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:02,853 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:02,854 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:02,868 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:03,174 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:03,183 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:03,184 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:03,199 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:03,200 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:03,220 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:03,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-22 22:33:03,480 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 16 variables, input treesize:601, output treesize:566 [2018-11-22 22:33:06,139 WARN L180 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2018-11-22 22:33:06,141 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,154 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:06,190 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:06,191 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:06,206 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:06,591 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:06,602 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:06,603 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,615 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,921 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,941 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,942 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,954 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,955 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,975 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,976 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:06,994 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,331 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,344 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,345 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,355 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,639 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,660 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,661 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,678 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,679 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:07,690 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:07,951 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,991 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:07,992 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:08,010 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:08,011 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:08,020 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:08,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-22 22:33:08,278 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 16 variables, input treesize:601, output treesize:566 [2018-11-22 22:33:11,008 WARN L180 SmtUtils]: Spent 585.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2018-11-22 22:33:11,010 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,044 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,062 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,063 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,081 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,475 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:11,486 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:11,487 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,499 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,854 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,867 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,868 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:11,880 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,245 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,265 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,266 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,279 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,280 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,301 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,646 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,661 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,661 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,679 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,680 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:12,690 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:12,692 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:12,712 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:13,046 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:13,063 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:13,064 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:13,073 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:13,074 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:13,088 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:13,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-22 22:33:13,376 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 16 variables, input treesize:601, output treesize:566 [2018-11-22 22:33:16,169 WARN L180 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2018-11-22 22:33:16,170 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,209 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,229 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,230 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,249 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,840 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,853 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:16,853 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:16,868 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:17,407 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:17,428 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:17,429 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:17,443 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:17,444 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:17,454 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:17,455 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:17,470 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:17,916 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:17,937 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:17,937 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:17,949 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:17,951 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:17,969 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,368 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,378 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,379 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,388 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,726 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,745 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,746 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,760 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,761 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:18,778 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:19,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-22 22:33:19,120 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 16 variables, input treesize:601, output treesize:566 [2018-11-22 22:33:21,858 WARN L180 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2018-11-22 22:33:21,860 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:21,887 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:21,887 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:21,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:21,906 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:21,919 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:21,920 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:21,942 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,397 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:22,408 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:22,409 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,425 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,426 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,452 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,453 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,469 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,896 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,909 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,909 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,929 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,930 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:22,951 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:23,364 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:23,381 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:23,382 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:23,391 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:23,392 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:23,407 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:23,782 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:23,795 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:23,795 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:23,807 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:24,105 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:24,114 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:24,115 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:24,125 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:24,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-22 22:33:24,405 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 16 variables, input treesize:601, output treesize:566 [2018-11-22 22:33:27,090 WARN L180 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 130 [2018-11-22 22:33:27,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:27,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:27,439 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,456 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,457 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,470 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,490 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,761 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,776 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,777 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:27,785 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:27,787 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:27,809 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,100 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,110 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,110 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,119 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,355 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,377 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,378 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,391 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,392 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,431 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,643 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,653 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,653 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:28,667 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:28,667 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,684 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:28,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 6 dim-2 vars, End of recursive call: 17 dim-0 vars, and 8 xjuncts. [2018-11-22 22:33:28,878 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 16 variables, input treesize:601, output treesize:517 [2018-11-22 22:33:30,002 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-22 22:33:30,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,029 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,044 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,045 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,057 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,228 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,241 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,241 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:30,252 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:30,253 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,268 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,425 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,434 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,435 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,447 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,448 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,458 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,604 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:30,614 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:30,614 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:30,623 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:30,624 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,640 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,641 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,652 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:30,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 15 dim-0 vars, and 7 xjuncts. [2018-11-22 22:33:30,776 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 10 variables, input treesize:339, output treesize:440 [2018-11-22 22:33:39,978 WARN L180 SmtUtils]: Spent 7.10 s on a formula simplification. DAG size of input: 198 DAG size of output: 195 [2018-11-22 22:33:39,980 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:40,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:40,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:40,041 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:40,042 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:40,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:40,076 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:40,114 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:44,671 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:44,709 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:44,710 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:44,735 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:44,736 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:44,763 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:44,763 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:44,778 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:48,891 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:48,920 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:48,921 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:48,949 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:52,592 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:52,612 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:52,613 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:52,630 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:55,287 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:55,316 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:55,317 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-22 22:33:55,354 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:33:55,355 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:55,418 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:58,064 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:58,090 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:58,091 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:58,111 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:58,112 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:58,143 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-22 22:33:58,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 6 dim-2 vars, End of recursive call: 37 dim-0 vars, and 9 xjuncts. [2018-11-22 22:33:58,881 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 22 variables, input treesize:2131, output treesize:2600 [2018-11-22 22:34:20,719 WARN L180 SmtUtils]: Spent 16.05 s on a formula simplification. DAG size of input: 323 DAG size of output: 91 [2018-11-22 22:34:21,245 WARN L180 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 212 DAG size of output: 126 [2018-11-22 22:34:21,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 296 treesize of output 274 [2018-11-22 22:34:21,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 237 treesize of output 226 [2018-11-22 22:34:21,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 230 [2018-11-22 22:34:21,362 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-22 22:34:21,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 22:34:21,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 211 [2018-11-22 22:34:21,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-11-22 22:34:21,492 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 22:34:21,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:34:21,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 217 treesize of output 209 [2018-11-22 22:34:21,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 16 [2018-11-22 22:34:21,564 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-22 22:34:21,578 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 22:34:21,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 22:34:21,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 492 treesize of output 405 [2018-11-22 22:34:22,089 WARN L180 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 123 [2018-11-22 22:34:22,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 328 [2018-11-22 22:34:22,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2018-11-22 22:34:22,116 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-22 22:34:22,176 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 22:34:22,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 352 treesize of output 330 [2018-11-22 22:34:22,647 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 22:34:22,648 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: v_arrayElimArr_9 input size 57 context size 57 output size 57 at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-22 22:34:22,650 INFO L168 Benchmark]: Toolchain (without parser) took 131836.96 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 448.3 MB). Free memory was 956.6 MB in the beginning and 1.4 GB in the end (delta: -449.0 MB). Peak memory consumption was 613.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:22,651 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:34:22,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -102.4 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:22,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:22,651 INFO L168 Benchmark]: Boogie Preprocessor took 68.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:22,651 INFO L168 Benchmark]: RCFGBuilder took 843.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.4 MB in the end (delta: 94.5 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:22,652 INFO L168 Benchmark]: TraceAbstraction took 130176.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.0 MB). Free memory was 956.4 MB in the beginning and 1.4 GB in the end (delta: -449.1 MB). Peak memory consumption was 479.5 MB. Max. memory is 11.5 GB. [2018-11-22 22:34:22,653 INFO L336 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 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 715.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -102.4 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 843.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.4 MB in the end (delta: 94.5 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 130176.12 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 314.0 MB). Free memory was 956.4 MB in the beginning and 1.4 GB in the end (delta: -449.1 MB). Peak memory consumption was 479.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_arrayElimArr_9 input size 57 context size 57 output size 57 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_arrayElimArr_9 input size 57 context size 57 output size 57: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:452) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...