./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i -s /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:52:29,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:52:29,659 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:52:29,667 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:52:29,667 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:52:29,668 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:52:29,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:52:29,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:52:29,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:52:29,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:52:29,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:52:29,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:52:29,672 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:52:29,673 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:52:29,674 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:52:29,674 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:52:29,675 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:52:29,676 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:52:29,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:52:29,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:52:29,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:52:29,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:52:29,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:52:29,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:52:29,681 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:52:29,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:52:29,682 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:52:29,682 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:52:29,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:52:29,683 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:52:29,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:52:29,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:52:29,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:52:29,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:52:29,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:52:29,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:52:29,686 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-09 15:52:29,696 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:52:29,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:52:29,697 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:52:29,697 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:52:29,697 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 15:52:29,697 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 15:52:29,698 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 15:52:29,698 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:52:29,698 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 15:52:29,698 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:52:29,698 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 15:52:29,698 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:52:29,699 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:52:29,699 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:52:29,699 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:52:29,699 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 15:52:29,699 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:52:29,699 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 15:52:29,699 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:52:29,700 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:52:29,700 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:52:29,700 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:52:29,700 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:52:29,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:52:29,700 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:52:29,701 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:52:29,701 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:52:29,701 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 15:52:29,701 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:52:29,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:52:29,701 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9633ec6dc7e01a7231c1be5ed310faef61ba6b0 [2018-12-09 15:52:29,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:52:29,733 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:52:29,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:52:29,737 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:52:29,737 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:52:29,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 15:52:29,778 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/data/3088a6fba/cfeeb3cd5e8f46b6b878e455c5e9e6e6/FLAG05c447088 [2018-12-09 15:52:30,219 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:52:30,219 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/sv-benchmarks/c/forester-heap/dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 15:52:30,225 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/data/3088a6fba/cfeeb3cd5e8f46b6b878e455c5e9e6e6/FLAG05c447088 [2018-12-09 15:52:30,233 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/data/3088a6fba/cfeeb3cd5e8f46b6b878e455c5e9e6e6 [2018-12-09 15:52:30,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:52:30,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:52:30,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:52:30,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:52:30,238 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:52:30,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56412a8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30, skipping insertion in model container [2018-12-09 15:52:30,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:52:30,265 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:52:30,413 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:52:30,449 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:52:30,481 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:52:30,507 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:52:30,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30 WrapperNode [2018-12-09 15:52:30,508 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:52:30,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:52:30,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:52:30,508 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:52:30,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,521 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:52:30,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:52:30,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:52:30,526 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:52:30,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,534 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,534 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... [2018-12-09 15:52:30,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:52:30,550 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:52:30,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:52:30,550 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:52:30,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/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-12-09 15:52:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 15:52:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 15:52:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 15:52:30,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:52:30,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:52:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:52:30,584 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:52:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 15:52:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 15:52:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 15:52:30,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:52:30,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:52:30,823 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:52:30,823 INFO L280 CfgBuilder]: Removed 17 assue(true) statements. [2018-12-09 15:52:30,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:52:30 BoogieIcfgContainer [2018-12-09 15:52:30,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:52:30,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:52:30,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:52:30,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:52:30,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:52:30" (1/3) ... [2018-12-09 15:52:30,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccfe39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:52:30, skipping insertion in model container [2018-12-09 15:52:30,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:52:30" (2/3) ... [2018-12-09 15:52:30,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccfe39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:52:30, skipping insertion in model container [2018-12-09 15:52:30,828 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:52:30" (3/3) ... [2018-12-09 15:52:30,829 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_false-unreach-call_false-valid-memtrack.i [2018-12-09 15:52:30,834 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:52:30,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-12-09 15:52:30,848 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2018-12-09 15:52:30,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 15:52:30,864 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:52:30,864 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 15:52:30,864 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:52:30,864 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:52:30,864 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:52:30,864 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:52:30,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:52:30,864 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:52:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-12-09 15:52:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 15:52:30,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:30,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:30,879 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:30,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:30,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1252939669, now seen corresponding path program 1 times [2018-12-09 15:52:30,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:30,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:30,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:30,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:30,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:30,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:30,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:52:30,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:52:30,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-09 15:52:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-09 15:52:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 15:52:30,992 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2018-12-09 15:52:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:31,005 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-12-09 15:52:31,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-09 15:52:31,005 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-09 15:52:31,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:31,011 INFO L225 Difference]: With dead ends: 98 [2018-12-09 15:52:31,011 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 15:52:31,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-09 15:52:31,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 15:52:31,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-09 15:52:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-09 15:52:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-12-09 15:52:31,034 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2018-12-09 15:52:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:31,034 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-12-09 15:52:31,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-09 15:52:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-12-09 15:52:31,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-09 15:52:31,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:31,035 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:31,036 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:31,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:31,036 INFO L82 PathProgramCache]: Analyzing trace with hash -249318588, now seen corresponding path program 1 times [2018-12-09 15:52:31,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:31,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:31,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:31,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:31,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:52:31,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:52:31,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:52:31,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:52:31,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:52:31,091 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 4 states. [2018-12-09 15:52:31,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:31,153 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-12-09 15:52:31,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:52:31,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-09 15:52:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:31,155 INFO L225 Difference]: With dead ends: 51 [2018-12-09 15:52:31,155 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 15:52:31,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:52:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 15:52:31,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-12-09 15:52:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 15:52:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-12-09 15:52:31,160 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 11 [2018-12-09 15:52:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:31,161 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-12-09 15:52:31,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:52:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-12-09 15:52:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-09 15:52:31,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:31,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:31,162 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:31,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:31,162 INFO L82 PathProgramCache]: Analyzing trace with hash 861058516, now seen corresponding path program 1 times [2018-12-09 15:52:31,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:31,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:31,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:31,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:31,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:52:31,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:52:31,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:52:31,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:52:31,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:52:31,208 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 4 states. [2018-12-09 15:52:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:31,249 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-09 15:52:31,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:52:31,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-09 15:52:31,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:31,250 INFO L225 Difference]: With dead ends: 43 [2018-12-09 15:52:31,250 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 15:52:31,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:52:31,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 15:52:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 15:52:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 15:52:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-12-09 15:52:31,253 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 12 [2018-12-09 15:52:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:31,253 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-12-09 15:52:31,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:52:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-12-09 15:52:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:52:31,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:31,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:31,254 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:31,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:31,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1447599299, now seen corresponding path program 1 times [2018-12-09 15:52:31,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:31,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:31,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:31,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:31,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:31,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:52:31,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:52:31,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:52:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:52:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:52:31,298 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2018-12-09 15:52:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:31,376 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-12-09 15:52:31,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:52:31,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 15:52:31,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:31,377 INFO L225 Difference]: With dead ends: 66 [2018-12-09 15:52:31,377 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 15:52:31,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:52:31,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 15:52:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-12-09 15:52:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-09 15:52:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2018-12-09 15:52:31,381 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 14 [2018-12-09 15:52:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:31,382 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2018-12-09 15:52:31,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:52:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2018-12-09 15:52:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 15:52:31,382 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:31,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:31,382 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:31,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:31,383 INFO L82 PathProgramCache]: Analyzing trace with hash -2041464428, now seen corresponding path program 1 times [2018-12-09 15:52:31,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:31,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:31,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:31,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:31,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:52:31,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:52:31,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:52:31,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:52:31,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:52:31,426 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 4 states. [2018-12-09 15:52:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:31,479 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-12-09 15:52:31,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:52:31,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-09 15:52:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:31,480 INFO L225 Difference]: With dead ends: 48 [2018-12-09 15:52:31,480 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 15:52:31,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12-09 15:52:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 15:52:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-09 15:52:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 15:52:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-12-09 15:52:31,484 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-12-09 15:52:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:31,484 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-12-09 15:52:31,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:52:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-12-09 15:52:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 15:52:31,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:31,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:31,485 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:31,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 952866840, now seen corresponding path program 1 times [2018-12-09 15:52:31,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:31,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:31,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:52:31,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 15:52:31,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:52:31,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:52:31,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 15:52:31,518 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 4 states. [2018-12-09 15:52:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:31,551 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-12-09 15:52:31,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:52:31,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-09 15:52:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:31,552 INFO L225 Difference]: With dead ends: 46 [2018-12-09 15:52:31,552 INFO L226 Difference]: Without dead ends: 44 [2018-12-09 15:52:31,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:52:31,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-09 15:52:31,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-09 15:52:31,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 15:52:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-09 15:52:31,557 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2018-12-09 15:52:31,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:31,557 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-09 15:52:31,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:52:31,558 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-09 15:52:31,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 15:52:31,558 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:31,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:31,559 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:31,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:31,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1947786916, now seen corresponding path program 1 times [2018-12-09 15:52:31,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:31,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:31,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:31,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:31,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:52:31,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 15:52:31,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 15:52:31,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 15:52:31,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 15:52:31,633 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 5 states. [2018-12-09 15:52:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:31,692 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-12-09 15:52:31,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 15:52:31,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-09 15:52:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:31,693 INFO L225 Difference]: With dead ends: 59 [2018-12-09 15:52:31,693 INFO L226 Difference]: Without dead ends: 47 [2018-12-09 15:52:31,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:52:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-09 15:52:31,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-09 15:52:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 15:52:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-12-09 15:52:31,696 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2018-12-09 15:52:31,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:31,696 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-12-09 15:52:31,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 15:52:31,696 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-12-09 15:52:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-09 15:52:31,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:31,697 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] [2018-12-09 15:52:31,697 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:31,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:31,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1663987840, now seen corresponding path program 1 times [2018-12-09 15:52:31,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:31,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:31,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:31,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:31,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:31,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:52:31,753 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/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-12-09 15:52:31,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:31,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:31,810 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-12-09 15:52:31,812 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 24 treesize of output 27 [2018-12-09 15:52:31,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,816 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-12-09 15:52:31,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,820 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-09 15:52:31,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,842 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,851 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-12-09 15:52:31,853 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 24 treesize of output 27 [2018-12-09 15:52:31,855 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,856 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-12-09 15:52:31,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,860 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2018-12-09 15:52:31,864 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,879 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,884 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,889 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,899 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2018-12-09 15:52:31,930 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 24 treesize of output 18 [2018-12-09 15:52:31,933 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,934 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 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 15:52:31,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,943 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 24 treesize of output 18 [2018-12-09 15:52:31,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:31,945 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 0 case distinctions, treesize of input 18 treesize of output 10 [2018-12-09 15:52:31,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:31,951 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2018-12-09 15:52:31,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:31,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:52:31,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-09 15:52:31,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:52:31,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:52:31,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:52:31,975 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 8 states. [2018-12-09 15:52:32,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:32,166 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-09 15:52:32,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 15:52:32,167 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2018-12-09 15:52:32,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:32,167 INFO L225 Difference]: With dead ends: 63 [2018-12-09 15:52:32,167 INFO L226 Difference]: Without dead ends: 41 [2018-12-09 15:52:32,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 15:52:32,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-09 15:52:32,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-09 15:52:32,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-09 15:52:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-12-09 15:52:32,170 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 21 [2018-12-09 15:52:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:32,170 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-12-09 15:52:32,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:52:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-12-09 15:52:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 15:52:32,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:32,170 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-12-09 15:52:32,170 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:32,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash -306382864, now seen corresponding path program 1 times [2018-12-09 15:52:32,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:32,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:32,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:32,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:32,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:52:32,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/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-12-09 15:52:32,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:32,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:32,305 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 9 treesize of output 12 [2018-12-09 15:52:32,308 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 12 treesize of output 11 [2018-12-09 15:52:32,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,328 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 15:52:32,330 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 10 treesize of output 9 [2018-12-09 15:52:32,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,332 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:32,339 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2018-12-09 15:52:32,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:32,366 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:32,367 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 15:52:32,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,383 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:32,387 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:32,402 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:32,405 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:32,420 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 51 [2018-12-09 15:52:32,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:32,425 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 16 treesize of output 23 [2018-12-09 15:52:32,425 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,436 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 52 treesize of output 46 [2018-12-09 15:52:32,439 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 10 treesize of output 9 [2018-12-09 15:52:32,439 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,448 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:32,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 73 [2018-12-09 15:52:32,466 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 50 treesize of output 87 [2018-12-09 15:52:32,466 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-12-09 15:52:32,479 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:52:32,490 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:52:32,501 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-09 15:52:32,520 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 65 [2018-12-09 15:52:32,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:32,563 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 28 treesize of output 22 [2018-12-09 15:52:32,573 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 22 treesize of output 13 [2018-12-09 15:52:32,574 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,589 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,593 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,595 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2018-12-09 15:52:32,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:32,616 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 11 [2018-12-09 15:52:32,624 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 11 treesize of output 3 [2018-12-09 15:52:32,624 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,626 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,630 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,645 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 8 variables, input treesize:105, output treesize:14 [2018-12-09 15:52:32,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-12-09 15:52:32,661 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 10 treesize of output 9 [2018-12-09 15:52:32,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:32,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-12-09 15:52:32,705 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 28 treesize of output 26 [2018-12-09 15:52:32,707 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 7 treesize of output 1 [2018-12-09 15:52:32,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,711 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 3 [2018-12-09 15:52:32,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:32,714 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2018-12-09 15:52:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:32,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:52:32,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-12-09 15:52:32,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 15:52:32,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 15:52:32,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:52:32,732 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2018-12-09 15:52:33,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:33,295 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2018-12-09 15:52:33,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 15:52:33,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-12-09 15:52:33,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:33,296 INFO L225 Difference]: With dead ends: 107 [2018-12-09 15:52:33,296 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 15:52:33,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2018-12-09 15:52:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 15:52:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-12-09 15:52:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 15:52:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2018-12-09 15:52:33,302 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 25 [2018-12-09 15:52:33,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:33,302 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2018-12-09 15:52:33,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 15:52:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2018-12-09 15:52:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 15:52:33,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:33,303 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, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:33,303 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:33,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1987060883, now seen corresponding path program 1 times [2018-12-09 15:52:33,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:33,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:33,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:33,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:33,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:33,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:52:33,494 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/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-12-09 15:52:33,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:33,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:33,525 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 9 treesize of output 12 [2018-12-09 15:52:33,528 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 12 treesize of output 11 [2018-12-09 15:52:33,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:33,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2018-12-09 15:52:33,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,584 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,585 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 15:52:33,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,611 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-12-09 15:52:33,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:33,625 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,638 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 42 treesize of output 38 [2018-12-09 15:52:33,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:33,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-12-09 15:52:33,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,661 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 14 treesize of output 47 [2018-12-09 15:52:33,662 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,671 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,677 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,684 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,696 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-12-09 15:52:33,720 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-12-09 15:52:33,720 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-12-09 15:52:33,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:33,740 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,752 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-12-09 15:52:33,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,755 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 18 treesize of output 35 [2018-12-09 15:52:33,755 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,763 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,775 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,781 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,790 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:191, output treesize:71 [2018-12-09 15:52:33,814 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 33 treesize of output 26 [2018-12-09 15:52:33,816 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 26 treesize of output 25 [2018-12-09 15:52:33,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 182 [2018-12-09 15:52:33,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,842 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 99 [2018-12-09 15:52:33,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,876 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 149 treesize of output 109 [2018-12-09 15:52:33,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,881 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 143 [2018-12-09 15:52:33,881 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,889 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,896 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:212, output treesize:94 [2018-12-09 15:52:33,942 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 101 treesize of output 67 [2018-12-09 15:52:33,944 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 53 treesize of output 40 [2018-12-09 15:52:33,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,952 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 43 treesize of output 32 [2018-12-09 15:52:33,953 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,958 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,965 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 46 treesize of output 38 [2018-12-09 15:52:33,967 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 29 treesize of output 18 [2018-12-09 15:52:33,967 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,973 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:33,973 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 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 15:52:33,974 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,980 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:108, output treesize:13 [2018-12-09 15:52:33,995 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 15 treesize of output 11 [2018-12-09 15:52:33,996 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 11 treesize of output 3 [2018-12-09 15:52:33,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:33,998 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-12-09 15:52:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:34,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:52:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 19 [2018-12-09 15:52:34,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-09 15:52:34,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-09 15:52:34,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-12-09 15:52:34,028 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 19 states. [2018-12-09 15:52:34,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:34,900 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2018-12-09 15:52:34,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 15:52:34,901 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-12-09 15:52:34,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:34,901 INFO L225 Difference]: With dead ends: 115 [2018-12-09 15:52:34,901 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 15:52:34,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2018-12-09 15:52:34,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 15:52:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2018-12-09 15:52:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-09 15:52:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2018-12-09 15:52:34,907 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 32 [2018-12-09 15:52:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:34,907 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2018-12-09 15:52:34,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-09 15:52:34,908 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2018-12-09 15:52:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 15:52:34,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:34,908 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, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:34,909 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:34,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:34,909 INFO L82 PathProgramCache]: Analyzing trace with hash -2121074389, now seen corresponding path program 1 times [2018-12-09 15:52:34,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:34,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:34,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:34,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:34,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:35,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:52:35,034 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/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-12-09 15:52:35,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:35,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:35,062 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 9 treesize of output 12 [2018-12-09 15:52:35,065 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 12 treesize of output 11 [2018-12-09 15:52:35,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:35,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2018-12-09 15:52:35,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,104 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-12-09 15:52:35,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,134 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 57 [2018-12-09 15:52:35,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:35,151 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,166 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 46 treesize of output 40 [2018-12-09 15:52:35,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-12-09 15:52:35,168 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-12-09 15:52:35,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,192 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 16 treesize of output 53 [2018-12-09 15:52:35,192 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,201 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,209 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,236 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 84 [2018-12-09 15:52:35,272 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 14 treesize of output 13 [2018-12-09 15:52:35,272 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 78 [2018-12-09 15:52:35,292 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 10 treesize of output 9 [2018-12-09 15:52:35,292 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,302 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,305 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2018-12-09 15:52:35,307 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,308 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 20 treesize of output 41 [2018-12-09 15:52:35,309 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,317 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,323 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,329 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:35,342 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 5 variables, input treesize:212, output treesize:111 [2018-12-09 15:52:35,378 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,390 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 20 treesize of output 21 [2018-12-09 15:52:35,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,596 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 784 treesize of output 624 [2018-12-09 15:52:35,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:35,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 592 treesize of output 812 [2018-12-09 15:52:35,642 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:35,897 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:35,915 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:36,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 726 treesize of output 483 [2018-12-09 15:52:36,236 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-12-09 15:52:36,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,243 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 72 treesize of output 150 [2018-12-09 15:52:36,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,267 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:36,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 74 treesize of output 145 [2018-12-09 15:52:36,276 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:36,293 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:36,358 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 437 treesize of output 455 [2018-12-09 15:52:36,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 22 treesize of output 21 [2018-12-09 15:52:36,361 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:36,397 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:36,420 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 452 [2018-12-09 15:52:36,425 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,427 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 67 [2018-12-09 15:52:36,432 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,433 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 126 [2018-12-09 15:52:36,442 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:36,455 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:36,507 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:36,552 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:36,601 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:36,747 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 461 treesize of output 250 [2018-12-09 15:52:36,920 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-12-09 15:52:36,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:36,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 204 [2018-12-09 15:52:36,933 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,034 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 232 [2018-12-09 15:52:37,039 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-12-09 15:52:37,040 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,068 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:37,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 227 [2018-12-09 15:52:37,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:37,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 212 [2018-12-09 15:52:37,085 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:37,086 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:37,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 247 [2018-12-09 15:52:37,092 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,110 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,131 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,149 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,166 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:37,189 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:798, output treesize:200 [2018-12-09 15:52:37,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 125 [2018-12-09 15:52:37,305 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 45 treesize of output 30 [2018-12-09 15:52:37,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,317 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:37,318 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 0 case distinctions, treesize of input 26 treesize of output 23 [2018-12-09 15:52:37,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:37,327 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 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-09 15:52:37,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:37,341 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:309, output treesize:121 [2018-12-09 15:52:37,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 59 [2018-12-09 15:52:37,367 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-12-09 15:52:37,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,374 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 29 treesize of output 20 [2018-12-09 15:52:37,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,379 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 12 treesize of output 4 [2018-12-09 15:52:37,379 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:37,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:125, output treesize:4 [2018-12-09 15:52:37,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:37,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:52:37,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-12-09 15:52:37,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-09 15:52:37,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-09 15:52:37,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-12-09 15:52:37,414 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 15 states. [2018-12-09 15:52:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:38,198 INFO L93 Difference]: Finished difference Result 111 states and 121 transitions. [2018-12-09 15:52:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 15:52:38,198 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 32 [2018-12-09 15:52:38,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:38,199 INFO L225 Difference]: With dead ends: 111 [2018-12-09 15:52:38,199 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 15:52:38,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2018-12-09 15:52:38,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 15:52:38,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 84. [2018-12-09 15:52:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-09 15:52:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2018-12-09 15:52:38,205 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 32 [2018-12-09 15:52:38,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:38,205 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2018-12-09 15:52:38,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-09 15:52:38,205 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2018-12-09 15:52:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 15:52:38,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:38,206 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 15:52:38,206 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:38,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:38,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2122609175, now seen corresponding path program 2 times [2018-12-09 15:52:38,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:38,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:38,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:38,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:52:38,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:38,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:52:38,361 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/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-12-09 15:52:38,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 15:52:38,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:52:38,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:52:38,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:38,402 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 9 treesize of output 12 [2018-12-09 15:52:38,405 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 12 treesize of output 11 [2018-12-09 15:52:38,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:38,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2018-12-09 15:52:38,444 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,446 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,446 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 15:52:38,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-12-09 15:52:38,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:38,495 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,511 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 42 treesize of output 38 [2018-12-09 15:52:38,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:38,514 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-12-09 15:52:38,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,541 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 14 treesize of output 47 [2018-12-09 15:52:38,541 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,554 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,563 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,570 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,586 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-12-09 15:52:38,610 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-12-09 15:52:38,610 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-12-09 15:52:38,628 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 8 treesize of output 7 [2018-12-09 15:52:38,628 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-12-09 15:52:38,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,642 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:38,643 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 18 treesize of output 46 [2018-12-09 15:52:38,643 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,650 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,656 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,661 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,674 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:197, output treesize:92 [2018-12-09 15:52:38,700 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 90 [2018-12-09 15:52:38,702 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,704 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 88 [2018-12-09 15:52:38,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,719 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 76 [2018-12-09 15:52:38,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,741 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 82 [2018-12-09 15:52:38,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,751 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,761 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:84 [2018-12-09 15:52:38,863 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 83 [2018-12-09 15:52:38,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,866 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:38,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2018-12-09 15:52:38,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,880 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-12-09 15:52:38,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:38,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:38,896 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 37 treesize of output 29 [2018-12-09 15:52:38,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:38,898 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 0 case distinctions, treesize of input 20 treesize of output 10 [2018-12-09 15:52:38,899 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,903 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 5 treesize of output 1 [2018-12-09 15:52:38,903 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,904 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:38,907 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:125, output treesize:10 [2018-12-09 15:52:38,918 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:38,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:52:38,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2018-12-09 15:52:38,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 15:52:38,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 15:52:38,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-12-09 15:52:38,933 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand 17 states. [2018-12-09 15:52:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:39,369 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2018-12-09 15:52:39,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 15:52:39,369 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2018-12-09 15:52:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:39,370 INFO L225 Difference]: With dead ends: 100 [2018-12-09 15:52:39,370 INFO L226 Difference]: Without dead ends: 75 [2018-12-09 15:52:39,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2018-12-09 15:52:39,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-09 15:52:39,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-09 15:52:39,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 15:52:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2018-12-09 15:52:39,374 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 35 [2018-12-09 15:52:39,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:39,375 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2018-12-09 15:52:39,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 15:52:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2018-12-09 15:52:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 15:52:39,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:39,375 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 15:52:39,375 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:39,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:39,376 INFO L82 PathProgramCache]: Analyzing trace with hash -249130087, now seen corresponding path program 2 times [2018-12-09 15:52:39,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:39,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:39,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:39,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:52:39,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:39,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:52:39,562 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/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-12-09 15:52:39,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 15:52:39,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 15:52:39,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:52:39,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:52:39,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-12-09 15:52:39,595 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 12 treesize of output 11 [2018-12-09 15:52:39,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,598 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:39,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2018-12-09 15:52:39,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:39,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:39,631 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-12-09 15:52:39,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,672 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 51 [2018-12-09 15:52:39,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:39,688 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,704 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 42 treesize of output 38 [2018-12-09 15:52:39,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 15:52:39,707 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2018-12-09 15:52:39,726 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:39,727 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 14 treesize of output 47 [2018-12-09 15:52:39,727 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,736 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,750 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,769 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 74 [2018-12-09 15:52:39,793 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-12-09 15:52:39,793 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 72 [2018-12-09 15:52:39,812 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 8 treesize of output 7 [2018-12-09 15:52:39,812 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,824 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:39,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-12-09 15:52:39,829 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:39,829 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:39,829 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 18 treesize of output 46 [2018-12-09 15:52:39,829 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,837 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,842 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,847 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:39,860 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:203, output treesize:102 [2018-12-09 15:52:39,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:39,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:39,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:39,935 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 20 treesize of output 21 [2018-12-09 15:52:39,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:40,145 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:40,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:40,582 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:40,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:40,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 3146 treesize of output 2201 [2018-12-09 15:52:41,224 WARN L180 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 83 [2018-12-09 15:52:41,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:41,234 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:41,237 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:41,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 64 treesize of output 130 [2018-12-09 15:52:41,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:41,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:41,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 66 treesize of output 139 [2018-12-09 15:52:41,278 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,306 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,407 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 2001 treesize of output 2017 [2018-12-09 15:52:41,413 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 20 treesize of output 19 [2018-12-09 15:52:41,413 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,498 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:41,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1980 treesize of output 1892 [2018-12-09 15:52:41,557 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:41,557 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:41,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 219 treesize of output 250 [2018-12-09 15:52:41,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:41,566 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:41,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 327 [2018-12-09 15:52:41,576 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,601 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,673 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,732 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,780 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,856 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:41,862 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:41,958 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 61 [2018-12-09 15:52:41,961 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 61 treesize of output 64 [2018-12-09 15:52:41,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:41,970 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 64 treesize of output 56 [2018-12-09 15:52:41,970 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,978 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:41,982 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:42,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1540 treesize of output 566 [2018-12-09 15:52:42,251 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 73 [2018-12-09 15:52:42,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 440 treesize of output 468 [2018-12-09 15:52:42,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,278 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 465 treesize of output 630 [2018-12-09 15:52:42,295 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:42,344 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:42,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,395 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,396 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 552 treesize of output 456 [2018-12-09 15:52:42,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-12-09 15:52:42,406 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:42,455 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 15:52:42,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 531 treesize of output 512 [2018-12-09 15:52:42,481 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,495 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 550 treesize of output 546 [2018-12-09 15:52:42,501 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,504 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 539 treesize of output 609 [2018-12-09 15:52:42,523 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-12-09 15:52:42,869 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,870 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:42,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 415 treesize of output 527 [2018-12-09 15:52:42,874 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:42,938 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:42,965 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:42,988 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,013 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 157 [2018-12-09 15:52:43,048 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 8 treesize of output 7 [2018-12-09 15:52:43,048 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 154 [2018-12-09 15:52:43,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,069 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 98 treesize of output 52 [2018-12-09 15:52:43,069 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,076 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,080 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 144 [2018-12-09 15:52:43,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,112 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 91 treesize of output 135 [2018-12-09 15:52:43,113 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,122 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:43,142 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 10 variables, input treesize:2496, output treesize:210 [2018-12-09 15:52:43,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 169 [2018-12-09 15:52:43,221 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 99 [2018-12-09 15:52:43,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-09 15:52:43,243 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 128 treesize of output 101 [2018-12-09 15:52:43,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:43,256 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 12 treesize of output 4 [2018-12-09 15:52:43,256 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:43,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2018-12-09 15:52:43,281 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 51 treesize of output 36 [2018-12-09 15:52:43,281 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,292 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 0 case distinctions, treesize of input 13 treesize of output 12 [2018-12-09 15:52:43,292 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,299 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 0 case distinctions, treesize of input 22 treesize of output 17 [2018-12-09 15:52:43,299 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,303 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 15:52:43,309 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:282, output treesize:22 [2018-12-09 15:52:43,326 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,327 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 15:52:43,327 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 22 treesize of output 24 [2018-12-09 15:52:43,331 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-12-09 15:52:43,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,335 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 11 treesize of output 3 [2018-12-09 15:52:43,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 15:52:43,339 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2018-12-09 15:52:43,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 15:52:43,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 15:52:43,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2018-12-09 15:52:43,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 15:52:43,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 15:52:43,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-12-09 15:52:43,377 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 20 states. [2018-12-09 15:52:44,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:52:44,242 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2018-12-09 15:52:44,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 15:52:44,243 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-12-09 15:52:44,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:52:44,243 INFO L225 Difference]: With dead ends: 128 [2018-12-09 15:52:44,243 INFO L226 Difference]: Without dead ends: 116 [2018-12-09 15:52:44,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2018-12-09 15:52:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-09 15:52:44,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2018-12-09 15:52:44,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 15:52:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2018-12-09 15:52:44,251 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 35 [2018-12-09 15:52:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:52:44,251 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2018-12-09 15:52:44,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 15:52:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2018-12-09 15:52:44,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 15:52:44,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:52:44,252 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:52:44,253 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 15:52:44,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:52:44,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1364216251, now seen corresponding path program 1 times [2018-12-09 15:52:44,253 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 15:52:44,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 15:52:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:44,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:52:44,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:52:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 15:52:44,302 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 15:52:44,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:52:44 BoogieIcfgContainer [2018-12-09 15:52:44,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:52:44,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:52:44,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:52:44,326 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:52:44,327 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:52:30" (3/4) ... [2018-12-09 15:52:44,328 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 15:52:44,358 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_e166cdad-6944-4589-92cb-5b3597fc217d/bin-2019/uautomizer/witness.graphml [2018-12-09 15:52:44,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:52:44,358 INFO L168 Benchmark]: Toolchain (without parser) took 14123.07 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 270.5 MB). Free memory was 951.7 MB in the beginning and 792.3 MB in the end (delta: 159.4 MB). Peak memory consumption was 430.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:44,359 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:52:44,359 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -100.1 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:44,359 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:44,359 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:52:44,359 INFO L168 Benchmark]: RCFGBuilder took 273.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:44,359 INFO L168 Benchmark]: TraceAbstraction took 13501.73 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 205.0 MB). Free memory was 1.0 GB in the beginning and 802.3 MB in the end (delta: 210.1 MB). Peak memory consumption was 415.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:44,359 INFO L168 Benchmark]: Witness Printer took 31.50 ms. Allocated memory is still 1.3 GB. Free memory was 802.3 MB in the beginning and 792.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2018-12-09 15:52:44,360 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 271.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 65.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -100.1 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 273.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13501.73 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 205.0 MB). Free memory was 1.0 GB in the beginning and 802.3 MB in the end (delta: 210.1 MB). Peak memory consumption was 415.1 MB. Max. memory is 11.5 GB. * Witness Printer took 31.50 ms. Allocated memory is still 1.3 GB. Free memory was 802.3 MB in the beginning and 792.3 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1021] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next VAL [end={36:0}, end->next={33:0}, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={30:0}, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1031] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={30:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={34:0}, end->colour=0, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1038] EXPR end->colour VAL [end={36:0}, end->colour=1, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={36:0}, list={30:0}, malloc(sizeof(struct TSLL))={36:0}, malloc(sizeof(struct TSLL))={30:0}, malloc(sizeof(struct TSLL))={34:0}, malloc(sizeof(struct TSLL))={33:0}, null={33:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 7 error locations. UNSAFE Result, 13.4s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 448 SDtfs, 736 SDslu, 2021 SDs, 0 SdLazy, 1683 SolverSat, 179 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 165 SyntacticMatches, 9 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 131 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 492 NumberOfCodeBlocks, 492 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 438 ConstructedInterpolants, 59 QuantifiedInterpolants, 542113 SizeOfPredicates, 84 NumberOfNonLiveVariables, 838 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 11/60 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...