./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/busybox-1.22.0/dirname_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_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/busybox-1.22.0/dirname_true-no-overflow_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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 eb1520ccd16a6dcbfeb7912e1d04b4742bbea576 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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_prenex_146 input size 46 context size 46 output size 46 --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 02:23:17,013 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 02:23:17,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 02:23:17,023 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 02:23:17,023 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 02:23:17,023 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 02:23:17,024 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 02:23:17,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 02:23:17,026 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 02:23:17,027 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 02:23:17,028 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 02:23:17,028 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 02:23:17,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 02:23:17,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 02:23:17,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 02:23:17,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 02:23:17,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 02:23:17,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 02:23:17,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 02:23:17,034 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 02:23:17,035 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 02:23:17,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 02:23:17,036 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 02:23:17,037 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 02:23:17,037 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 02:23:17,037 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 02:23:17,038 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 02:23:17,038 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 02:23:17,039 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 02:23:17,040 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 02:23:17,040 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 02:23:17,040 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 02:23:17,040 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 02:23:17,040 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 02:23:17,041 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 02:23:17,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 02:23:17,042 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 02:23:17,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 02:23:17,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 02:23:17,052 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 02:23:17,052 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 02:23:17,052 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 02:23:17,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 02:23:17,052 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 02:23:17,052 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 02:23:17,052 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 02:23:17,053 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 02:23:17,053 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 02:23:17,053 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 02:23:17,053 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 02:23:17,053 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 02:23:17,054 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 02:23:17,054 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 02:23:17,054 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 02:23:17,054 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 02:23:17,054 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 02:23:17,054 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 02:23:17,054 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 02:23:17,054 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 02:23:17,055 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 02:23:17,055 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 02:23:17,055 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 02:23:17,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 02:23:17,055 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 02:23:17,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 02:23:17,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 02:23:17,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 02:23:17,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 02:23:17,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 02:23:17,056 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 02:23:17,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 02:23:17,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 02:23:17,056 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 02:23:17,056 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_c3b23220-f296-47bc-aa04-25570e1896df/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 -> eb1520ccd16a6dcbfeb7912e1d04b4742bbea576 [2018-11-23 02:23:17,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 02:23:17,090 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 02:23:17,093 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 02:23:17,094 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 02:23:17,094 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 02:23:17,094 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/../../sv-benchmarks/c/busybox-1.22.0/dirname_true-no-overflow_true-valid-memsafety.i [2018-11-23 02:23:17,138 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/data/6154d4e7d/4094af7ed0974a9582c04539e21e778e/FLAGdf4a77a29 [2018-11-23 02:23:17,529 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 02:23:17,529 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/sv-benchmarks/c/busybox-1.22.0/dirname_true-no-overflow_true-valid-memsafety.i [2018-11-23 02:23:17,542 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/data/6154d4e7d/4094af7ed0974a9582c04539e21e778e/FLAGdf4a77a29 [2018-11-23 02:23:17,554 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/bin-2019/utaipan/data/6154d4e7d/4094af7ed0974a9582c04539e21e778e [2018-11-23 02:23:17,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 02:23:17,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 02:23:17,558 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 02:23:17,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 02:23:17,561 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 02:23:17,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:23:17" (1/1) ... [2018-11-23 02:23:17,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc526c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:17, skipping insertion in model container [2018-11-23 02:23:17,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:23:17" (1/1) ... [2018-11-23 02:23:17,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 02:23:17,613 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 02:23:18,041 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:23:18,059 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 02:23:18,110 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 02:23:18,259 INFO L195 MainTranslator]: Completed translation [2018-11-23 02:23:18,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18 WrapperNode [2018-11-23 02:23:18,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 02:23:18,260 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 02:23:18,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 02:23:18,260 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 02:23:18,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... [2018-11-23 02:23:18,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... [2018-11-23 02:23:18,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 02:23:18,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 02:23:18,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 02:23:18,293 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 02:23:18,298 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... [2018-11-23 02:23:18,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... [2018-11-23 02:23:18,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... [2018-11-23 02:23:18,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... [2018-11-23 02:23:18,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... [2018-11-23 02:23:18,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... [2018-11-23 02:23:18,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... [2018-11-23 02:23:18,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 02:23:18,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 02:23:18,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 02:23:18,346 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 02:23:18,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:18,391 INFO L130 BoogieDeclarations]: Found specification of procedure __main [2018-11-23 02:23:18,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __main [2018-11-23 02:23:18,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 02:23:18,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 02:23:18,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 02:23:18,391 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2018-11-23 02:23:18,391 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2018-11-23 02:23:18,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 02:23:18,391 INFO L130 BoogieDeclarations]: Found specification of procedure single_argv [2018-11-23 02:23:18,392 INFO L138 BoogieDeclarations]: Found implementation of procedure single_argv [2018-11-23 02:23:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2018-11-23 02:23:18,392 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2018-11-23 02:23:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure dirname [2018-11-23 02:23:18,392 INFO L138 BoogieDeclarations]: Found implementation of procedure dirname [2018-11-23 02:23:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 02:23:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 02:23:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 02:23:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-11-23 02:23:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2018-11-23 02:23:18,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 02:23:18,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 02:23:18,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 02:23:18,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-23 02:23:18,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 02:23:18,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 02:23:19,009 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 02:23:19,010 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 02:23:19,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:23:19 BoogieIcfgContainer [2018-11-23 02:23:19,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 02:23:19,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 02:23:19,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 02:23:19,014 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 02:23:19,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:23:17" (1/3) ... [2018-11-23 02:23:19,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729cb1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:23:19, skipping insertion in model container [2018-11-23 02:23:19,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:23:18" (2/3) ... [2018-11-23 02:23:19,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729cb1a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:23:19, skipping insertion in model container [2018-11-23 02:23:19,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:23:19" (3/3) ... [2018-11-23 02:23:19,017 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname_true-no-overflow_true-valid-memsafety.i [2018-11-23 02:23:19,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 02:23:19,031 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2018-11-23 02:23:19,044 INFO L257 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2018-11-23 02:23:19,069 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 02:23:19,069 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 02:23:19,070 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 02:23:19,070 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 02:23:19,070 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 02:23:19,070 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 02:23:19,070 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 02:23:19,070 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 02:23:19,086 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2018-11-23 02:23:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 02:23:19,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:19,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:23:19,093 INFO L423 AbstractCegarLoop]: === Iteration 1 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:19,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:19,098 INFO L82 PathProgramCache]: Analyzing trace with hash -484679774, now seen corresponding path program 1 times [2018-11-23 02:23:19,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:19,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:19,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:19,354 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-23 02:23:19,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:19,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:19,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:19,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:19,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:19,373 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 3 states. [2018-11-23 02:23:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:19,417 INFO L93 Difference]: Finished difference Result 226 states and 277 transitions. [2018-11-23 02:23:19,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:19,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 02:23:19,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:19,426 INFO L225 Difference]: With dead ends: 226 [2018-11-23 02:23:19,426 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 02:23:19,428 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-23 02:23:19,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 02:23:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-23 02:23:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 02:23:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2018-11-23 02:23:19,459 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 8 [2018-11-23 02:23:19,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:19,459 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2018-11-23 02:23:19,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2018-11-23 02:23:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 02:23:19,460 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:19,460 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:23:19,461 INFO L423 AbstractCegarLoop]: === Iteration 2 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:19,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:19,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2140170941, now seen corresponding path program 1 times [2018-11-23 02:23:19,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:19,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:19,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:19,531 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-23 02:23:19,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:19,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:19,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:19,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:19,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:19,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:19,533 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand 3 states. [2018-11-23 02:23:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:19,556 INFO L93 Difference]: Finished difference Result 116 states and 134 transitions. [2018-11-23 02:23:19,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:19,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 02:23:19,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:19,558 INFO L225 Difference]: With dead ends: 116 [2018-11-23 02:23:19,559 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 02:23:19,559 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-23 02:23:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 02:23:19,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-23 02:23:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-23 02:23:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2018-11-23 02:23:19,568 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 9 [2018-11-23 02:23:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:19,568 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2018-11-23 02:23:19,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2018-11-23 02:23:19,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 02:23:19,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:19,569 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:23:19,570 INFO L423 AbstractCegarLoop]: === Iteration 3 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:19,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:19,570 INFO L82 PathProgramCache]: Analyzing trace with hash 957163037, now seen corresponding path program 1 times [2018-11-23 02:23:19,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:19,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:19,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:19,640 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-23 02:23:19,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:19,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:19,643 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:19,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:19,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:19,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:19,644 INFO L87 Difference]: Start difference. First operand 115 states and 133 transitions. Second operand 3 states. [2018-11-23 02:23:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:19,687 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2018-11-23 02:23:19,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:19,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 02:23:19,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:19,688 INFO L225 Difference]: With dead ends: 115 [2018-11-23 02:23:19,689 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 02:23:19,689 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-23 02:23:19,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 02:23:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-11-23 02:23:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 02:23:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2018-11-23 02:23:19,697 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 12 [2018-11-23 02:23:19,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:19,697 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2018-11-23 02:23:19,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2018-11-23 02:23:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 02:23:19,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:19,698 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:23:19,699 INFO L423 AbstractCegarLoop]: === Iteration 4 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:19,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash 957164767, now seen corresponding path program 1 times [2018-11-23 02:23:19,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:19,776 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-23 02:23:19,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:19,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:19,776 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:19,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:19,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:19,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:19,777 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 3 states. [2018-11-23 02:23:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:19,803 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2018-11-23 02:23:19,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:19,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-11-23 02:23:19,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:19,805 INFO L225 Difference]: With dead ends: 111 [2018-11-23 02:23:19,805 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 02:23:19,805 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-23 02:23:19,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 02:23:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-11-23 02:23:19,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-23 02:23:19,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2018-11-23 02:23:19,811 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 12 [2018-11-23 02:23:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:19,812 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2018-11-23 02:23:19,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:19,812 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2018-11-23 02:23:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 02:23:19,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:19,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:23:19,813 INFO L423 AbstractCegarLoop]: === Iteration 5 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:19,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash -392716752, now seen corresponding path program 1 times [2018-11-23 02:23:19,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:19,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:19,861 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-23 02:23:19,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:19,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:19,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:19,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:19,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:19,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:19,863 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 3 states. [2018-11-23 02:23:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:19,895 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2018-11-23 02:23:19,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:19,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 02:23:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:19,896 INFO L225 Difference]: With dead ends: 108 [2018-11-23 02:23:19,897 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 02:23:19,897 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-23 02:23:19,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 02:23:19,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-11-23 02:23:19,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 02:23:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-11-23 02:23:19,903 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 13 [2018-11-23 02:23:19,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:19,903 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-11-23 02:23:19,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:19,903 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-11-23 02:23:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 02:23:19,904 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:19,904 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 02:23:19,904 INFO L423 AbstractCegarLoop]: === Iteration 6 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:19,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:19,905 INFO L82 PathProgramCache]: Analyzing trace with hash 556328978, now seen corresponding path program 1 times [2018-11-23 02:23:19,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:19,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:19,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:19,960 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-23 02:23:19,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:19,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:19,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:19,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:19,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:19,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:19,962 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 3 states. [2018-11-23 02:23:19,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:19,994 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2018-11-23 02:23:19,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:19,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 02:23:19,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:19,995 INFO L225 Difference]: With dead ends: 106 [2018-11-23 02:23:19,995 INFO L226 Difference]: Without dead ends: 104 [2018-11-23 02:23:19,996 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-23 02:23:19,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-11-23 02:23:20,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-11-23 02:23:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 02:23:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 122 transitions. [2018-11-23 02:23:20,001 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 122 transitions. Word has length 15 [2018-11-23 02:23:20,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:20,001 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 122 transitions. [2018-11-23 02:23:20,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 122 transitions. [2018-11-23 02:23:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 02:23:20,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:20,002 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-23 02:23:20,003 INFO L423 AbstractCegarLoop]: === Iteration 7 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:20,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:20,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1553574359, now seen corresponding path program 1 times [2018-11-23 02:23:20,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:20,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:20,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:20,059 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-23 02:23:20,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:20,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:23:20,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:20,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:20,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:20,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:20,061 INFO L87 Difference]: Start difference. First operand 104 states and 122 transitions. Second operand 3 states. [2018-11-23 02:23:20,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:20,087 INFO L93 Difference]: Finished difference Result 192 states and 230 transitions. [2018-11-23 02:23:20,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:20,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 02:23:20,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:20,088 INFO L225 Difference]: With dead ends: 192 [2018-11-23 02:23:20,088 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 02:23:20,089 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-23 02:23:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 02:23:20,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-11-23 02:23:20,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-23 02:23:20,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2018-11-23 02:23:20,094 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 22 [2018-11-23 02:23:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:20,094 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2018-11-23 02:23:20,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2018-11-23 02:23:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:23:20,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:20,095 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-23 02:23:20,096 INFO L423 AbstractCegarLoop]: === Iteration 8 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:20,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:20,096 INFO L82 PathProgramCache]: Analyzing trace with hash -32009876, now seen corresponding path program 1 times [2018-11-23 02:23:20,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:20,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:20,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:20,229 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-23 02:23:20,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:20,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 02:23:20,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:20,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:23:20,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:23:20,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 02:23:20,230 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 4 states. [2018-11-23 02:23:20,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:20,288 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-11-23 02:23:20,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:23:20,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 02:23:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:20,291 INFO L225 Difference]: With dead ends: 115 [2018-11-23 02:23:20,291 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 02:23:20,292 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-23 02:23:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 02:23:20,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2018-11-23 02:23:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 02:23:20,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-11-23 02:23:20,300 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 25 [2018-11-23 02:23:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:20,301 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-11-23 02:23:20,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:23:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-11-23 02:23:20,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 02:23:20,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:20,301 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-23 02:23:20,302 INFO L423 AbstractCegarLoop]: === Iteration 9 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:20,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:20,302 INFO L82 PathProgramCache]: Analyzing trace with hash -32009821, now seen corresponding path program 1 times [2018-11-23 02:23:20,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:20,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,307 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:20,371 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-23 02:23:20,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:20,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:20,372 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:20,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:20,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:20,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:20,372 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 3 states. [2018-11-23 02:23:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:20,388 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2018-11-23 02:23:20,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:20,389 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 02:23:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:20,390 INFO L225 Difference]: With dead ends: 106 [2018-11-23 02:23:20,390 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 02:23:20,390 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-23 02:23:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 02:23:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-23 02:23:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 02:23:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2018-11-23 02:23:20,394 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 25 [2018-11-23 02:23:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:20,397 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2018-11-23 02:23:20,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2018-11-23 02:23:20,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:23:20,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:20,398 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] [2018-11-23 02:23:20,399 INFO L423 AbstractCegarLoop]: === Iteration 10 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:20,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:20,399 INFO L82 PathProgramCache]: Analyzing trace with hash -992305943, now seen corresponding path program 1 times [2018-11-23 02:23:20,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:20,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:20,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,401 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:20,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:20,471 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-23 02:23:20,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:20,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:20,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:20,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:20,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:20,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:20,472 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand 3 states. [2018-11-23 02:23:20,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:20,498 INFO L93 Difference]: Finished difference Result 123 states and 144 transitions. [2018-11-23 02:23:20,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:20,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 02:23:20,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:20,500 INFO L225 Difference]: With dead ends: 123 [2018-11-23 02:23:20,500 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 02:23:20,501 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-23 02:23:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 02:23:20,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2018-11-23 02:23:20,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 02:23:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 135 transitions. [2018-11-23 02:23:20,506 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 135 transitions. Word has length 26 [2018-11-23 02:23:20,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:20,507 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 135 transitions. [2018-11-23 02:23:20,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 135 transitions. [2018-11-23 02:23:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 02:23:20,507 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:20,508 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-23 02:23:20,508 INFO L423 AbstractCegarLoop]: === Iteration 11 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:20,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash -992304245, now seen corresponding path program 1 times [2018-11-23 02:23:20,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:20,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:20,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:20,567 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-23 02:23:20,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:20,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:20,568 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:20,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:20,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:20,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:20,568 INFO L87 Difference]: Start difference. First operand 114 states and 135 transitions. Second operand 3 states. [2018-11-23 02:23:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:20,585 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2018-11-23 02:23:20,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:20,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 02:23:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:20,586 INFO L225 Difference]: With dead ends: 121 [2018-11-23 02:23:20,586 INFO L226 Difference]: Without dead ends: 120 [2018-11-23 02:23:20,587 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-23 02:23:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-11-23 02:23:20,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 109. [2018-11-23 02:23:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 02:23:20,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 129 transitions. [2018-11-23 02:23:20,591 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 129 transitions. Word has length 26 [2018-11-23 02:23:20,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:20,591 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 129 transitions. [2018-11-23 02:23:20,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:20,591 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 129 transitions. [2018-11-23 02:23:20,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 02:23:20,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:20,592 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, 1] [2018-11-23 02:23:20,593 INFO L423 AbstractCegarLoop]: === Iteration 12 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:20,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:20,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1525307751, now seen corresponding path program 1 times [2018-11-23 02:23:20,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:20,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:20,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:20,646 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-23 02:23:20,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:20,646 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:20,647 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-23 02:23:20,648 INFO L202 CegarAbsIntRunner]: [3], [6], [11], [24], [28], [29], [122], [128], [130], [133], [135], [139], [141], [143], [145], [147], [149], [151], [153], [155], [161], [226], [227], [228], [241], [243], [249], [250], [251] [2018-11-23 02:23:20,678 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:23:20,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:23:20,909 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-23 02:23:20,911 INFO L272 AbstractInterpreter]: Visited 28 different actions 36 times. Merged at 3 different actions 6 times. Never widened. Performed 1387 root evaluator evaluations with a maximum evaluation depth of 9. Performed 1387 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 1 fixpoints after 1 different actions. Largest state had 81 variables. [2018-11-23 02:23:20,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:20,916 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-23 02:23:21,018 INFO L227 lantSequenceWeakener]: Weakened 26 states. On average, predicates are now at 86.34% of their original sizes. [2018-11-23 02:23:21,019 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-23 02:23:21,088 INFO L415 sIntCurrentIteration]: We unified 28 AI predicates to 28 [2018-11-23 02:23:21,088 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-23 02:23:21,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:23:21,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2018-11-23 02:23:21,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:21,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 02:23:21,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 02:23:21,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-23 02:23:21,090 INFO L87 Difference]: Start difference. First operand 109 states and 129 transitions. Second operand 12 states. [2018-11-23 02:23:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:22,257 INFO L93 Difference]: Finished difference Result 193 states and 232 transitions. [2018-11-23 02:23:22,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:23:22,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-11-23 02:23:22,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:22,259 INFO L225 Difference]: With dead ends: 193 [2018-11-23 02:23:22,259 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 02:23:22,259 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-11-23 02:23:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 02:23:22,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2018-11-23 02:23:22,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 02:23:22,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2018-11-23 02:23:22,265 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 29 [2018-11-23 02:23:22,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:22,265 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2018-11-23 02:23:22,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 02:23:22,266 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2018-11-23 02:23:22,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 02:23:22,266 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:22,266 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, 1, 1] [2018-11-23 02:23:22,267 INFO L423 AbstractCegarLoop]: === Iteration 13 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:22,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:22,267 INFO L82 PathProgramCache]: Analyzing trace with hash 41501049, now seen corresponding path program 1 times [2018-11-23 02:23:22,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:22,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:22,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:22,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:22,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:22,321 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-23 02:23:22,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:22,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:22,321 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-11-23 02:23:22,322 INFO L202 CegarAbsIntRunner]: [3], [6], [13], [16], [20], [28], [29], [122], [128], [130], [133], [135], [139], [141], [143], [145], [147], [149], [151], [153], [155], [161], [226], [227], [228], [241], [243], [249], [250], [251] [2018-11-23 02:23:22,324 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:23:22,324 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:23:22,445 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:23:22,445 INFO L272 AbstractInterpreter]: Visited 30 different actions 66 times. Merged at 14 different actions 23 times. Widened at 1 different actions 1 times. Performed 1856 root evaluator evaluations with a maximum evaluation depth of 10. Performed 1856 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 2 fixpoints after 2 different actions. Largest state had 83 variables. [2018-11-23 02:23:22,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:22,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:23:22,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:22,464 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:22,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:22,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:23:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:22,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:22,634 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-23 02:23:22,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:22,655 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-23 02:23:22,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:22,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 02:23:22,681 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:22,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:23:22,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:23:22,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:23:22,683 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand 5 states. [2018-11-23 02:23:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:22,717 INFO L93 Difference]: Finished difference Result 215 states and 255 transitions. [2018-11-23 02:23:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:23:22,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-23 02:23:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:22,718 INFO L225 Difference]: With dead ends: 215 [2018-11-23 02:23:22,718 INFO L226 Difference]: Without dead ends: 115 [2018-11-23 02:23:22,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 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-23 02:23:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-23 02:23:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-11-23 02:23:22,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 02:23:22,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 133 transitions. [2018-11-23 02:23:22,725 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 133 transitions. Word has length 30 [2018-11-23 02:23:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:22,725 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 133 transitions. [2018-11-23 02:23:22,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:23:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 133 transitions. [2018-11-23 02:23:22,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 02:23:22,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:22,726 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] [2018-11-23 02:23:22,726 INFO L423 AbstractCegarLoop]: === Iteration 14 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:22,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:22,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1735539875, now seen corresponding path program 2 times [2018-11-23 02:23:22,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:22,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:22,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:22,780 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-23 02:23:22,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:22,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:22,781 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:22,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:22,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:22,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:22,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:23:22,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:23:22,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-11-23 02:23:22,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:23:22,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:22,952 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-23 02:23:22,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:22,971 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-23 02:23:22,997 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-23 02:23:22,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 9 [2018-11-23 02:23:22,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:22,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 02:23:22,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 02:23:22,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:23:22,998 INFO L87 Difference]: Start difference. First operand 113 states and 133 transitions. Second operand 4 states. [2018-11-23 02:23:23,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:23,036 INFO L93 Difference]: Finished difference Result 189 states and 224 transitions. [2018-11-23 02:23:23,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:23:23,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 02:23:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:23,037 INFO L225 Difference]: With dead ends: 189 [2018-11-23 02:23:23,037 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 02:23:23,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 63 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-23 02:23:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 02:23:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-11-23 02:23:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-23 02:23:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2018-11-23 02:23:23,041 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 33 [2018-11-23 02:23:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:23,042 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2018-11-23 02:23:23,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 02:23:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2018-11-23 02:23:23,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 02:23:23,042 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:23,042 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-23 02:23:23,043 INFO L423 AbstractCegarLoop]: === Iteration 15 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:23,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:23,043 INFO L82 PathProgramCache]: Analyzing trace with hash -170695662, now seen corresponding path program 1 times [2018-11-23 02:23:23,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:23,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:23,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:23:23,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:23,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:23,117 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-23 02:23:23,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 02:23:23,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 02:23:23,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 02:23:23,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 02:23:23,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 02:23:23,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 02:23:23,118 INFO L87 Difference]: Start difference. First operand 113 states and 132 transitions. Second operand 3 states. [2018-11-23 02:23:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:23,143 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2018-11-23 02:23:23,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 02:23:23,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-11-23 02:23:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:23,145 INFO L225 Difference]: With dead ends: 113 [2018-11-23 02:23:23,145 INFO L226 Difference]: Without dead ends: 112 [2018-11-23 02:23:23,145 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-23 02:23:23,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-23 02:23:23,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2018-11-23 02:23:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 02:23:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 124 transitions. [2018-11-23 02:23:23,150 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 124 transitions. Word has length 36 [2018-11-23 02:23:23,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:23,150 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 124 transitions. [2018-11-23 02:23:23,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 02:23:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 124 transitions. [2018-11-23 02:23:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 02:23:23,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:23,151 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, 1, 1] [2018-11-23 02:23:23,151 INFO L423 AbstractCegarLoop]: === Iteration 16 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:23,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash -302494686, now seen corresponding path program 1 times [2018-11-23 02:23:23,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:23,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:23,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:23,219 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-23 02:23:23,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:23,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:23,220 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-23 02:23:23,220 INFO L202 CegarAbsIntRunner]: [3], [6], [13], [16], [20], [28], [29], [122], [128], [130], [133], [135], [139], [141], [143], [145], [147], [149], [151], [153], [155], [161], [163], [169], [171], [174], [176], [181], [183], [226], [227], [228], [241], [243], [249], [250], [251] [2018-11-23 02:23:23,222 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 02:23:23,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 02:23:23,385 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 02:23:23,385 INFO L272 AbstractInterpreter]: Visited 37 different actions 91 times. Merged at 11 different actions 27 times. Widened at 1 different actions 1 times. Performed 2205 root evaluator evaluations with a maximum evaluation depth of 10. Performed 2205 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 6 fixpoints after 5 different actions. Largest state had 93 variables. [2018-11-23 02:23:23,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:23,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 02:23:23,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:23,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:23,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:23,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:23:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:23,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:23,571 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-23 02:23:23,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:23,635 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-23 02:23:23,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:23,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 02:23:23,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:23,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 02:23:23,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 02:23:23,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:23:23,660 INFO L87 Difference]: Start difference. First operand 106 states and 124 transitions. Second operand 6 states. [2018-11-23 02:23:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:23,688 INFO L93 Difference]: Finished difference Result 204 states and 240 transitions. [2018-11-23 02:23:23,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 02:23:23,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-23 02:23:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:23,690 INFO L225 Difference]: With dead ends: 204 [2018-11-23 02:23:23,690 INFO L226 Difference]: Without dead ends: 111 [2018-11-23 02:23:23,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 02:23:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-11-23 02:23:23,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-11-23 02:23:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 02:23:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 127 transitions. [2018-11-23 02:23:23,696 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 127 transitions. Word has length 40 [2018-11-23 02:23:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:23,696 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 127 transitions. [2018-11-23 02:23:23,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 02:23:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 127 transitions. [2018-11-23 02:23:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 02:23:23,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:23,697 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, 1, 1] [2018-11-23 02:23:23,697 INFO L423 AbstractCegarLoop]: === Iteration 17 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:23,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:23,697 INFO L82 PathProgramCache]: Analyzing trace with hash -724647674, now seen corresponding path program 2 times [2018-11-23 02:23:23,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:23,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:23,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:23,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:23,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:23,755 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-23 02:23:23,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:23,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:23,755 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:23,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:23,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:23,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:23,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:23:23,794 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:23:23,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 02:23:23,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:23:23,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:23,966 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-23 02:23:23,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:23,993 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-23 02:23:24,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:24,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 02:23:24,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:24,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 02:23:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 02:23:24,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 02:23:24,010 INFO L87 Difference]: Start difference. First operand 109 states and 127 transitions. Second operand 5 states. [2018-11-23 02:23:24,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:24,030 INFO L93 Difference]: Finished difference Result 197 states and 233 transitions. [2018-11-23 02:23:24,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 02:23:24,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-11-23 02:23:24,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:24,033 INFO L225 Difference]: With dead ends: 197 [2018-11-23 02:23:24,033 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 02:23:24,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 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-23 02:23:24,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 02:23:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-11-23 02:23:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-23 02:23:24,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2018-11-23 02:23:24,037 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 43 [2018-11-23 02:23:24,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:24,037 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2018-11-23 02:23:24,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 02:23:24,038 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2018-11-23 02:23:24,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 02:23:24,038 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:24,038 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, 1, 1] [2018-11-23 02:23:24,038 INFO L423 AbstractCegarLoop]: === Iteration 18 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:24,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash 29652945, now seen corresponding path program 3 times [2018-11-23 02:23:24,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:24,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:24,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:23:24,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:24,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:24,094 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-23 02:23:24,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:24,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:24,095 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:24,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:24,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:24,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:24,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:23:24,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:23:24,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:23:24,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:23:24,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:24,243 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-23 02:23:24,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:24,269 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-23 02:23:24,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:24,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2018-11-23 02:23:24,285 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:24,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:23:24,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:23:24,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:23:24,286 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand 9 states. [2018-11-23 02:23:24,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:24,321 INFO L93 Difference]: Finished difference Result 218 states and 255 transitions. [2018-11-23 02:23:24,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 02:23:24,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 46 [2018-11-23 02:23:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:24,323 INFO L225 Difference]: With dead ends: 218 [2018-11-23 02:23:24,323 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 02:23:24,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:23:24,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 02:23:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2018-11-23 02:23:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 02:23:24,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 136 transitions. [2018-11-23 02:23:24,330 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 136 transitions. Word has length 46 [2018-11-23 02:23:24,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:24,332 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 136 transitions. [2018-11-23 02:23:24,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:23:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 136 transitions. [2018-11-23 02:23:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 02:23:24,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:24,332 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, 1, 1] [2018-11-23 02:23:24,333 INFO L423 AbstractCegarLoop]: === Iteration 19 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:24,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1247548610, now seen corresponding path program 4 times [2018-11-23 02:23:24,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:24,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:23:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:24,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:24,394 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-23 02:23:24,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:24,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:24,394 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:24,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:24,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:24,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:24,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:24,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:23:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:24,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:24,537 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-23 02:23:24,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:24,585 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-23 02:23:24,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:24,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2018-11-23 02:23:24,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:24,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 02:23:24,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 02:23:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-23 02:23:24,601 INFO L87 Difference]: Start difference. First operand 118 states and 136 transitions. Second operand 11 states. [2018-11-23 02:23:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:24,642 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2018-11-23 02:23:24,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 02:23:24,645 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2018-11-23 02:23:24,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:24,645 INFO L225 Difference]: With dead ends: 227 [2018-11-23 02:23:24,646 INFO L226 Difference]: Without dead ends: 128 [2018-11-23 02:23:24,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-11-23 02:23:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-11-23 02:23:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2018-11-23 02:23:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 02:23:24,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 142 transitions. [2018-11-23 02:23:24,653 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 142 transitions. Word has length 52 [2018-11-23 02:23:24,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:24,653 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 142 transitions. [2018-11-23 02:23:24,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 02:23:24,653 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 142 transitions. [2018-11-23 02:23:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 02:23:24,654 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:24,654 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, 1, 1] [2018-11-23 02:23:24,654 INFO L423 AbstractCegarLoop]: === Iteration 20 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:24,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:24,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2080661809, now seen corresponding path program 5 times [2018-11-23 02:23:24,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:24,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:24,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:24,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:24,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:24,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:24,743 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-23 02:23:24,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:24,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:24,743 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:24,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:24,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:24,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:24,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:23:24,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:23:25,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 02:23:25,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:23:25,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:25,983 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-23 02:23:25,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:26,011 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-23 02:23:26,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:26,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 02:23:26,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:26,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 02:23:26,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 02:23:26,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:23:26,029 INFO L87 Difference]: Start difference. First operand 124 states and 142 transitions. Second operand 8 states. [2018-11-23 02:23:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:26,052 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2018-11-23 02:23:26,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 02:23:26,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-11-23 02:23:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:26,053 INFO L225 Difference]: With dead ends: 221 [2018-11-23 02:23:26,053 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 02:23:26,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 111 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-23 02:23:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 02:23:26,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-11-23 02:23:26,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-23 02:23:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2018-11-23 02:23:26,059 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 58 [2018-11-23 02:23:26,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:26,059 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2018-11-23 02:23:26,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 02:23:26,059 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2018-11-23 02:23:26,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 02:23:26,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:26,060 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, 1, 1] [2018-11-23 02:23:26,060 INFO L423 AbstractCegarLoop]: === Iteration 21 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:26,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1530815430, now seen corresponding path program 6 times [2018-11-23 02:23:26,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:26,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:26,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:23:26,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:26,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:26,122 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-23 02:23:26,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:26,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:26,122 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:26,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:26,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:26,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:26,131 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:23:26,131 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:23:26,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:23:26,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:23:26,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:26,264 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-23 02:23:26,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:26,302 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-23 02:23:26,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:26,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2018-11-23 02:23:26,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:26,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 02:23:26,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 02:23:26,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:23:26,319 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand 9 states. [2018-11-23 02:23:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:26,344 INFO L93 Difference]: Finished difference Result 237 states and 273 transitions. [2018-11-23 02:23:26,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 02:23:26,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-11-23 02:23:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:26,345 INFO L225 Difference]: With dead ends: 237 [2018-11-23 02:23:26,345 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 02:23:26,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:23:26,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 02:23:26,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-11-23 02:23:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 02:23:26,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2018-11-23 02:23:26,350 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 61 [2018-11-23 02:23:26,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:26,350 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2018-11-23 02:23:26,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 02:23:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2018-11-23 02:23:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 02:23:26,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:26,351 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, 1, 1] [2018-11-23 02:23:26,351 INFO L423 AbstractCegarLoop]: === Iteration 22 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:26,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1647139486, now seen corresponding path program 7 times [2018-11-23 02:23:26,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:26,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:26,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:23:26,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:26,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:26,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:26,440 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-23 02:23:26,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:26,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:26,440 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:26,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:26,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:26,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:26,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:26,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:23:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:26,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:26,614 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-23 02:23:26,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:26,665 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-23 02:23:26,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:26,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2018-11-23 02:23:26,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:26,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 02:23:26,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 02:23:26,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:23:26,681 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand 15 states. [2018-11-23 02:23:26,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:26,767 INFO L93 Difference]: Finished difference Result 245 states and 282 transitions. [2018-11-23 02:23:26,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 02:23:26,768 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 64 [2018-11-23 02:23:26,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:26,768 INFO L225 Difference]: With dead ends: 245 [2018-11-23 02:23:26,768 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 02:23:26,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2018-11-23 02:23:26,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 02:23:26,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 136. [2018-11-23 02:23:26,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 02:23:26,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 154 transitions. [2018-11-23 02:23:26,774 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 154 transitions. Word has length 64 [2018-11-23 02:23:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:26,774 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 154 transitions. [2018-11-23 02:23:26,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 02:23:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 154 transitions. [2018-11-23 02:23:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 02:23:26,775 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:26,775 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, 1, 1] [2018-11-23 02:23:26,775 INFO L423 AbstractCegarLoop]: === Iteration 23 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:26,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash 312181393, now seen corresponding path program 8 times [2018-11-23 02:23:26,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:26,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:26,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:26,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:26,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:26,839 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-23 02:23:26,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:26,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:26,839 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:26,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:26,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:26,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:26,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:23:26,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:23:29,133 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-23 02:23:29,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:23:29,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:29,183 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-23 02:23:29,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:29,238 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-23 02:23:29,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:29,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2018-11-23 02:23:29,257 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:29,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 02:23:29,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 02:23:29,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:23:29,257 INFO L87 Difference]: Start difference. First operand 136 states and 154 transitions. Second operand 17 states. [2018-11-23 02:23:29,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:29,311 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2018-11-23 02:23:29,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 02:23:29,314 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-11-23 02:23:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:29,314 INFO L225 Difference]: With dead ends: 254 [2018-11-23 02:23:29,314 INFO L226 Difference]: Without dead ends: 146 [2018-11-23 02:23:29,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:23:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-23 02:23:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2018-11-23 02:23:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 02:23:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-11-23 02:23:29,320 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 70 [2018-11-23 02:23:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:29,320 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-11-23 02:23:29,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 02:23:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-11-23 02:23:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-23 02:23:29,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:29,321 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, 1, 1] [2018-11-23 02:23:29,321 INFO L423 AbstractCegarLoop]: === Iteration 24 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:29,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:29,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1501953538, now seen corresponding path program 9 times [2018-11-23 02:23:29,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:29,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:29,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:23:29,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:29,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:29,415 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-23 02:23:29,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:29,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:29,415 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:29,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:29,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:29,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:29,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:23:29,431 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:23:29,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:23:29,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:23:29,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:29,617 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-23 02:23:29,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:29,674 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-23 02:23:29,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:29,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20 [2018-11-23 02:23:29,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:29,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 02:23:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 02:23:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:23:29,690 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 19 states. [2018-11-23 02:23:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:29,760 INFO L93 Difference]: Finished difference Result 263 states and 300 transitions. [2018-11-23 02:23:29,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 02:23:29,760 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 76 [2018-11-23 02:23:29,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:29,761 INFO L225 Difference]: With dead ends: 263 [2018-11-23 02:23:29,761 INFO L226 Difference]: Without dead ends: 152 [2018-11-23 02:23:29,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 135 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2018-11-23 02:23:29,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-23 02:23:29,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2018-11-23 02:23:29,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-23 02:23:29,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 166 transitions. [2018-11-23 02:23:29,769 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 166 transitions. Word has length 76 [2018-11-23 02:23:29,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:29,769 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 166 transitions. [2018-11-23 02:23:29,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 02:23:29,769 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 166 transitions. [2018-11-23 02:23:29,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 02:23:29,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:29,770 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, 1, 1] [2018-11-23 02:23:29,770 INFO L423 AbstractCegarLoop]: === Iteration 25 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:29,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:29,770 INFO L82 PathProgramCache]: Analyzing trace with hash 631233521, now seen corresponding path program 10 times [2018-11-23 02:23:29,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:29,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:23:29,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:29,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:29,846 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-23 02:23:29,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:29,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:29,846 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:29,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:29,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:29,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:29,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:29,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 02:23:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:29,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:30,045 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-23 02:23:30,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:30,135 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-23 02:23:30,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:30,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 21 [2018-11-23 02:23:30,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:30,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 02:23:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 02:23:30,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-11-23 02:23:30,151 INFO L87 Difference]: Start difference. First operand 148 states and 166 transitions. Second operand 21 states. [2018-11-23 02:23:30,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:30,250 INFO L93 Difference]: Finished difference Result 270 states and 307 transitions. [2018-11-23 02:23:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 02:23:30,251 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-11-23 02:23:30,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:30,252 INFO L225 Difference]: With dead ends: 270 [2018-11-23 02:23:30,252 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 02:23:30,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 145 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-11-23 02:23:30,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 02:23:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-11-23 02:23:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 02:23:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 172 transitions. [2018-11-23 02:23:30,260 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 172 transitions. Word has length 82 [2018-11-23 02:23:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:30,260 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 172 transitions. [2018-11-23 02:23:30,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 02:23:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 172 transitions. [2018-11-23 02:23:30,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-23 02:23:30,261 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:30,261 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, 1, 1] [2018-11-23 02:23:30,261 INFO L423 AbstractCegarLoop]: === Iteration 26 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:30,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:30,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1461722786, now seen corresponding path program 11 times [2018-11-23 02:23:30,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:30,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:30,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 02:23:30,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:30,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:30,371 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-23 02:23:30,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:30,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:30,372 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:30,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:30,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:30,372 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:30,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 02:23:30,380 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 02:23:44,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 02:23:44,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:23:44,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:45,004 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-23 02:23:45,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:45,046 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-23 02:23:45,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 02:23:45,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 13 [2018-11-23 02:23:45,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 02:23:45,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 02:23:45,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 02:23:45,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 02:23:45,066 INFO L87 Difference]: Start difference. First operand 154 states and 172 transitions. Second operand 13 states. [2018-11-23 02:23:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 02:23:45,107 INFO L93 Difference]: Finished difference Result 264 states and 300 transitions. [2018-11-23 02:23:45,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 02:23:45,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 88 [2018-11-23 02:23:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 02:23:45,109 INFO L225 Difference]: With dead ends: 264 [2018-11-23 02:23:45,109 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 02:23:45,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 166 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-23 02:23:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 02:23:45,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-11-23 02:23:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-23 02:23:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 175 transitions. [2018-11-23 02:23:45,118 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 175 transitions. Word has length 88 [2018-11-23 02:23:45,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 02:23:45,119 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 175 transitions. [2018-11-23 02:23:45,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 02:23:45,119 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 175 transitions. [2018-11-23 02:23:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-11-23 02:23:45,119 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 02:23:45,119 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, 1, 1] [2018-11-23 02:23:45,120 INFO L423 AbstractCegarLoop]: === Iteration 27 === [single_argvErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, single_argvErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, dirnameErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 02:23:45,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 02:23:45,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1012982965, now seen corresponding path program 12 times [2018-11-23 02:23:45,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 02:23:45,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:45,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 02:23:45,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 02:23:45,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 02:23:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 02:23:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2018-11-23 02:23:46,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:46,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 02:23:46,828 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 02:23:46,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 02:23:46,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 02:23:46,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c3b23220-f296-47bc-aa04-25570e1896df/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-23 02:23:46,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 02:23:46,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 02:23:46,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 02:23:46,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 02:23:46,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 02:23:46,985 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-23 02:23:46,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:46,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:46,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 02:23:47,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:23:47,019 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:23:47,020 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-23 02:23:47,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,033 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-23 02:23:47,035 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-23 02:23:47,035 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,067 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-23 02:23:47,071 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-23 02:23:47,071 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,073 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,082 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-23 02:23:47,082 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:56, output treesize:46 [2018-11-23 02:23:47,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:23:47,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:23:47,134 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:23:47,135 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-23 02:23:47,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,177 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 452 [2018-11-23 02:23:47,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:23:47,235 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-23 02:23:47,236 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,259 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 178 treesize of output 170 [2018-11-23 02:23:47,262 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-23 02:23:47,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,285 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 165 treesize of output 174 [2018-11-23 02:23:47,287 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 112 treesize of output 111 [2018-11-23 02:23:47,288 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,307 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-23 02:23:47,315 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-23 02:23:47,337 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 191 treesize of output 105 [2018-11-23 02:23:47,358 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:23:47,359 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-23 02:23:47,360 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,371 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 66 treesize of output 58 [2018-11-23 02:23:47,373 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-23 02:23:47,373 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,402 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 53 treesize of output 70 [2018-11-23 02:23:47,405 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-23 02:23:47,405 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,416 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,423 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-23 02:23:47,427 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-23 02:23:47,441 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-23 02:23:47,442 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:673, output treesize:98 [2018-11-23 02:23:47,509 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-23 02:23:47,512 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-23 02:23:47,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,553 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-23 02:23:47,556 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-23 02:23:47,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,576 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-23 02:23:47,577 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:47,591 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-23 02:23:47,593 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-23 02:23:47,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,631 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-23 02:23:47,634 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-23 02:23:47,634 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,643 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,656 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-23 02:23:47,657 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:47,670 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-23 02:23:47,673 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-23 02:23:47,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,709 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-23 02:23:47,711 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-23 02:23:47,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,733 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-23 02:23:47,733 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:47,746 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-23 02:23:47,748 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-23 02:23:47,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,757 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,781 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-23 02:23:47,786 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-23 02:23:47,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,797 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,813 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-23 02:23:47,813 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:47,825 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-23 02:23:47,827 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-23 02:23:47,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,858 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-23 02:23:47,860 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-23 02:23:47,860 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,866 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,878 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-23 02:23:47,878 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:47,897 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-23 02:23:47,902 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-23 02:23:47,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,939 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-23 02:23:47,942 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-23 02:23:47,942 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,950 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,965 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-23 02:23:47,965 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:47,980 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-23 02:23:47,982 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-23 02:23:47,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:47,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,025 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-23 02:23:48,029 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-23 02:23:48,029 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,054 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-23 02:23:48,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:48,068 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-23 02:23:48,070 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-23 02:23:48,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,103 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-23 02:23:48,105 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-23 02:23:48,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,126 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-23 02:23:48,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:48,137 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-23 02:23:48,139 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-23 02:23:48,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,171 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-23 02:23:48,173 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-23 02:23:48,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,191 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-23 02:23:48,191 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:48,202 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-23 02:23:48,205 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-23 02:23:48,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,234 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-23 02:23:48,236 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-23 02:23:48,236 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,255 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-23 02:23:48,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:216, output treesize:98 [2018-11-23 02:23:48,453 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-23 02:23:48,471 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:23:48,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:23:48,474 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 45 [2018-11-23 02:23:48,474 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,484 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-23 02:23:48,484 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,499 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-23 02:23:48,501 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-23 02:23:48,502 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,509 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:23:48,509 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-23 02:23:48,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,516 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,522 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-23 02:23:48,522 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:121, output treesize:7 [2018-11-23 02:23:48,577 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-23 02:23:48,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 02:23:48,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,819 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-23 02:23:48,831 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-23 02:23:48,848 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,852 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:48,865 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-23 02:23:48,870 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-23 02:23:48,880 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-23 02:23:48,880 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:271, output treesize:99 [2018-11-23 02:23:49,638 WARN L180 SmtUtils]: Spent 707.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 02:23:49,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:49,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:49,714 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-23 02:23:49,724 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-23 02:23:49,725 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-23 02:23:49,739 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-23 02:23:49,740 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:49,750 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:49,930 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-23 02:23:49,945 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-23 02:23:49,948 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-23 02:23:49,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-23 02:23:49,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-23 02:23:49,970 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-23 02:23:50,121 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-23 02:23:50,127 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-23 02:23:50,128 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-23 02:23:50,136 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-23 02:23:50,137 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-23 02:23:50,142 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-23 02:23:50,144 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-23 02:23:50,152 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-23 02:23:50,265 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:23:50,272 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:23:50,273 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-23 02:23:50,283 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-23 02:23:50,284 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-23 02:23:50,290 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-23 02:23:50,429 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-23 02:23:50,429 INFO L202 ElimStorePlain]: Needed 29 recursive calls to eliminate 10 variables, input treesize:339, output treesize:440 [2018-11-23 02:24:04,642 WARN L180 SmtUtils]: Spent 12.11 s on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2018-11-23 02:24:05,011 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2018-11-23 02:24:05,012 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:05,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:05,020 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-23 02:24:05,028 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-23 02:24:05,252 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-23 02:24:05,263 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-23 02:24:05,264 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-23 02:24:05,273 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-23 02:24:05,273 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-23 02:24:05,281 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-23 02:24:05,484 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-23 02:24:05,495 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-23 02:24:05,496 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-23 02:24:05,509 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-23 02:24:05,510 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-23 02:24:05,533 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-23 02:24:05,770 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:05,776 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:05,778 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-23 02:24:05,799 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-23 02:24:05,800 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-23 02:24:05,812 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-23 02:24:06,005 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:06,011 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:06,012 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-23 02:24:06,018 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-23 02:24:06,019 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-23 02:24:06,028 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-23 02:24:06,231 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-23 02:24:06,237 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-23 02:24:06,238 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-23 02:24:06,243 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-23 02:24:06,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 17 dim-0 vars, and 8 xjuncts. [2018-11-23 02:24:06,390 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 15 variables, input treesize:556, output treesize:506 [2018-11-23 02:24:08,912 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2018-11-23 02:24:08,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:08,920 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:08,921 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-23 02:24:08,932 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-23 02:24:08,933 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-23 02:24:08,944 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-23 02:24:08,945 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-23 02:24:08,957 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-23 02:24:09,278 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-23 02:24:09,285 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-23 02:24:09,286 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-23 02:24:09,299 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-23 02:24:09,300 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-23 02:24:09,309 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-23 02:24:09,588 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-23 02:24:09,595 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-23 02:24:09,596 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-23 02:24:09,603 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-23 02:24:09,846 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-23 02:24:09,852 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-23 02:24:09,852 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:09,857 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:10,060 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-23 02:24:10,069 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-23 02:24:10,070 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-23 02:24:10,079 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-23 02:24:10,079 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-23 02:24:10,084 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-23 02:24:10,085 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-23 02:24:10,096 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-23 02:24:10,287 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-23 02:24:10,294 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-23 02:24:10,295 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:10,300 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:10,301 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-23 02:24:10,306 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-23 02:24:10,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-23 02:24:10,501 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 15 variables, input treesize:556, output treesize:555 [2018-11-23 02:24:13,019 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2018-11-23 02:24:13,020 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-23 02:24:13,032 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-23 02:24:13,033 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-23 02:24:13,047 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-23 02:24:13,047 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:13,055 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:13,056 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-23 02:24:13,069 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-23 02:24:13,357 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-23 02:24:13,364 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-23 02:24:13,365 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-23 02:24:13,372 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-23 02:24:13,643 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-23 02:24:13,649 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-23 02:24:13,650 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:13,655 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:13,880 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-23 02:24:13,891 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-23 02:24:13,892 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-23 02:24:13,900 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-23 02:24:13,901 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-23 02:24:13,910 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-23 02:24:13,911 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-23 02:24:13,919 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-23 02:24:14,106 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:14,112 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:14,113 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-23 02:24:14,121 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-23 02:24:14,121 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-23 02:24:14,130 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-23 02:24:14,295 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-23 02:24:14,303 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-23 02:24:14,304 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-23 02:24:14,309 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-23 02:24:14,310 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-23 02:24:14,319 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-23 02:24:14,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-23 02:24:14,519 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 15 variables, input treesize:556, output treesize:555 [2018-11-23 02:24:16,991 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2018-11-23 02:24:16,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:16,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:17,000 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-23 02:24:17,011 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-23 02:24:17,011 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-23 02:24:17,023 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-23 02:24:17,024 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-23 02:24:17,034 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-23 02:24:17,411 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:17,418 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:17,418 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-23 02:24:17,427 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-23 02:24:17,427 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-23 02:24:17,434 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-23 02:24:17,733 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:17,740 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:17,741 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-23 02:24:17,748 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-23 02:24:17,992 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-23 02:24:17,997 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-23 02:24:17,998 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-23 02:24:18,003 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-23 02:24:18,268 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-23 02:24:18,275 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-23 02:24:18,277 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-23 02:24:18,282 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-23 02:24:18,283 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-23 02:24:18,290 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-23 02:24:18,551 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-23 02:24:18,560 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-23 02:24:18,561 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-23 02:24:18,570 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-23 02:24:18,571 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-23 02:24:18,576 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-23 02:24:18,577 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-23 02:24:18,587 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-23 02:24:18,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-23 02:24:18,806 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 15 variables, input treesize:556, output treesize:555 [2018-11-23 02:24:21,288 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2018-11-23 02:24:21,289 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-23 02:24:21,297 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-23 02:24:21,298 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-23 02:24:21,310 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-23 02:24:21,564 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-23 02:24:21,575 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-23 02:24:21,576 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-23 02:24:21,583 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-23 02:24:21,583 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-23 02:24:21,595 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-23 02:24:21,806 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-23 02:24:21,815 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-23 02:24:21,815 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-23 02:24:21,823 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-23 02:24:21,824 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-23 02:24:21,836 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-23 02:24:22,052 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:22,058 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:22,058 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-23 02:24:22,065 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-23 02:24:22,066 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-23 02:24:22,071 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-23 02:24:22,307 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-23 02:24:22,313 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-23 02:24:22,314 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:22,319 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:22,506 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:22,515 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:22,516 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-23 02:24:22,528 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-23 02:24:22,530 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-23 02:24:22,540 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-23 02:24:22,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 17 dim-0 vars, and 8 xjuncts. [2018-11-23 02:24:22,683 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 15 variables, input treesize:556, output treesize:506 [2018-11-23 02:24:25,148 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2018-11-23 02:24:25,149 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-23 02:24:25,161 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-23 02:24:25,162 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-23 02:24:25,177 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-23 02:24:25,177 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-23 02:24:25,185 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-23 02:24:25,185 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-23 02:24:25,196 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-23 02:24:25,456 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-23 02:24:25,464 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-23 02:24:25,464 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-23 02:24:25,472 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-23 02:24:25,473 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-23 02:24:25,481 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-23 02:24:25,733 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:25,739 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:25,739 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-23 02:24:25,748 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-23 02:24:25,749 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-23 02:24:25,757 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-23 02:24:25,758 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-23 02:24:25,768 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-23 02:24:25,977 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-23 02:24:25,984 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-23 02:24:25,984 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-23 02:24:25,990 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-23 02:24:25,990 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:25,995 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:26,170 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-23 02:24:26,177 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-23 02:24:26,178 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-23 02:24:26,185 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-23 02:24:26,358 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-23 02:24:26,364 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-23 02:24:26,364 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:26,369 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:26,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-23 02:24:26,507 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 15 variables, input treesize:556, output treesize:555 [2018-11-23 02:24:29,003 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2018-11-23 02:24:29,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-23 02:24:29,018 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-23 02:24:29,019 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-23 02:24:29,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-23 02:24:29,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-23 02:24:29,040 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-23 02:24:29,041 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-23 02:24:29,052 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-23 02:24:29,345 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-23 02:24:29,353 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-23 02:24:29,353 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:29,360 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:29,361 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-23 02:24:29,370 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-23 02:24:29,615 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:29,620 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:29,621 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-23 02:24:29,630 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-23 02:24:29,631 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-23 02:24:29,639 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-23 02:24:29,640 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-23 02:24:29,649 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-23 02:24:29,851 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-23 02:24:29,858 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-23 02:24:29,859 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-23 02:24:29,867 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-23 02:24:30,072 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-23 02:24:30,079 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-23 02:24:30,080 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-23 02:24:30,086 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-23 02:24:30,087 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-23 02:24:30,093 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-23 02:24:30,304 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:30,311 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:30,312 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-23 02:24:30,320 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-23 02:24:30,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-23 02:24:30,506 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 15 variables, input treesize:556, output treesize:555 [2018-11-23 02:24:33,019 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2018-11-23 02:24:33,020 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-23 02:24:33,028 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-23 02:24:33,029 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-23 02:24:33,037 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-23 02:24:33,038 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-23 02:24:33,045 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-23 02:24:33,046 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-23 02:24:33,055 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-23 02:24:33,424 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-23 02:24:33,432 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-23 02:24:33,433 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-23 02:24:33,444 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-23 02:24:33,445 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-23 02:24:33,458 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-23 02:24:33,780 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-23 02:24:33,791 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-23 02:24:33,791 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:33,797 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:33,798 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-23 02:24:33,809 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-23 02:24:34,127 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-23 02:24:34,135 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-23 02:24:34,135 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:34,140 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:34,141 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-23 02:24:34,147 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-23 02:24:34,147 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:34,152 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:34,405 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-23 02:24:34,413 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-23 02:24:34,414 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-23 02:24:34,424 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-23 02:24:34,678 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:34,684 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:34,685 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-23 02:24:34,691 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-23 02:24:34,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 6 dim-2 vars, End of recursive call: 19 dim-0 vars, and 9 xjuncts. [2018-11-23 02:24:34,889 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 15 variables, input treesize:556, output treesize:555 [2018-11-23 02:24:45,360 WARN L180 SmtUtils]: Spent 8.34 s on a formula simplification. DAG size of input: 191 DAG size of output: 189 [2018-11-23 02:24:45,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:45,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:45,385 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-23 02:24:45,406 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-23 02:24:51,589 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-23 02:24:51,612 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-23 02:24:51,613 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-23 02:24:51,631 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-23 02:24:51,633 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-23 02:24:51,673 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-23 02:24:54,557 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-23 02:24:54,576 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-23 02:24:54,576 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-23 02:24:54,592 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-23 02:24:54,593 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:54,609 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:56,791 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-23 02:24:56,807 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-23 02:24:56,808 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-23 02:24:56,819 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-23 02:24:58,472 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 02:24:58,487 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:24:58,489 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-23 02:24:58,514 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-23 02:24:58,516 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-23 02:24:58,558 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-23 02:24:59,548 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-23 02:24:59,560 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-23 02:24:59,561 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-23 02:24:59,585 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-23 02:24:59,585 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-23 02:24:59,605 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-23 02:25:00,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 6 dim-2 vars, End of recursive call: 33 dim-0 vars, and 8 xjuncts. [2018-11-23 02:25:00,381 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 21 variables, input treesize:2086, output treesize:2354 [2018-11-23 02:25:24,359 WARN L180 SmtUtils]: Spent 19.51 s on a formula simplification. DAG size of input: 291 DAG size of output: 117 [2018-11-23 02:25:25,851 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 267 DAG size of output: 158 [2018-11-23 02:25:25,857 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 292 treesize of output 270 [2018-11-23 02:25:25,905 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-23 02:25:25,940 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-23 02:25:25,940 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:25,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,005 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-23 02:25:26,036 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-23 02:25:26,037 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,047 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,050 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-23 02:25:26,076 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-23 02:25:26,077 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,082 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,101 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-23 02:25:26,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 172 [2018-11-23 02:25:26,262 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 20 treesize of output 24 [2018-11-23 02:25:26,272 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-23 02:25:26,272 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,289 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,317 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:26,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2018-11-23 02:25:26,361 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 13 treesize of output 12 [2018-11-23 02:25:26,362 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,376 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:26,378 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 85 treesize of output 82 [2018-11-23 02:25:26,380 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-23 02:25:26,380 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,387 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 21 treesize of output 4 [2018-11-23 02:25:26,387 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,392 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,393 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:26,394 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 41 treesize of output 38 [2018-11-23 02:25:26,396 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-23 02:25:26,396 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,402 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 21 treesize of output 4 [2018-11-23 02:25:26,402 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,411 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,426 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,429 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:26,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 118 [2018-11-23 02:25:26,465 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 13 treesize of output 12 [2018-11-23 02:25:26,465 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,480 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:26,481 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 97 treesize of output 92 [2018-11-23 02:25:26,484 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-23 02:25:26,484 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,497 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 31 treesize of output 21 [2018-11-23 02:25:26,497 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,512 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,513 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:26,514 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 53 treesize of output 48 [2018-11-23 02:25:26,517 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-23 02:25:26,517 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,527 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 31 treesize of output 21 [2018-11-23 02:25:26,527 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,535 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,558 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 02:25:26,584 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,703 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:26,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 80 [2018-11-23 02:25:26,740 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 20 treesize of output 24 [2018-11-23 02:25:26,753 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-23 02:25:26,753 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,764 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 42 [2018-11-23 02:25:26,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 26 treesize of output 9 [2018-11-23 02:25:26,791 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,796 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2018-11-23 02:25:26,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 26 [2018-11-23 02:25:26,843 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,853 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:26,867 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:25:26,965 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 186 treesize of output 143 [2018-11-23 02:25:27,011 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 91 treesize of output 80 [2018-11-23 02:25:27,022 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 80 treesize of output 84 [2018-11-23 02:25:27,022 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,040 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,064 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 80 [2018-11-23 02:25:27,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 82 [2018-11-23 02:25:27,155 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-11-23 02:25:27,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 55 [2018-11-23 02:25:27,229 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,230 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,235 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 38 [2018-11-23 02:25:27,235 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,249 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2018-11-23 02:25:27,254 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 68 [2018-11-23 02:25:27,269 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 3 xjuncts. [2018-11-23 02:25:27,288 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 65 [2018-11-23 02:25:27,426 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,432 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2018-11-23 02:25:27,433 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,461 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 73 [2018-11-23 02:25:27,479 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 3 xjuncts. [2018-11-23 02:25:27,515 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 02:25:27,523 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 1 case distinctions, treesize of input 52 treesize of output 50 [2018-11-23 02:25:27,525 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,531 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 44 [2018-11-23 02:25:27,532 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,557 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 71 [2018-11-23 02:25:27,572 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 3 xjuncts. [2018-11-23 02:25:27,601 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 02:25:27,603 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,604 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 68 treesize of output 61 [2018-11-23 02:25:27,625 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-23 02:25:27,626 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,633 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,682 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-23 02:25:27,685 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 82 [2018-11-23 02:25:27,757 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 0 case distinctions, treesize of input 48 treesize of output 49 [2018-11-23 02:25:27,757 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:27,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-11-23 02:25:27,800 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 02:25:27,806 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,815 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,851 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,853 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 64 treesize of output 59 [2018-11-23 02:25:27,870 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-23 02:25:27,870 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:27,875 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 02:25:27,882 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 1 case distinctions, treesize of input 48 treesize of output 48 [2018-11-23 02:25:27,884 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2018-11-23 02:25:27,886 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:27,900 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2018-11-23 02:25:27,907 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:27,924 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:25:27,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 63 [2018-11-23 02:25:27,990 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:27,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 29 [2018-11-23 02:25:27,992 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 02:25:28,010 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 02:25:28,017 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2018-11-23 02:25:28,017 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-11-23 02:25:28,036 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 02:25:28,068 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 02:25:28,127 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 8 xjuncts. [2018-11-23 02:25:28,291 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 292 treesize of output 228 [2018-11-23 02:25:28,337 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 02:25:28,338 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 157 treesize of output 168 [2018-11-23 02:25:28,350 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 142 [2018-11-23 02:25:28,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 154 [2018-11-23 02:25:28,578 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 02:25:28,578 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_prenex_146 input size 46 context size 46 output size 46 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.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-23 02:25:28,581 INFO L168 Benchmark]: Toolchain (without parser) took 131024.37 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 572.0 MB). Free memory was 955.3 MB in the beginning and 1.2 GB in the end (delta: -248.1 MB). Peak memory consumption was 741.3 MB. Max. memory is 11.5 GB. [2018-11-23 02:25:28,582 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 02:25:28,582 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2018-11-23 02:25:28,582 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.72 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:25:28,582 INFO L168 Benchmark]: Boogie Preprocessor took 53.30 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-23 02:25:28,582 INFO L168 Benchmark]: RCFGBuilder took 664.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.0 MB in the end (delta: 79.6 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. [2018-11-23 02:25:28,583 INFO L168 Benchmark]: TraceAbstraction took 129569.38 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.3 MB). Free memory was 995.0 MB in the beginning and 1.2 GB in the end (delta: -208.5 MB). Peak memory consumption was 615.2 MB. Max. memory is 11.5 GB. [2018-11-23 02:25:28,584 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.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 701.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 955.3 MB in the beginning and 1.1 GB in the end (delta: -126.0 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.72 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.30 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 664.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 995.0 MB in the end (delta: 79.6 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 129569.38 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.3 MB). Free memory was 995.0 MB in the beginning and 1.2 GB in the end (delta: -208.5 MB). Peak memory consumption was 615.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: v_prenex_146 input size 46 context size 46 output size 46 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: v_prenex_146 input size 46 context size 46 output size 46: 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...